Files in this item
Weighted parsing of trees
Item metadata
dc.contributor.author | Nederhof, Mark Jan | |
dc.date.accessioned | 2011-01-06T12:14:03Z | |
dc.date.available | 2011-01-06T12:14:03Z | |
dc.date.issued | 2009 | |
dc.identifier.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 . | en |
dc.identifier.citation | conference | en |
dc.identifier.other | PURE: 5095213 | |
dc.identifier.other | PURE UUID: f236f284-cbb2-45fb-ae0f-afaa52639ff1 | |
dc.identifier.other | ORCID: /0000-0002-1845-6829/work/46002702 | |
dc.identifier.other | Scopus: 84859959907 | |
dc.identifier.uri | http://hdl.handle.net/10023/1657 | |
dc.description.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. | |
dc.format.extent | 12 | |
dc.language.iso | eng | |
dc.relation.ispartof | en | |
dc.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/) | en |
dc.subject | QA75 Electronic computers. Computer science | en |
dc.subject.lcc | QA75 | en |
dc.title | Weighted parsing of trees | en |
dc.type | Conference paper | en |
dc.description.version | Postprint | en |
dc.contributor.institution | University of St Andrews. School of Computer Science | en |
dc.description.status | Peer reviewed | en |
This item appears in the following Collection(s)
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.