Results 201 to 210 of about 29,707 (219)

The Relevance of Tree Adjoining Grammar to Generation [PDF]

open access: possible, 1987
Grammatical formalisms can be viewed as neutral with respect to comprehension or generation, or they can be investigated from the point of view of their suitability for comprehension or generation. Tree Adjoining Grammars (TAG) is a formalism that factors recursion and dependencies in a special way, leading to a kind of locality and the possibility of ...
openaire   +1 more source

WORD ORDER VARIATION AND TREE‐ADJOINING GRAMMAR

Computational Intelligence, 1994
In many head‐final languages such as German, Hindi, Japanese, and Korean, but also in some other languages such as Russian, arguments of a verb can occur in any order. Furthermore, arguments can occur outside of their clause (“long‐distance scrambling”).
Young-Suk Lee, Owen Rambow
openaire   +2 more sources

Tree Adjoining Grammar

Automating Data-Driven Modelling of Dynamical Systems, 2022
Dhruv Khandelwal
semanticscholar   +1 more source

Exploring a genotype based formalisation for tree adjoining grammar derivations

International journal of information technology, 2021
V. Menon, Soman K P
semanticscholar   +1 more source

Large Scale Semantic Construction for Tree Adjoining Grammars

2005
Although Tree Adjoining Grammars (TAG) are widely used for syntactic processing, there is to date no large scale TAG available which also supports semantic construction. In this paper, we present a highly factorised way of implementing a syntax/semantic interface in TAG.
Gardent, Claire, Parmentier, Yannick
openaire   +3 more sources

Tree Adjoining Grammar Based Parser for a Hindi Text-to-Scene Conversion System

2018 3rd International Conference for Convergence in Technology (I2CT), 2018
Priyanka Jain   +5 more
semanticscholar   +1 more source

Two Equivalent Regularizations for Tree Adjoining Grammars

2009
We present and compare two methods of how to make derivation in a Tree Adjoining Grammar a regular process (in the Chomsky hierarchy sense) without loss of expressive power. One regularization method is based on an algebraic operation called Lifting, while the other exploits an additional spatial dimension by transforming the components of a TAG into ...
openaire   +2 more sources

A synchronised tree adjoining Grammar for English to Tamil Machine Translation

International Conference on Advances in Computing, Communications and Informatics, 2015
V. Menon, R. S., Soman K
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy