Tree parsing with synchronous tree-adjoining grammars
MetadataShow full item record
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.
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/10/10 .conference
Proceedings of the 12th International Conference on Parsing Technologies (IWPT 2011)
(c) 2011 Association for Computational Linguistics, available on ACL anthology website http://aclweb.org/anthology/W/W11/#2900
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.