Results 21 to 30 of about 22,181 (225)
Classifying Conserved RNA Secondary Structures With Pseudoknots by Vector-Edit Distance
IEEE 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
Synchronous tree-adjoining grammars [PDF]
Proceedings of the 13th conference on Computational linguistics -, 1990 The unique properties of tree-adjoining grammars (TAG) present a challenge for the application of TAGs beyond the limited confines of syntax, for instance, to the task of semantic interpretation or automatic translation of natural language. We present a variant of TAGs, called synchronous TAGs, which characterize correspondences between languages.
Stuart M. Shieber, Yves Schabes
openaire +1 more source
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
Tree Parsing with Synchronous Tree-Adjoining Grammars [PDF]
, 2011 Restricting the input or the output of a grammar-induced translation to a given set of trees plays an important role in statistical machine translation. The problem for practical systems is to find a compact (and in particular, finite) representation of said restriction.
Matthias Büchse +2 more
openalex +2 more sources
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
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
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
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 +1 more source