Introduction to algorithms
SIAM Journal on Computing
The Philips automatic train timetable information system
Speech Communication - Special issue on interactive voice technology for telecommunication applications
The String-to-String Correction Problem
Journal of the ACM (JACM)
On the Determinization of Weighted Finite Automata
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Subsumption-oriented Push-Down Automata
PLILP '92 Proceedings of the 4th International Symposium on Programming Language Implementation and Logic Programming
Finite-state transducers in language and speech processing
Computational Linguistics
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
Using restriction to extend parsing algorithms for complex-feature-based formalisms
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
The structure of shared forests in ambiguous parsing
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
A bag of useful techniques for efficient and robust parsing
ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
Treatment of ε-moves in subset construction
FSMNLP '09 Proceedings of the International Workshop on Finite State Methods in Natural Language Processing
| Hi-index | 0.00 |
Wordgraphs are structures that may be output by speech recognisers. We discuss various methods for turning wordgraphs into smaller structures. One of these methods is novel; this method relies on a new kind of determinization of acyclic weighted finite automata that is language-preserving but not fully weight-preserving, and results in smaller automata than in the case of traditional determinization of weighted finite automata. We present empirical data comparing the respective methods. The methods are relevant for systems in which wordgraphs form the input to kinds of syntactic analysis that are very time consuming, such as unification parsing.