Skip to main content
Conference ProceedingsOPEN ACCESS

Weighted parsing of trees

Proceedings of the 11th International Conference on Parsing Technologies, IWPT 2009 (2009) 13-24
DOI: 10.3115/1697236.1697239
7Citations
Citations of this article
67Readers
Mendeley users who have this article in their library.

Abstract

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.

Cite

CITATION STYLE

APA

Nederhof, M. J. (2009). Weighted parsing of trees. In Proceedings of the 11th International Conference on Parsing Technologies, IWPT 2009 (pp. 13–24). Association for Computational Linguistics (ACL). https://doi.org/10.3115/1697236.1697239

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free