On the learnability and usage of acyclic probabilistic finite automata (Q1271548): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 03:46, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the learnability and usage of acyclic probabilistic finite automata |
scientific article |
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
