The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.07 - July (2005 vol.27)
pp: 1013-1025
Enrique Vidal , IEEE Computer Society
Francisco Casacuberta , IEEE Computer Society
ABSTRACT
Probabilistic finite-state machines are used today in a variety of areas in pattern recognition, or in fields to which pattern recognition is linked: computational linguistics, machine learning, time series analysis, circuit testing, computational biology, speech recognition, and machine translation are some of them. In Part I of this paper, we survey these generative objects and study their definitions and properties. In Part II, we will study the relation of probabilistic finite-state automata with other well-known devices that generate strings as hidden Markov models and n\hbox{-}{\rm{grams}} and provide theorems, algorithms, and properties that represent a current state of the art of these objects.
INDEX TERMS
Index Terms- Automata, classes defined by grammars or automata, machine learning, language acquisition, language models, language parsing and understanding, machine translation, speech recognition and synthesis, structural pattern recognition, syntactic pattern recognition.
CITATION
Enrique Vidal, Franck Thollard, Colin de la Higuera, Francisco Casacuberta, Rafael C. Carrasco, "Probabilistic Finite-State Machines-Part I", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.27, no. 7, pp. 1013-1025, July 2005, doi:10.1109/TPAMI.2005.147
17 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool