Article Structure
Abstract
Synchronous Tree—Adjoining Grammar (STAG) is a promising formalism for syntax—aware machine translation and simultaneous computation of natural-language syntax and semantics.
Introduction
Tree-adjoining grammar is a widely used formalism in natural-language processing due to its mildly-context-sensitive expressivity, its ability to naturally capture natural-language argument substitution (via its substitution operation) and optional modification (via its adjunction operation), and the existence of efficient algorithms for processing it.
Synchronous Tree-Adjoining Grammar
A tree-adj oining grammar (TAG) consists of a set of elementary tree structures of arbitrary depth, which are combined by substitution, familiar from context-free grammars, or an operation of adjunction that is particular to the TAG formalism.
Topics
machine translation
- Synchronous Tree—Adjoining Grammar (STAG) is a promising formalism for syntax—aware machine translation and simultaneous computation of natural-language syntax and semantics.Page 1, “Abstract”
- Recently, the desire to incorporate syntax-awareness into machine translation systems has generated interest inPage 1, “Introduction”
- Without efficient algorithms for processing it, its potential for use in machine translation and TAG semantics systems is limited.Page 1, “Introduction”
- In order for STAG to be used in machine translation and other natural-language processing tasks it must be possible to process it efficiently.Page 8, “Synchronous Tree-Adjoining Grammar”
See all papers in Proc. ACL 2008 that mention machine translation.
See all papers in Proc. ACL that mention machine translation.
Back to top.
parsing algorithms
- Given a particular grammar, the polynomial degree of efficient STAG parsing algorithms depends directly on the rank of the grammar: the maximum number of correspondences that appear within a single elementary structure.Page 1, “Abstract”
- Given a particular grammar, the polynomial degree of efficient STAG parsing algorithms depends directly on the rank of the grammar: the maximum number of correspondences that appear within a single elementary structure.Page 1, “Introduction”
- This is a critical minimization because k is the feature of the grammar that appears in the exponent of the complexity of parsing algorithms for STAG.Page 2, “Introduction”
See all papers in Proc. ACL 2008 that mention parsing algorithms.
See all papers in Proc. ACL that mention parsing algorithms.
Back to top.
