Show simple item record

Files in this item

Thumbnail
Name:
2009a.pdf
Size:
142.9Kb
Format:
PDF
View/Open

Weighted parsing of trees

Item metadata

dc.contributor.authorNederhof, Mark Jan
dc.date.accessioned2011-01-06T12:14:03Z
dc.date.available2011-01-06T12:14:03Z
dc.date.issued2009
dc.identifier.citationNederhof , 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.citationconferenceen
dc.identifier.otherPURE: 5095213
dc.identifier.otherPURE UUID: f236f284-cbb2-45fb-ae0f-afaa52639ff1
dc.identifier.otherORCID: /0000-0002-1845-6829/work/46002702
dc.identifier.otherScopus: 84859959907
dc.identifier.urihttps://hdl.handle.net/10023/1657
dc.description.abstractWe 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.extent12
dc.language.isoeng
dc.relation.ispartofen
dc.rightsThis 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.subjectQA75 Electronic computers. Computer scienceen
dc.subject.lccQA75en
dc.titleWeighted parsing of treesen
dc.typeConference paperen
dc.description.versionPostprinten
dc.contributor.institutionUniversity of St Andrews. School of Computer Scienceen
dc.description.statusPeer revieweden


This item appears in the following Collection(s)

Show simple item record

Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.