Semirings, automata, languages
Semirings, automata, languages
Rational series and their languages
Rational series and their languages
Regular models of phonological rule systems
Computational Linguistics - Special issue on computational phonology
Automata, Languages, and Machines
Automata, Languages, and Machines
Introduction to Formal Language Theory
Introduction to Formal Language Theory
Context-free error analysis by evaluation of algebraic power series
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
A finite-state morphological processor for Spanish
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Introduction to probabilistic automata (Computer science and applied mathematics)
Introduction to probabilistic automata (Computer science and applied mathematics)
Deterministic part-of-speech tagging with finite-state transducers
Computational Linguistics
A stochastic finite-state word-segmentation algorithm for Chinese
Computational Linguistics
Algorithmic aspects in speech recognition: an introduction
Journal of Experimental Algorithmics (JEA)
A new, simpler linear-time dominators algorithm
ACM Transactions on Programming Languages and Systems (TOPLAS)
Algorithmic Aspects of Speech Recognition: A Synopsis
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
On some applications of finite-state automata theory to natural language processing
Natural Language Engineering
Transducer parsing of free and frozen sentences
Natural Language Engineering
Multilingual text analysis for text-to-speech synthesis
Natural Language Engineering
EACL '99 Proceedings of the ninth conference on European chapter of the Association for Computational Linguistics
ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
A stochastic finite-state word-segmentation algorithm for Chinese
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
Compilation of weighted finite-state transducers from decision trees
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
An efficient compiler for weighted rewrite rules
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Bootstrapping Named Entity recognition for Italian Broadcast News
EMNLP '02 Proceedings of the ACL-02 conference on Empirical methods in natural language processing - Volume 10
Bayesian inference for finite-state transducers
HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Bootstrapping a unified model of lexical and phonetic acquisition
ACL '12 Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Long Papers - Volume 1
| Hi-index | 0.00 |
We present the concepts of weighted language, transduction and automaton from algebraic automata theory as a general framework for describing and implementing decoding cascades in speech and language processing. This generality allows us to represent uniformly such information sources as pronunciation dictionaries, language models and lattices, and to use uniform algorithms for building decoding stages and for optimizing and combining them. In particular, a single automata join algorithm can be used either to combine information sources such as a pronunciation dictionary and a context-dependency model during the construction of a decoder, or dynamically during the operation of the decoder. Applications to speech recognition and to Chinese text segmentation will be discussed.