Semirings, automata, languages
Semirings, automata, languages
Rational series and their languages
Rational series and their languages
Introduction to algorithms
Elements of information theory
Elements of information theory
Matrix computations (3rd ed.)
Digital images and formal languages
Handbook of formal languages, vol. 3
Automata, Languages, and Machines
Automata, Languages, and Machines
Automata: Theoretic Aspects of Formal Power Series
Automata: Theoretic Aspects of Formal Power Series
Semiring frameworks and algorithms for shortest-distance problems
Journal of Automata, Languages and Combinatorics
Finite-state transducers in language and speech processing
Computational Linguistics
On the existence of regular approximations
Theoretical Computer Science
Computation of distances for regular and context-free probabilistic languages
Theoretical Computer Science
General Algorithms for Testing the Ambiguity of Finite Automata
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Learning languages with rational kernels
COLT'07 Proceedings of the 20th annual conference on Learning theory
Products of weighted logic programs
Theory and Practice of Logic Programming
On the computation of some standard distances between probabilistic automata
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Measuring the confusability of pronunciations in speech recognition
FSMNLP '11 Proceedings of the 9th International Workshop on Finite State Methods and Natural Language Processing
| Hi-index | 0.00 |
The problem of the efficient computation of the relative entropy of two distributions represented by deterministic weighted automata arises in several machine learning problems. We show that this problem can be naturally formulated as a shortest-distance problem over an intersection automaton defined on an appropriate semiring. We describe simple and efficient novel algorithms for its computation and report the results of experiments demonstrating the practicality of our algorithms for very large weighted automata. Our algorithms apply to unambiguous weighted automata, a class of weighted automata that strictly includes deterministic weighted automata. These are also the first algorithms extending the computation of entropy or of relative entropy beyond the class of deterministic weighted automata.