Research@StAndrews
 
The University of St Andrews

Research@StAndrews:FullText >
University of St Andrews Research >
University of St Andrews Research >
University of St Andrews Research >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10023/1657
This item has been viewed 4 times in the last year. View Statistics

Files in This Item:

File Description SizeFormat
2009a.pdf142.96 kBAdobe PDFView/Open
Title: Weighted parsing of trees
Authors: Nederhof, Mark Jan
Keywords: QA75 Electronic computers. Computer science
Issue Date: 2009
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
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.
Version: Postprint
Status: Peer reviewed
URI: http://hdl.handle.net/10023/1657
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/)
Appears in Collections:University of St Andrews Research
Computer Science Research



This item is protected by original copyright

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

DSpace Software Copyright © 2002-2012  Duraspace - Feedback
For help contact: Digital-Repository@st-andrews.ac.uk | Copyright for this page belongs to St Andrews University Library | Terms and Conditions (Cookies)