Results 41 to 50 of about 21,709 (216)
Lexical Functional Grammar as a Construction Grammar
Journal of Language Modelling, 2023 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]
Computational Linguistics, 2018 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
Borealis: An International Journal of Hispanic Linguistics, 2022 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
Journal of Language Modelling, 2014 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
Modeling Brain Representations of Words' Concreteness in Context Using GPT‐2 and Human Ratings
Cognitive Science, Volume 47, Issue 12, December 2023., 2023 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
Multiple Context-Free Tree Grammars: Lexicalization and Characterization [PDF]
, 2017 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
Nominal ellipsis reveals concord in Moksha Mordvin
Syntax, Volume 26, Issue 4, Page 355-403, December 2023., 2023 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
Modeling Structure‐Building in the Brain With CCG Parsing and Large Language Models
Cognitive Science, Volume 47, Issue 7, July 2023., 2023 Abstract To model behavioral and neural correlates of language comprehension in naturalistic environments, researchers have turned to broad‐coverage tools from natural‐language processing and machine learning. Where syntactic structure is explicitly modeled, prior work has relied predominantly on context‐free grammars (CFGs), yet such formalisms are ...
Miloš Stanojević +4 more
wiley +1 more source
Stochastic tree-adjoining grammars [PDF]
Proceedings of the workshop on Speech and Natural Language - HLT '91, 1992 The notion of stochastic lexicalized tree-adjoining grammar (SLTAG) is defined and basic algorithms for SLTAG are designed. The parameters of a SLTAG correspond to the probability of combining two structures each one associated with a word. The characteristics of SLTAG are unique and novel since it is lexically sensitive (as N-gram models or Hidden ...
openaire +2 more sources
Algorithms, 2016 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