Results 191 to 200 of about 21,709 (216)

The Relevance of Tree Adjoining Grammar to Generation [PDF]

, 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

Some of the next articles are maybe not open access.

Related searches:

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

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

Parallel parsing of Tree Adjoining Grammars on the Connection Machine

International Journal of Parallel Programming, 1992
Tree adjoining grammars (TAGs) were introduced by \textit{A. K. Joshi}, \textit{L. S. Levy}, \textit{M. Takahashi} (1975) mainly as a formalism for natural language specification. The expressive power of TAG formal languages proved to be situated strictly between context-free and context-sensitive languages.
Michael A. Palis, David S. L. Wei
openaire   +2 more sources

Extraction of organic chemistry grammar from unsupervised learning of chemical reactions

Science Advances, 2021
Philippe Schwaller, Benjamin Hoover, Jean-Louis Reymond   +2 more
exaly  

On the relation between multi-depth grammars and tree adjoining grammars

1999
Summary: Multi-depth grammars were introduced for describing some non-context free features of programming languages. They generate a hierarchy of languages, have intesting closure properties, are simpler than other grammar formalisms and have a very natural accepting device, called multi-pushdown automaton.
CHERUBINI, ALESSANDRA, SAN PIETRO, PIERLUIGI   +1 more
openaire   +2 more sources

Revisiting the grammar of Tau aggregation and pathology formation: how new insights from brain pathology are shaping how we study and target Tauopathies

Chemical Society Reviews, 2022
Galina Limorenko, Hilal A Lashuel
exaly  

Sequence grammar underlying the unfolding and phase separation of globular proteins

Molecular Cell, 2022
Kiersten M Ruff, Dezerae Cox, Rohit V Pappu   +2 more
exaly  

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

Institutional Analysis with the Institutional Grammar

Policy Studies Journal, 2022
Saba Siddiki, Tanya Heikkila, Christopher M Weible   +2 more
exaly