The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
An efficient context-free parsing algorithm
Communications of the ACM
Automata, Languages, and Machines
Automata, Languages, and Machines
Computational Complexity of Problems on Probabilistic Grammars and Transducers
ICGI '00 Proceedings of the 5th International Colloquium on Grammatical Inference: Algorithms and Applications
Weighted deductive parsing and Knuth's algorithm
Computational Linguistics
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
PCFG models of linguistic tree representations
Computational Linguistics
Statistical properties of probabilistic context-free grammars
Computational Linguistics
Relating probabilistic grammars and automata
ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
A Kleene Theorem for Weighted Tree Automata
Theory of Computing Systems
On the convergence of Newton's method for monotone systems of polynomial equations
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Computation of distances for regular and context-free probabilistic languages
Theoretical Computer Science
Computational Linguistics
Bisimulation Minimisation of Weighted Automata on Unranked Trees
Fundamenta Informaticae
Recursive markov chains, stochastic grammars, and monotone systems of nonlinear equations
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Why synchronous tree substitution grammars?
HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
ATANLP '10 Proceedings of the 2010 Workshop on Applications of Tree Automata in Natural Language Processing
An alternative to synchronous tree substitution grammars*
Natural Language Engineering
Reducing the size of the representation for the uDOP-estimate
EMNLP '11 Proceedings of the First Workshop on Unsupervised Learning in NLP
Tree parsing with synchronous tree-adjoining grammars
IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
Weighted Extended Tree Transducers
Fundamenta Informaticae
Survey: Weighted Extended Top-down Tree Transducers Part II—Application in Machine Translation
Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
Preservation of recognizability for weighted linear extended top-down tree transducers
ATANLP '12 Proceedings of the Workshop on Applications of Tree Automata Techniques in Natural Language Processing
| Hi-index | 0.00 |
We investigate several algorithms related to the parsing problem for weighted automata, under the assumption that the input is a string rather than a tree. This assumption is motivated by several natural language processing applications. We provide algorithms for the computation of parse-forests, best tree probability, inside probability (called partition function), and prefix probability. Our algorithms are obtained by extending to weighted tree automata the Bar-Hillel technique, as defined for context-free grammars.