Weighted parsing of trees

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	5095213
dc.identifier	f236f284-cbb2-45fb-ae0f-afaa52639ff1
dc.identifier	84859959907
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	ORCID: /0000-0002-1845-6829/work/46002702
dc.identifier.uri	https://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.format.extent	146390
dc.language.iso	eng
dc.relation.ispartof		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.contributor.institution	University of St Andrews. School of Computer Science	en
dc.description.status	Peer reviewed	en