Inference of finite-state transducers from regular languages
From MaRDI portal
Publication:2485084
DOI10.1016/J.PATCOG.2004.03.025zbMATH Open1101.68645OpenAlexW2049401516MaRDI QIDQ2485084FDOQ2485084
Authors: David Picó, Francisco Casacuberta, Enrique Vidal
Publication date: 3 August 2005
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2004.03.025
Recommendations
Grammatical inferenceFormal language theoryMachine translationNatural language processingStochastic finite-state transducers
Cites Work
Cited In (13)
- Title not available (Why is that?)
- Information Extraction from Semi-structured Resources: A Two-Phase Finite State Transducers Approach
- Title not available (Why is that?)
- Structural, Syntactic, and Statistical Pattern Recognition
- Some statistical-estimation methods for stochastic finite-state transducers
- Injection Structures Specified by Finite State Transducers
- Machine translation with inferred stochastic finite-state transducers
- On the Inference of Finite State Automata from Positive and Negative Data
- Large Scale Inference of Deterministic Transductions: Tenjinno Problem 1
- Learning finite-state models for machine translation
- Finite state transducers with predicates and identities
- Finite State Transducers with Intuition
- Title not available (Why is that?)
Uses Software
This page was built for publication: Inference of finite-state transducers from regular languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2485084)