Weighted parsing of trees

Research output: Contribution to conferencePaperpeer-review

3 Downloads (Pure)

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.
Original languageEnglish
Pages13-24
Number of pages12
Publication statusPublished - 2009
Event11th International Conference on Parsing Technologies - Paris, France
Duration: 7 Oct 20099 Oct 2009

Conference

Conference11th International Conference on Parsing Technologies
Country/TerritoryFrance
CityParis
Period7/10/099/10/09

Fingerprint

Dive into the research topics of 'Weighted parsing of trees'. Together they form a unique fingerprint.

Cite this