Results 21 to 30 of about 29,707 (219)
An efficient parsing algorithm for Tree Adjoining Grammars [PDF]
Proceedings of the 28th annual meeting on Association for Computational Linguistics -, 1990 In the literature, Tree Adjoining Grammars (TAGs) are propagated to be adequate for natural language description --- analysis as well as generation. In this paper we concentrate on the direction of analysis. Especially important for an implementation of that task is how efficiently this can be done, i.e., how readily the word problem can be solved for ...
Karin Harbusch
openalex +4 more sources
Tree-Adjoining Grammars Are Not Closed Under Strong Lexicalization [PDF]
Computational Linguistics, 2011 A lexicalized tree-adjoining grammar is a tree-adjoining grammar where each elementary tree contains some overt lexical item. Such grammars are being used to give lexical accounts of syntactic phenomena, where an elementary tree defines the domain of locality of the syntactic and semantic dependencies of its lexical items.
Marco Kuhlmann, Giorgio Satta
openalex +6 more sources
Tree Adjoining Grammars mit Unifikation [PDF]
, 1988 Auf dem Gebiet der Analyse naturlicher Sprache hat sich die Unifikation als ein Forschungsschwerpunkt herauskristallisiert.
Karin Harbusch
openalex +3 more sources
Sentence planning as description using tree adjoining grammar [PDF]
Proceedings of the 35th annual meeting on Association for Computational Linguistics -, 1997 We present an algorithm for simultaneously constructing both the syntax and semantics of a sentence using a Lexicalized Tree Adjoining Grammar (LTAG). This approach captures naturally and elegantly the interaction between pragmatic and syntactic constraints on descriptions in a sentence, and the inferential interactions between multiple descriptions in
Matthew Stone, Christine Doran
openalex +4 more sources
Portuguese analysis with Tree Adjoining Grammars [PDF]
Proceedings of the 15th conference on Computational linguistics -, 1994 This article approaches syntactical analysis of Portuguese language based upon a formalism called Tree Adjoining Grammars (TAGs) [JOSHI 85]. It briefly describes the formalism and its main operations, outlines a Portuguese subset for analysis, and presents a parser developed according TAGs concepts in order to validate an application of the formalism ...
Karin Kipper, Vera Lúcia Strube de Lima
openalex +3 more sources
Feature structures based Tree Adjoining Grammars [PDF]
Proceedings of the 12th conference on Computational linguistics -, 1988 We have embedded Tree Adjoining Grammars (TAG) in a feature structure based unification system. The resulting system, Feature Structure based Tree Adjoining Grammars (FTAG), captures the principle of factoring dependencies and recursion, fundamental to TAG's. We show that FTAG has an enhanced descriptive capacity compared to TAG formalism.
K. Vijay‐Shanker, Aravind K. Joshi
openalex +4 more sources
Prefix probabilities from stochastic Tree Adjoining Grammars [PDF]
Proceedings of the 36th annual meeting on Association for Computational Linguistics -, 1998 7 pages, 2 Postscript figures, uses colacl.sty, graphicx.sty, psfrag ...
Mark-Jan Nederhof +2 more
openalex +5 more sources
Representing Unish Grammars Based on Tree Adjoining Grammar Formalisms
Journal of Universal Language, 2003 To make any sort of optimality argument, or rational engineering decision, one needs a fairly precise understanding of the problem to be tackled.
Purev Jaimai, Hyun Seok Park
openalex +4 more sources
An Initial Study of Tree-Adjoining Grammar Formalism for Parsing Manipuri Language
International Journal of Computer Applications Technology and Research, 2021 We present an initial study into the representation of tree-adjoining grammar formalism for parsing Manipuri language. Being a low resource and computationally less researched language, it is difficult to achieve a natural language parser for Manipuri ...
Yumnam Nirmal, U. Sharma
semanticscholar +1 more source
Computational Intelligence, 2012 Tree‐adjoining grammars (TAG) have been proposed as a formalism for generation based on the intuition that the extended domain of syntactic locality that TAGs provide should aid in localizing semantic dependencies as well, in turn serving as an aid to generation from semantic representations.
Shieber, Stuart, Schabes, Yves
openaire +4 more sources