A disambiguation algorithm for finite automata and functional transducers

Authors:
Mehryar Mohri
Affiliations:
Courant Institute of Mathematical Sciences and Google Research, New York, NY
Venue:
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Year:
2012

Citing 6
Cited 0

Regular models of phonological rule systems

Computational Linguistics - Special issue on computational phonology
A construction on finite automata that has remained hidden

Theoretical Computer Science - Special issue: papers dedicated to the memory of Marcel-Paul Schützenberger
Automata, Languages, and Machines

Automata, Languages, and Machines
Finite-State Language Processing

Finite-State Language Processing
Efficient algorithms for testing the twins property

Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
Finite-state transducers in language and speech processing

Computational Linguistics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new disambiguation algorithm for finite automata and functional finite-state transducers. We give a full description of the algorithm, including a detailed pseudocode and analysis, and several illustrating examples. Our algorithm is often more efficient and the result dramatically smaller than the one obtained using determinization for finite automata or an existing disambiguation algorithm for transducers based on a construction of Schützenberger. In a variety of cases, the size of the unambiguous transducer returned by our algorithm is only linear in that of the input transducer while the transducer given by the construction of Schützenberger is exponentially larger. Our algorithm can be used effectively in many applications to make automata and transducers more efficient to use.