N-WAY COMPOSITION OF WEIGHTED FINITE-STATE TRANSDUCERS

DOI10.1142/S0129054109006772MaRDI QIDQ3395133zbMATH OpenFDO

Authors Cyril Allauzen, Mehryar Mohri

Publication date 21 August 2009

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129054109006772

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• 3-Way Composition of Weighted Finite-State Transducers
• A filter-based algorithm for efficient composition of finite-state transducers
• scientific article; zbMATH DE number 2150300
• Filters for Efficient Composition of Weighted Finite-State Transducers
• Weighted automata algorithms

Cites work

• EDIT-DISTANCE OF WEIGHTED AUTOMATA: GENERAL DEFINITIONS AND ALGORITHMS
• The origins of combinatorics on words

Cited in

(7)

• Iterative weighted finite transductions
• Filters for Efficient Composition of Weighted Finite-State Transducers
• A filter-based algorithm for efficient composition of finite-state transducers
• 3-Way Composition of Weighted Finite-State Transducers
• scientific article; zbMATH DE number 2150300 (Why is no real title available?)
• Weighted automata algorithms
• Kernel methods for learning languages

This page was built for publication: N-WAY COMPOSITION OF WEIGHTED FINITE-STATE TRANSDUCERS

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