On the learnability and usage of acyclic probabilistic finite automata

Keyphrases

• Learnability 100%
• Acyclic Probabilistic Finite Automata 100%
• Learning Algorithm 66%
• Pronunciation Model 66%
• Polynomial Time 33%
• Hardness Results 33%
• Probabilistic Model 33%
• Automata 33%
• Spoken Word 33%
• Log-likelihood Ratio 33%
• Learning Distributions 33%
• KL Divergence 33%
• Distribution Learning 33%
• Second Application 33%
• Distinguishability 33%
• Cursive Handwriting Recognition 33%
• Good Performance 33%
• Speech Dataset 33%
• Handwriting Recognition System 33%

Computer Science

• Finite Automata 100%
• Subclasses 100%
• Learning Algorithm 66%
• Polynomial Time 33%
• Good Performance 33%
• Handwriting Recognition 33%
• Recognition System 33%
• State Automaton 33%

Mathematics

• Polynomial Time 100%
• Log Likelihood 100%
• Test Data 100%