English
Related papers

Related papers: Extended Dependency Structures and their Formal In…

200 papers

We describe a basic correspondence between linear algebraic structures within vector embeddings in artificial neural networks and conditional independence constraints on the probability distributions modeled by these networks. Our framework…

Machine Learning · Computer Science 2024-07-15 Matthew Trager , Alessandro Achille , Pramuditha Perera , Luca Zancato , Stefano Soatto

The complex organization of syntax in hierarchical structures is one of the core design features of human language. Duality of patterning refers for instance to the organization of the meaningful elements in a language at two distinct…

Physics and Society · Physics 2016-02-12 Vittorio Loreto , Pietro Gravino , Vito D. P. Servedio , Francesca Tria

The non-autoregressive models have boosted the efficiency of neural machine translation through parallelized decoding at the cost of effectiveness when comparing with the autoregressive counterparts. In this paper, we claim that the…

Computation and Language · Computer Science 2021-01-25 Ye Liu , Yao Wan , Jian-Guo Zhang , Wenting Zhao , Philip S. Yu

Modal dependence logics are modal logics defined on the basis of team semantics and have the downward closure property. In this paper, we introduce sound and complete deduction systems for the major modal dependence logics, especially those…

Logic · Mathematics 2018-12-19 Fan Yang

A longstanding question in cognitive science concerns the learning mechanisms underlying compositionality in human cognition. Humans can infer the structured relationships (e.g., grammatical rules) implicit in their sensory observations…

Machine Learning · Computer Science 2021-05-20 Jacob Russin , Roland Fernandez , Hamid Palangi , Eric Rosen , Nebojsa Jojic , Paul Smolensky , Jianfeng Gao

Syntactic discontinuity is a grammatical phenomenon in which a constituent is split into more than one part because of the insertion of an element which is not part of the constituent. This is observed in many languages across the world…

Computation and Language · Computer Science 2025-06-06 Ratna Kandala , Prakash Mondal

Two important aspects of semantic parsing for question answering are the breadth of the knowledge source and the depth of logical compositionality. While existing work trades off one aspect for another, this paper simultaneously makes…

Computation and Language · Computer Science 2015-08-04 Panupong Pasupat , Percy Liang

Large language models (LLMs) take sequences of subwords as input, requiring them to effective compose subword representations into meaningful word-level representations. In this paper, we present a comprehensive set of experiments to probe…

Computation and Language · Computer Science 2025-08-26 Qiwei Peng , Yekun Chai , Anders Søgaard

Session-types specify communication protocols for communicating processes, and session-typed languages are often specified using substructural operational semantics given by multiset rewriting systems. We give an observed communication…

Programming Languages · Computer Science 2020-09-01 Ryan Kavanagh

Semantic parsing, i.e., the automatic derivation of meaning representation such as an instantiated predicate-argument structure for a sentence, plays a critical role in deep processing of natural language. Unlike all other top systems of…

Computation and Language · Computer Science 2014-01-25 Hai Zhao , Xiaotian Zhang , Chunyu Kit

This is an account of the characterization of database dependencies with Formal Concept Analysis.

Databases · Computer Science 2024-03-22 Jaume Baixeries

There is a growing need for abstractions in logic specification languages such as FO(.) and ASP. One technique to achieve these abstractions are templates (sometimes called macros). While the semantics of templates are virtually always…

Logic in Computer Science · Computer Science 2020-02-19 Ingmar Dasseville , Matthias van der Hallen , Gerda Janssens , Marc Denecker

The purpose of this contribution is to initiate the study of integrable deformations for different superstring theory formalisms that manifest the property of (classical) integrability. In this paper we choose the hybrid formalism of the…

High Energy Physics - Theory · Physics 2016-10-28 David M. Schmidtt

The present work pursues the aim to draw attention to unique possibilities of the skew-symmetric differential forms. At present the theory of skew-symmetric exterior differential forms that possess invariant properties has been developed.…

General Mathematics · Mathematics 2007-05-23 L. I. Petrova

Static single assignment form, or SSA, has been the dominant compiler intermediate representation for decades. In this paper, we give a type theory for a variant of SSA, including its equational theory, which are strong enough to validate a…

Programming Languages · Computer Science 2024-12-13 Jad Elkhaleq Ghalayini , Neel Krishnaswami

Semantically non-compositional phrases constitute an intriguing research topic in Natural Language Processing. Semantic non-compositionality --the situation when the meaning of a phrase cannot be derived from the meaning of its components,…

Computation and Language · Computer Science 2019-08-16 Meghdad Farahmand

We have proposed going beyond traditional ontologies to use rich semantics implemented in programming languages for modeling. In this paper, we discuss the application of executable semantic models to two examples, first a structured…

Artificial Intelligence · Computer Science 2020-01-01 Robert B. Allen

Normative non-functional requirements specify constraints that a system must observe in order to avoid violations of social, legal, ethical, empathetic, and cultural norms. As these requirements are typically defined by non-technical system…

This paper describes a computational framework for a grammar architecture in which different linguistic domains such as morphology, syntax, and semantics are treated not as separate components but compositional domains. Word and phrase…

cmp-lg · Computer Science 2008-02-03 Cem Bozsahin , Elvan Gocmen

Infamously, the finite and unrestricted implication problems for the classes of i) functional and inclusion dependencies together, and ii) embedded multivalued dependencies alone are each undecidable. Famously, the restriction of i) to…

Databases · Computer Science 2021-01-13 Miika Hannula , Juha Kontinen , Sebastian Link
‹ Prev 1 8 9 10 Next ›