Parsing theory. Vol. 1: languages and parsing
Parsing theory. Vol. 1: languages and parsing
A geometric hierarchy beyond context-free languages
Theoretical Computer Science
The equivalence of four extensions of context-free grammars
Mathematical Systems Theory
Handbook of formal languages, vol. 3
Handbook of formal languages, vol. 3
Speech and Language Processing: An Introduction to Natural Language Processing, Computational Linguistics, and Speech Recognition
Parsing some constrained grammar formalisms
Computational Linguistics
The use of shared forests in tree adjoining grammar parsing
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
Three generative, lexicalised models for statistical parsing
ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
Conditions on consistency of probabilistic Tree Adjoining Grammars
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
Probabilistic tree-adjoining grammar as a framework for statistical natural language processing
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 2
Stochastic lexicalized tree-adjoining grammars
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 2
A General Technique to Train Language Models on Language Models
Computational Linguistics
Closure properties of linear context-free tree languages with an application to optimality theory
Theoretical Computer Science - Algebraic methods in language processing
Compilers: Principles, Techniques, and Tools (2nd Edition)
Compilers: Principles, Techniques, and Tools (2nd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Journal of Computer and System Sciences
Capturing practical natural language transformations
Machine Translation
PReMo: an analyzer for probabilistic recursive models
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
A tree transducer model for synchronous tree-adjoining grammars
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Intersection for weighted formalisms
FSMNLP '11 Proceedings of the 9th International Workshop on Finite State Methods and Natural Language Processing
Tree parsing with synchronous tree-adjoining grammars
IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
| Hi-index | 0.00 |
We show how parsing of trees can be formalized in terms of the intersection of two tree languages. The focus is on weighted regular tree grammars and weighted tree adjoining grammars. Potential applications are discussed, such as parameter estimation across formalisms.