Probabilistic finite-state machines--part I |
| |
Authors: | Vidal Enrique Thollard Franck de la Higuera Colin Casacuberta Francisco Carrasco Rafael C |
| |
Affiliation: | Departamento de Sistemas Informaticos y Computacion, Univ. Politecnica de Valencia, Spain; |
| |
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 study the relation of probabilistic finite-state automata with other well-known devices that generate strings as hidden Markov models and n-grams and provide theorems, algorithms, and properties that represent a current state of the art of these objects. |
| |
Keywords: | |
本文献已被 PubMed 等数据库收录! |
|