English
Related papers

Related papers: Extended Dependency Structures and their Formal In…

200 papers

It has been an open question as to whether the Modular Structural Operational Semantics framework can express the dynamic semantics of call/cc. This paper shows that it can, and furthermore, demonstrates that it can express the more general…

Programming Languages · Computer Science 2016-06-22 Neil Sculthorpe , Paolo Torrini , Peter D. Mosses

Language Models (LMs) have emerged as powerful sources of evidence for linguists seeking to develop theories of syntax. In this paper, we argue that causal interpretability methods, applied to LMs, can greatly enhance the value of such…

Computation and Language · Computer Science 2025-10-01 Sasha Boguraev , Christopher Potts , Kyle Mahowald

Syntactic language models (SLMs) enhance Transformers by incorporating syntactic biases through the modeling of linearized syntactic parse trees alongside surface sentences. This paper focuses on compositional SLMs that are based on…

Computation and Language · Computer Science 2025-07-01 Yida Zhao , Hao Xve , Xiang Hu , Kewei Tu

Constituent and dependency representation for syntactic structure share a lot of linguistic and computational characteristics, this paper thus makes the first attempt by introducing a new model that is capable of parsing constituent and…

Computation and Language · Computer Science 2019-09-27 Junru Zhou , Shuailiang Zhang , Hai Zhao

Dependency parsing is a fundamental task in natural language processing (NLP), aiming to identify syntactic dependencies and construct a syntactic tree for a given sentence. Traditional dependency parsing models typically construct…

Computation and Language · Computer Science 2025-02-25 Keunha Kim , Youngjoong Ko

Although self-attention networks (SANs) have advanced the state-of-the-art on various NLP tasks, one criticism of SANs is their ability of encoding positions of input words (Shaw et al., 2018). In this work, we propose to augment SANs with…

Computation and Language · Computer Science 2019-09-04 Xing Wang , Zhaopeng Tu , Longyue Wang , Shuming Shi

We compare the performance of a transition-based parser in regards to different annotation schemes. We pro-pose to convert some specific syntactic constructions observed in the universal dependency treebanks into a so-called more standard…

Computation and Language · Computer Science 2025-03-11 Guillaume Wisniewski , Ophélie Lacroix

We present an approach for assessing how multilingual large language models (LLMs) learn syntax in terms of multi-formalism syntactic structures. We aim to recover constituent and dependency structures by casting parsing as sequence…

Computation and Language · Computer Science 2023-09-21 Alberto Muñoz-Ortiz , David Vilares , Carlos Gómez-Rodríguez

Head-driven phrase structure grammar (HPSG) enjoys a uniform formalism representing rich contextual syntactic and even semantic meanings. This paper makes the first attempt to formulate a simplified HPSG by integrating constituent and…

Computation and Language · Computer Science 2020-05-06 Junru Zhou , Hai Zhao

The causal structure of a unitary transformation is the set of relations of possible influence between any input subsystem and any output subsystem. We study whether such causal structure can be understood in terms of compositional…

Quantum Physics · Physics 2021-07-28 Robin Lorenz , Jonathan Barrett

Refinement types are types equipped with predicates that specify preconditions and postconditions of underlying functional languages. We propose a general semantic construction of dependent refinement type systems from underlying type…

Logic in Computer Science · Computer Science 2020-10-19 Satoshi Kura

This article proposes a method to extract dependency structures from phrase-structure level parsing with Interaction Grammars. Interaction Grammars are a formalism which expresses interactions among words using a polarity system.…

Computation and Language · Computer Science 2009-09-21 Jonathan Marchand , Bruno Guillaume , Guy Perrier

We present an unsupervised method to obtain disentangled representations of sentences that single out semantic content. Using modified Transformers as building blocks, we train a Variational Autoencoder to translate the sentence to a fixed…

Computation and Language · Computer Science 2020-12-29 Ghazi Felhi , Joseph Le Roux , Djamé Seddah

Recombining known primitive concepts into larger novel combinations is a quintessentially human cognitive capability. Whether large neural models in NLP can acquire this ability while learning from data is an open question. In this paper,…

Computation and Language · Computer Science 2023-08-02 Josef Valvoda , Naomi Saphra , Jonathan Rawski , Adina Williams , Ryan Cotterell

The mechanisms of comprehension during language processing remains an open question. Classically, building the meaning of a linguistic utterance is said to be incremental, step-by-step, based on a compositional process. However, many…

Computation and Language · Computer Science 2025-11-05 Philippe Blache , Emmanuele Chersoni , Giulia Rambelli , Alessandro Lenci

This paper presents an operational semantics for UML activity diagrams. The purpose of this semantics is three-fold: to give a robust basis for verifying model correctness; to help validate model transformations; and to provide a…

Logic in Computer Science · Computer Science 2016-04-11 Zamira Daw , Rance Cleaveland

We propose a novel dependency-based hybrid tree model for semantic parsing, which converts natural language utterance into machine interpretable meaning representations. Unlike previous state-of-the-art models, the semantic information is…

Computation and Language · Computer Science 2018-09-05 Zhanming Jie , Wei Lu

Recent work on the interpretability of deep neural language models has concluded that many properties of natural language syntax are encoded in their representational spaces. However, such studies often suffer from limited scope by focusing…

Computation and Language · Computer Science 2020-04-30 Artur Kulmizev , Vinit Ravishankar , Mostafa Abdou , Joakim Nivre

We prove a theorem stating that any semantics can be encoded as a compositional semantics, which means that, essentially, the standard definition of compositionality is formally vacuous. We then show that when compositional semantics is…

cmp-lg · Computer Science 2008-02-03 Wlodek Zadrozny

We consider a new kind of interpretation over relational structures: finite sets interpretations. Those interpretations are defined by weak monadic second-order (WMSO) formulas with free set variables. They transform a given structure into…

Logic in Computer Science · Computer Science 2017-01-11 Thomas Colcombet , Christof Löding