Results 31 to 40 of about 29,707 (219)

Strong Equivalence of TAG and CCG

open access: yesTransactions of the Association for Computational Linguistics, 2021
Tree-adjoining grammar (TAG) and combinatory categorial grammar (CCG) are two well-established mildly context-sensitive grammar formalisms that are known to have the same expressive power on strings (i.e., generate the same class of ...
Lena Katharina Schiffer, Andreas Maletti
doaj   +1 more source

A Metagrammatical Approach to Periphrasis in Gwadloupéyen

open access: yesQuaderni di Linguistica e Studi Orientali, 2020
In this paper, I show that verbal and nominal functional elements of Gwadloupéyen can be described in the Tree-Adjoining Grammar as pertaining to morphological periphrasis. This challenges the claim that Creoles have fully analytical morphology.
Emmanuel Schang
doaj   +1 more source

Classifying Conserved RNA Secondary Structures With Pseudoknots by Vector-Edit Distance

open access: yesIEEE Access, 2021
Secondary structures have been proved to relate with the great functional diversity of RNA. There have been many studies to predict and compare the RNA secondary structures. However, fast and accurate comparison of RNA secondary structures with arbitrary
Liyu Huang   +3 more
doaj   +1 more source

Data-driven Modelling of Dynamical Systems Using Tree Adjoining Grammar and Genetic Programming [PDF]

open access: yesIEEE Congress on Evolutionary Computation, 2019
State-of-the-art methods for data-driven modelling of non-linear dynamical systems typically involve interactions with an expert user. In order to partially automate the process of modelling physical systems from data, many EA-based approaches have been ...
Dhruv Khandelwal, M. Schoukens, R. Tóth
semanticscholar   +1 more source

Lexical Functional Grammar as a Construction Grammar

open access: yesJournal 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]

open access: yesComputational 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

open access: yesBorealis: 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

open access: yesJournal 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

open access: yesCognitive 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

Nominal ellipsis reveals concord in Moksha Mordvin

open access: yesSyntax, 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

Home - About - Disclaimer - Privacy