Results 1 to 10 of about 793,959 (306)
Research on Language and Computation, 2009 Interaction Grammar (IG) is a grammatical formalism based on the notion of polarity. Polarities express the resource sensitivity of natural languages by modelling the distinction between saturated and unsaturated syntactic structures. Syntactic composition is represented as a chemical reaction guided by the saturation of polarities.
Guillaume, Bruno, Perrier, Guy
openaire +8 more sources
Proceedings of the 2nd Workshop on Text Meaning and Interpretation - TextMean '04, 2004 Arguably, grammars which associate natural language expressions not only with a syntactic but also with a semantic representation, should do so in a way that capture paraphrasing relations between sentences whose core semantics are equivalent. Yet existing semantic grammars fail to do so.
Gardent, Claire +2 more
openaire +6 more sources
Learning of Structurally Unambiguous Probabilistic Grammars [PDF]
Logical Methods in Computer Science, Volume 19, Issue 1 (February
8, 2023) lmcs:9223, 2022 The problem of identifying a probabilistic context free grammar has two aspects: the first is determining the grammar's topology (the rules of the grammar) and the second is estimating probabilistic weights for each rule. Given the hardness results for learning context-free grammars in general, and probabilistic grammars in particular, most of the ...
arxiv +1 more source
Universal Grammar is a Universal Grammar [PDF]
SSRN Electronic Journal, 2014 Language is the most distinctive feature of humans, but there is no consensus on what is characteristic of language. From the point of view of computing, we argue that ‘the human brain circuitry that implements language is Turing complete’. This thesis makes evolutionary sense and natural languages are expressive enough, but two issues against it ...
openaire +2 more sources
Frontiers in Psychology, 2011 Jakobson (1959) reports: "The Russian painter Repin was baffled as to why Sin had been depicted as a woman by German artists: he did not realize that 'sin' is feminine in German (die Sünde), but masculine in Russian (rpex)." Does the grammatical gender of nouns in an artist's native language indeed predict the gender of personifications in art? In this
Lera Boroditsky, Edward Segel
openaire +4 more sources
Expressive Power of Hypergraph Lambek Grammars [PDF]
arXiv, 2023 Hypergraph Lambek grammars (HL-grammars) is a novel logical approach to generating graph languages based on the hypergraph Lambek calculus. In this paper, we establish a precise relation between HL-grammars and hypergraph grammars based on the double pushout (DPO) approach: we prove that HL-grammars generate the same class of languages as DPO grammars ...
arxiv
, 2021 Japhug is a vulnerable Gyalrongic language, which belongs to the Trans-Himalayan (Sino-Tibetan) family. It is spoken by several thousand speakers in Mbarkham county, Rngaba district, Sichuan province, China. This grammar is the result of nearly 20 years of fieldwork on one variety of Japhug, based on a corpus of narratives and conversations, a large ...
openaire +3 more sources
Proceedings of the 18th conference on Computational linguistics -, 2000 Interaction Grammars (IG) are a new linguistic formalism which is based on descriptions of under-specified trees in the framework of intuitionistic linear logic (ILL). Syntactic composition, which is expressed by deduction in linear logic, is controlled by a system of polarized features.
openaire +7 more sources
VLGrammar: Grounded Grammar Induction of Vision and Language [PDF]
arXiv, 2021 Cognitive grammar suggests that the acquisition of language grammar is grounded within visual structures. While grammar is an essential representation of natural language, it also exists ubiquitously in vision to represent the hierarchical part-whole structure. In this work, we study grounded grammar induction of vision and language in a joint learning
arxiv
Grammars over the Lambek Calculus with Permutation: Recognizing Power and Connection to Branching Vector Addition Systems with States [PDF]
, 2022 In (Van Benthem, 1991) it is proved that all permutation closures of context-free languages can be generated by grammars over the Lambek calculus with the permutation rule (LP-grammars); however, to our best knowledge, it is not established whether the converse holds or not.
arxiv +1 more source