On the learnability and usage of acyclic probabilistic finite automata (Q1271548)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the learnability and usage of acyclic probabilistic finite automata |
scientific article; zbMATH DE number 1220910
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the learnability and usage of acyclic probabilistic finite automata |
scientific article; zbMATH DE number 1220910 |
Statements
On the learnability and usage of acyclic probabilistic finite automata (English)
0 references
10 November 1998
0 references
The authors' main effort is to propose and analyze a distribution learning algorithm for certain acyclic probabilistic finite automata. Special attention is given to the modeling of short sequences that correspond to objects such as short DNA sequences, spoken words, or single handwritten letters. Specifically, they construct models for cursive handwritten letters (but no ideograms) and pronunciation models for spoken words. Formal results are given in the form of two theorems and several lemmas.
0 references
distribution learning algorithm
0 references
acyclic probabilistic finite automata
0 references
0 references
0.9187775
0 references
0 references
0.91258645
0 references
0.90891194
0 references
0.8978005
0 references
0.89245534
0 references
0 references
