On the Derivational Entropy of Left-to-Right Probabilistic Finite-State Automata and Hidden Markov Models

On the Derivational Entropy of Left-to-Right Probabilistic Finite-State Automata and Hidden Markov Models

Probabilistic finite-state automata are a formalism that is widely used in many problems of automatic speech recognition and natural language processing. Probabilistic finite-state automata are closely related to other finite-state models as weighted finite-state automata, word lattices, and hidden...

Full description

Bibliographic Details
Main Authors: Joan Andreu Sánchez, Martha Alicia Rocha, Verónica Romero, Mauricio Villegas
Format: Article
Language:English
Published: The MIT Press 2017-12-01
Series:Computational Linguistics
Online Access:http://dx.doi.org/10.1162/coli_a_00306

Similar Items

Similar Items