Show simple item record

Files in this item

Thumbnail

Item metadata

dc.contributor.authorB¨uchse, Matthias
dc.contributor.authorNederhof, Mark Jan
dc.contributor.authorVogler, Heiko
dc.date.accessioned2012-03-15T15:31:09Z
dc.date.available2012-03-15T15:31:09Z
dc.date.issued2011-10-05
dc.identifier.citationB¨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 .en
dc.identifier.citationconferenceen
dc.identifier.isbn978-1932432-04-6
dc.identifier.otherPURE: 17732326
dc.identifier.otherPURE UUID: f56669b3-d901-401c-9229-6a16f371dc10
dc.identifier.otherORCID: /0000-0002-1845-6829/work/46002713
dc.identifier.urihttp://hdl.handle.net/10023/2438
dc.description.abstractRestricting 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.
dc.format.extent12
dc.language.isoeng
dc.publisherAssociation for Computational Linguistics
dc.relation.ispartofProceedings of the 12th International Conference on Parsing Technologies (IWPT 2011)en
dc.rights(c) 2011 Association for Computational Linguistics, available on ACL anthology website http://aclweb.org/anthology/W/W11/#2900en
dc.subjectParsing algorithmsen
dc.subjectNatural language processingen
dc.subjectQA75 Electronic computers. Computer scienceen
dc.subject.lccQA75en
dc.titleTree parsing with synchronous tree-adjoining grammarsen
dc.typeConference itemen
dc.description.versionPostprinten
dc.contributor.institutionUniversity of St Andrews.School of Computer Scienceen
dc.identifier.urlhttp://aclweb.org/anthology/W/W11/W11-2903.pdfen


This item appears in the following Collection(s)

Show simple item record