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:
This item has been viewed 1 times in the last year. View Statistics

Files in This Item:

File Description SizeFormat
W11_2903.pdf351.6 kBAdobe PDFView/Open
Title: Tree parsing with synchronous tree-adjoining grammars
Authors: B¨uchse, Matthias
Nederhof, Mark Jan
Vogler, Heiko
Keywords: Parsing algorithms
Natural language processing
QA75 Electronic computers. Computer science
Issue Date: 5-Oct-2011
Citation: B¨uchse , M , Nederhof , M J & Vogler , H 2011 , ' Tree parsing with synchronous tree-adjoining grammars ' . in Proceedings of the 12th International Conference on Parsing Technologies (IWPT 2011) . Association for Computational Linguistics , Stroudsburg, PA , pp. 14-25 , 12th International Conference on Parsing Technologies , Dublin , Ireland , 5-7 October .
Abstract: Restricting the input or the output of a grammar-induced translation to a given set of trees plays an important role in statistical machine translation. The problem for practical systems is to find a compact (and in particular, finite) representation of said restriction. For the class of synchronous tree adjoining grammars, partial solutions to this problem have been described, some being restricted to the unweighted case, some to the monolingual case. We introduce a formulation of this class of grammars which is effectively closed under input and output restrictions to regular tree languages, i.e., the restricted translations can again be represented by grammars. Moreover, we present an algorithm that constructs these grammars for input and output restriction, which is inspired by Earley’s algorithm.
Version: Postprint
ISBN: 978-1932432-04-6
Type: Conference item
Rights: (c) 2011 Association for Computational Linguistics, available on ACL anthology website
Publisher: Association for Computational Linguistics
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: | Copyright for this page belongs to St Andrews University Library | Terms and Conditions (Cookies)