Unification: a multidisciplinary survey
ACM Computing Surveys (CSUR)
A Kleene theorem for a class of planar acyclic graphs
Information and Computation
Hyperedge replacement graph grammars
Handbook of graph grammars and computing by graph transformation
SIAM Journal on Computing
A design principles of a weighted finite-state transducer library
Theoretical Computer Science - Special issue on implementing automata
Automata and Rational Expressions on Planar Graphs
MFCS '88 Proceedings of the Mathematical Foundations of Computer Science 1988
Computation of the N Best Parse Trees for Weighted and Stochastic Context-Free Grammars
Proceedings of the Joint IAPR International Workshops on Advances in Pattern Recognition
Automata and Pattern Matching in Planar Directed Acyclic Graphs
LATIN '92 Proceedings of the 1st Latin American Symposium on Theoretical Informatics
Determinization of finite state weighted tree automata
Journal of Automata, Languages and Combinatorics
Finite-state transducers in language and speech processing
Computational Linguistics
Computational Linguistics
Unification-based semantic interpretation
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
Acta Informatica
Learning non-isomorphic tree mappings for machine translation
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 2
A better N-best list: practical determinization of weighted finite tree automata
HLT-NAACL '06 Proceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics
Theoretical Computer Science
Computational Linguistics
NAACL-Tutorials '09 Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, Companion Volume: Tutorial Abstracts
Parsing '05 Proceedings of the Ninth International Workshop on Parsing Technology
The Power of Extended Top-Down Tree Transducers
SIAM Journal on Computing
Tiburon: a weighted tree automata toolkit
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
An overview of probabilistic tree transducers for natural language processing
CICLing'05 Proceedings of the 6th international conference on Computational Linguistics and Intelligent Text Processing
Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
IEEE Transactions on Information Theory
Hi-index | 0.00 |
Weighted finite-state acceptors and transducers (Pereira and Riley, 1997) are a critical technology for NLP and speech systems. They flexibly capture many kinds of stateful left-to-right substitution, simple transducers can be composed into more complex ones, and they are EM- trainable. They are unable to handle long-range syntactic movement, but tree acceptors and transducers address this weakness (Knight and Graehl, 2005). Tree automata have been profitably used in syntax-based MT systems. Still, strings and trees are both weak at representing linguistic structure involving semantics and reference ("who did what to whom"). Feature structures provide an attractive, well-studied, standard format (Shieber, 1986; Rounds and Kasper, 1986), which we can view computationally as directed acyclic graphs. In this paper, we develop probabilistic acceptors and transducers for feature structures, demonstrate them on linguistic problems, and lay down a foundation for semantics-based MT.