Inference of finite-state transducers by using regular grammars and morphisms

DOI10.1007/978-3-540-45257-7_1MaRDI QIDQ2753996zbMATH OpenFDO

Authors Francisco Casacuberta

Publication date 11 November 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-45257-7_1

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45) Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Recommendations

• Inference of finite-state transducers from regular languages
• Machine translation with inferred stochastic finite-state transducers
• Applications of finite-state transducers in natural language processing
• Grammatical Inference: Algorithms and Applications
• Learning finite-state models for machine translation

Cited in

(12)

• Learning finite-state models for machine translation
• Inference of finite-state transducers from regular languages
• Improve the learning of subsequential transducers by using alignments and dictionaries
• Injection Structures Specified by Finite State Transducers
• Using tree transducers for grammatical inference
• Machine translation with inferred stochastic finite-state transducers
• Evaluation and Comparison of Inferred Regular Grammars
• Finite State Transducers with Intuition
• Transducer inference by assembling specific languages
• scientific article; zbMATH DE number 1949651 (Why is no real title available?)
• Applications of finite-state transducers in natural language processing
• Finite state transducers with predicates and identities

This page was built for publication: Inference of finite-state transducers by using regular grammars and morphisms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2753996)