Unidirectional Derivation Semantics for Synchronous Tree-Adjoining Grammars
نویسندگان
چکیده
Synchronous tree-adjoining grammars have been given two types of semantics: one based on bimorphisms and one based on synchronous derivations, in both of which the input and output trees are constructed synchronously. We introduce a third type of semantics that is based on unidirectional derivations. It derives output trees based on a given input tree and thus marks a first step towards conditional probability distributions. We prove that the unidirectional semantics coincides with the bimorphism-based semantics with the help of a strong correspondence to linear and nondeleting extended top-down tree transducers with explicit substitution. In addition, we show that stateful synchronous tree-adjoining grammars admit a normal form in which only adjunction is used. This contrasts the situation encountered in the stateless case.
منابع مشابه
Pushdown Machines for Weighted Context-Free Tree Translation
Synchronous context-free grammars (or: syntax-directed translation schemata) were introduced in the context of compiler construction in the late 1960s [12]. They define string transductions by the simultaneous derivation of an input and an output word. In contrast, modern systems for machine translation of natural language employ weighted tree transformations to account for the grammatical stru...
متن کاملFeature Unification in TAG Derivation Trees
The derivation trees of a tree adjoining grammar provide a first insight into the sentence semantics, and are thus prime targets for generation systems. We define a formalism, feature-based regular tree grammars, and a translation from feature based tree adjoining grammars into this new formalism. The translation preserves the derivation structures of the original grammar, and accounts for feat...
متن کاملTree description grammars and underspecified representations
In this thesis, a new grammar formalism called (local) Tree Description Grammar (TDG) is presented that generates tree descriptions. This grammar formalism brings together some of the central ideas in the context of Tree Adjoining Grammars (TAG) on the one hand, and approaches to underspecified semantics for scope ambiguities on the other hand. First a general definition of TDGs is presented, a...
متن کاملSynchronous and Multicomponent Tree-Adjoining Grammars: Complexity, Algorithms and Linguistic Applications
This thesis addresses the design of appropriate formalisms and algorithms to be used for natural language processing. This entails a delicate balance between the ability of a formalism to capture the linguistic generalizations required by natural language processing applications and the ability of a natural language processing application based on the formalism to process the formalism efficien...
متن کاملMapping Scrambled Korean Sentences into English Using Synchronous TAGs
plg /9 50 50 29 13 M ay 1 99 5 Mapping Scrambled Korean Sentences into English Using Synchronous TAGs Hyun S. Park Computer Laboratory University of Cambridge Cambridge, CB2 3QG, U.K. [email protected] Abstract Synchronous Tree Adjoining Grammars can be used for Machine Translation. However, translating a free order language such as Korean to English is complicated. I present a mechanism t...
متن کامل