Results 81 to 90 of about 21,874 (220)
Incremental, Predictive Parsing with Psycholinguistically Motivated Tree-Adjoining Grammar
Computational Linguistics, 2021 Vera Demberg +2 more
doaj +1 more source
Separating Dependency from Constituency in a Tree Rewriting System
, 1997 In this paper we present a new tree-rewriting formalism called Link-Sharing Tree Adjoining Grammar (LSTAG) which is a variant of synchronous TAGs. Using LSTAG we define an approach towards coordination where linguistic dependency is distinguished from ...
Sarkar, Anoop
core +3 more sources
XMG : eXtending MetaGrammars to MCTAG [PDF]
, 2007 In this paper, we introduce an extension of the XMG system (eXtensibleMeta-Grammar) in order to allow for the description of Multi-Component Tree Adjoining Grammars.
Kallmeyer, Laura +3 more
core +1 more source
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
openaire +2 more sources
Evaluation of LTAG parsing with supertag compaction [PDF]
, 2002 One of the biggest concerns that has been raised over the feasibility of using large-scale LTAGs in NLP is the amount of redundancy within a grammar¿s elementary tree set.
Carroll, John +2 more
core +2 more sources
A Processing Model for Free Word Order Languages [PDF]
, 1995 Like many verb-final languages, Germn displays considerable word-order freedom: there is no syntactic constraint on the ordering of the nominal arguments of a verb, as long as the verb remains in final position. This effect is referred to as ``scrambling'
Joshi, Aravind K., Rambow, Owen
core +3 more sources
The FCG Editor: An innovative environment for engineering computational construction grammars. [PDF]
PLoS One, 2022 van Trijp R, Beuls K, Van Eecke P.
europepmc +1 more source
Licensing german negative polarity items in LTAG [PDF]
, 2008 Our paper aims at capturing the distribution of negative polarity items (NPIs) within lexicalized Tree Adjoining Grammar (LTAG). The condition under which an NPI can occur in a sentence is for it to be in the scope of a negation with no quantifiers ...
Kallmeyer, Laura, Lichte, Timm
core
An Empirical Evaluation of Probabilistic Lexicalized Tree Insertion Grammars
, 1998 We present an empirical study of the applicability of Probabilistic Lexicalized Tree Insertion Grammars (PLTIG), a lexicalized counterpart to Probabilistic Context-Free Grammars (PCFG), to problems in stochastic natural-language processing. Comparing the
Hwa, Rebecca
core +2 more sources