Results 31 to 40 of about 21,874 (220)
Lexical Functional Grammar as a Construction Grammar
Lexical Functional Grammar (LFG) is a lexicalist, constraint-based grammatical theory that shares a lot of the basic assumptions of Construction Grammar (CxG), such as a commitment to surface-oriented descriptions (no transformations), and the ...
Jamie Y. Findlay
doaj +1 more source
On the Complexity of CCG Parsing [PDF]
We study the parsing complexity of Combinatory Categorial Grammar (CCG) in the formalism of Vijay-Shanker and Weir (1994). As our main result, we prove that any parsing algorithm for this formalism will take in the worst case exponential time when the ...
Marco Kuhlmann +2 more
doaj +1 more source
SOBRE LA SINTAXIS DE LAS ORACIONES DE RELATIVO
En este trabajo examinaremos análisis existentes de las oraciones de relativo (principalmente restrictivas), y propondremos un análisis para las relativas españolas desde la perspectiva de una gramática de adjunción (TAG) lexicalizada.
Diego Gabriel Krivochen
doaj +1 more source
Bimorphisms and synchronous grammars
We tend to think of the study of language as proceeding by characterizing the strings and structures of a language, and we think of natural language processing as using those structures to build systems of utility in manipulating the language.
Stuart M. Shieber
doaj +1 more source
Multiple Context-Free Tree Grammars: Lexicalization and Characterization [PDF]
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 transformed into an equivalent one ...
Engelfriet, Joost +2 more
core +3 more sources
Modeling Brain Representations of Words' Concreteness in Context Using GPT‐2 and Human Ratings
Abstract The meaning of most words in language depends on their context. Understanding how the human brain extracts contextualized meaning, and identifying where in the brain this takes place, remain important scientific challenges. But technological and computational advances in neuroscience and artificial intelligence now provide unprecedented ...
Andrea Bruera +5 more
wiley +1 more source
Nominal ellipsis reveals concord in Moksha Mordvin
Abstract On the basis of original data from Moksha Mordvin (Finno‐Ugric), I argue that some languages have nominal concord even though modifiers of the noun generally do not show inflection. Evidence for the presence of concord comes from nominal ellipsis, under which inflection is phonologically realized and restricted in the same way as regular ...
Mariia Privizentseva
wiley +1 more source
LR parsing is a popular parsing strategy for variants of Context-Free Grammar (CFG). It has also been used for mildly context-sensitive formalisms, such as Tree-Adjoining Grammar.
Laura Kallmeyer, Wolfgang Maier
doaj +1 more source
Lexicalized non-local MCTAG with dominance links is NP-complete [PDF]
An NP-hardness proof for non-local Multicomponent Tree Adjoining Grammar (MCTAG) by Rambow and Satta (1st International Workshop on Tree Adjoining Grammers 1992), based on Dahlhaus and Warmuth (in J Comput Syst Sci 33:456–472, 1986), is extended to some ...
Champollion, Lucas
core +2 more sources
IMPROVING INTRUSION DETECTION USING TREE ADJOINING GRAMMAR GUIDED GENETIC PROGRAMMING
Nowadays, the problem of network security has become urgent and affect the performance of modern computer networks greatly. Detection and prevention of network attacks have been the main topic of many researchers in the World.
Vũ Văn Cảnh +2 more
doaj +1 more source

