Weighted parsing of trees
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.
Citation
Nederhof , M J 2009 , ' Weighted parsing of trees ' , Paper presented at 11th International Conference on Parsing Technologies , Paris , France , 7/10/09 - 9/10/09 pp. 13-24 . conference
Publication
Status
Peer reviewed
Type
Conference paper
Rights
This is the author version of the conference contribution. A definitive version is available from http://www.aclweb.org/anthology/sigparse#2009_0 licensed under a Creative Commons licence for use in teaching and research (http://creativecommons.org/licenses/by-nc-sa/3.0/)
Collections
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.