Probabilistic finite-state machines--part II.
other · Level V
Where this comes from
- Record sourced from PubMed, PMID 16013751.
- No licence information is recorded for this record.
- Because redistribution is not established, this page shows the abstract only. Follow the links below for the full text.
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. In Part I of this paper, we surveyed these objects and studied their properties. In this Part II, we study the relations between probabilistic finite-state automata and other well-known devices that generate strings like hidden Markov models and n-grams and provide theorems, algorithms, and properties that represent a current state of the art of these objects.
Medical subject headings
- Algorithms
- Artificial Intelligence
- Information Storage and Retrieval
- Models, Statistical
- Natural Language Processing
- Pattern Recognition, Automated
- Signal Processing, Computer-Assisted