Салмақталған автоматтар
Related Papers
Language Processing with Weighted Transducers
AbstractWeighted automata and transducers are used in a variety of applications ranging from automatic speech recognition and synthesis to computational biology. They give a unifying framework for the representation of …...
A Better N-Best List: Practical Determinization of Weighted Finite Tree Automata
Ranked lists of output trees from syn- tactic statistical NLP applications fre- quently contain multiple repeated entries. This redundancy leads to misrepresenta- tion of tree weight and reduced informa- tion …...
Finding Cognate Groups Using Phylogenies
A central problem in historical linguistics is the identification of historically related cognate words. We present a generative phylogenetic model for automatically in- ducing cognate group structure from un- aligned …...
Implicitly Intersecting Weighted Automata using Dual Decomposition
We propose an algorithm to find the best path through an intersection of arbitrarily many weighted automata, without actually perform- ing the intersection. The algorithm is based on dual decomposition: …...