Reflexives and Reciprocals in Synchronous Tree Adjoining Grammar
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Prefix Lexicalization of Synchronous CFGs using Synchronous TAG
We show that an epsilon-free, chain-free synchronous context-free grammar (SCFG) can be converted into a weakly equivalent synchronous tree-adjoining grammar (STAG) which is prefix lexicalized. This transformation at mos…
Machine TranslationTAGMultiple Context-Free Tree Grammars: Lexicalization and Characterization
Multiple (simple) context-free tree grammars are investigated, where "simple" means "linear and nondeleting". Every multiple context-free tree grammar that is finitely ambiguous can be lexicalized; i.e., it can be transf…
A Lie-algebraic perspective on Tree-Adjoining Grammars
We provide a novel mathematical implementation of tree-adjoining grammars using two combinatorial definitions of graphs. With this lens, we demonstrate that the adjoining operation defines a pre-Lie operation and subsequ…
The Logic for a Mildly Context-Sensitive Fragment of the Lambek-Grishin Calculus
While context-free grammars are characterized by a simple proof-theoretic grammatical formalism namely categorial grammar and its logic the Lambek calculus, no such characterizations were known for tree-adjoining grammar…
German and English Treebanks and Lexica for Tree-Adjoining Grammars
We present a treebank and lexicon for German and English, which have been developed for PLTAG parsing. PLTAG is a psycholinguistically motivated, incremental version of tree-adjoining grammar (TAG). The resources are how…
Language ModellingTAG