Skip to Main content Skip to Navigation
New interface
Conference papers

Efficient Pruning of Probabilistic Automata

Abstract : Applications of probabilistic grammatical inference are limited due to time and space consuming constraints. In statistical language modeling, for example, large corpora are now available and lead to managing automata with millions of states. We propose in this article a method for pruning automata (when restricted to tree based structures) which is not only efficient (sub-quadratic) but that allows to dramatically reduce the size of the automaton with a small impact on the underlying distribution. Results are evaluated on a language modeling task.
Document type :
Conference papers
Complete list of metadata
Contributor : Franck Thollard Connect in order to contact the contributor
Submitted on : Monday, March 9, 2009 - 3:42:18 PM
Last modification on : Saturday, June 25, 2022 - 10:49:56 AM
Long-term archiving on: : Friday, June 4, 2010 - 11:35:06 AM


Files produced by the author(s)


  • HAL Id : ujm-00322818, version 1



Franck Thollard, Baptiste Jeudy. Efficient Pruning of Probabilistic Automata. Structural and Statistical Pattern Recognition, Dec 2008, Orlando, United States. pp.65-75. ⟨ujm-00322818⟩



Record views


Files downloads