Smoothing probabilistic automata: An error-correcting approach

DOI10.1007/978-3-540-45257-7_5MaRDI QIDQ2754001zbMATH OpenFDO

Authors Juan-Carlos Amengual, Pierre Dupont

Publication date 11 November 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-45257-7_5

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• On the computational complexity of approximating distributions by probabilistic automata
• Structural, Syntactic, and Statistical Pattern Recognition
• Fitting probabilistic automata via the em algorithm
• Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms
• Learning probability distributions generated by finite-state machines

Cited in

(6)

• Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms
• Similarity based smoothing in language modeling
• scientific article; zbMATH DE number 1931834 (Why is no real title available?)
• \textsc{PAutomaC}: a probabilistic automata and hidden Markov models learning competition
• Testing the correlation of word error rate and perplexity
• Structural, Syntactic, and Statistical Pattern Recognition

This page was built for publication: Smoothing probabilistic automata: An error-correcting approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2754001)