English
Related papers

Related papers: Crossings as a side effect of dependency lengths

200 papers

Any piece of knowledge is usually expressed in one or a handful of natural languages on the web or in any large corpus. Large Language Models (LLMs) act as a bridge by acquiring knowledge from a source language and making it accessible when…

Computation and Language · Computer Science 2025-10-20 Vihari Piratla , Purvam Jain , Darshan Singh , Partha Talukdar , Trevor Cohn

The paper presents a language model that develops syntactic structure and uses it to extract meaningful information from the word history, thus enabling the use of long distance dependencies. The model assigns probability to every joint…

Computation and Language · Computer Science 2007-05-23 Ciprian Chelba

We suggest an information-theoretic approach for measuring stylistic coordination in dialogues. The proposed measure has a simple predictive interpretation and can account for various confounding factors through proper conditioning. We…

Computation and Language · Computer Science 2015-08-28 Shuyang Gao , Greg Ver Steeg , Aram Galstyan

We investigate properties of evolving linguistic networks defined by the word-adjacency relation. Such networks belong to the category of networks with accelerated growth but their shortest path length appears to reveal the network size…

Computation and Language · Computer Science 2015-06-22 Andrzej Kulig , Stanislaw Drozdz , Jaroslaw Kwapien , Pawel Oswiecimka

Surprisal theory posits that the processing difficulty of a word is determined by its predictability in context, offering a potential link between human sentence processing and next-word predictions from language models. While language…

Computation and Language · Computer Science 2026-05-18 William Timkey , Brian Dillon , Tal Linzen

This paper introduces the notion of objection-based causal networks which resemble probabilistic causal networks except that they are quantified using objections. An objection is a logical sentence and denotes a condition under which a,…

Artificial Intelligence · Computer Science 2013-03-25 Adnan Darwiche

Transition-based and graph-based dependency parsers have previously been shown to have complementary strengths and weaknesses: transition-based parsers exploit rich structural features but suffer from error propagation, while graph-based…

Computation and Language · Computer Science 2019-08-28 Artur Kulmizev , Miryam de Lhoneux , Johannes Gontrum , Elena Fano , Joakim Nivre

This work investigates the intersection property of conditional independence. It states that for random variables $A,B,C$ and $X$ we have that $X$ independent of $A$ given $B,C$ and $X$ independent of $B$ given $A,C$ implies $X$ independent…

Probability · Mathematics 2016-08-18 Jonas Peters

Languages may encode similar meanings using different sentence structures. This makes it a challenge to provide a single set of formal rules that can derive meanings from sentences in many languages at once. To overcome the challenge, we…

Computation and Language · Computer Science 2024-03-05 Laurestine Bradford , Timothy John O'Donnell , Siva Reddy

Human language has a distinct systematic structure, where utterances break into individually meaningful words which are combined to form phrases. We show that natural-language-like systematicity arises in codes that are constrained by a…

Computation and Language · Computer Science 2025-11-19 Richard Futrell , Michael Hahn

Are pairs of words that tend to occur together also likely to stand in a linguistic dependency? This empirical question is motivated by a long history of literature in cognitive science, psycholinguistics, and NLP. In this work we…

Computation and Language · Computer Science 2022-05-02 Jacob Louis Hoover , Alessandro Sordoni , Wenyu Du , Timothy J. O'Donnell

We investigate the properties of formal languages expressible in terms of formulas over quantifier-free theories of word equations, arithmetic over length constraints, and language membership predicates for the classes of regular, visibly…

Formal Languages and Automata Theory · Computer Science 2022-05-03 Joel D. Day , Vijay Ganesh , Nathan Grewal , Florin Manea

This article is an exposition of recent results on self-similar sets, asserting that if the dimension is smaller than the trivial upper bound then there are almost overlaps between cylinders. We give a heuristic derivation of the theorem…

Classical Analysis and ODEs · Mathematics 2014-09-30 Michael Hochman

Behavioural distances provide a robust alternative to notions of equivalence such as bisimilarity in the context of probabilistic transition systems. They can be defined as least fixed points, whose universal property allows us to exhibit…

Logic in Computer Science · Computer Science 2025-10-14 Ruben Turkenburg , Harsh Beohar , Franck van Breugel , Clemens Kupke , Jurriaan Rot

Cross-lingual Natural Language Processing (NLP) has gained significant traction in recent years, offering practical solutions in low-resource settings by transferring linguistic knowledge from resource-rich to low-resource languages. This…

Computation and Language · Computer Science 2025-11-14 Rocco Tripodi , Xiaoyu Liu

Natural languages are complexly structured entities. They exhibit characterising regularities that can be exploited to link them one another. In this work, I compare two morphological aspects of languages: Written Patterns and Sentence…

Computation and Language · Computer Science 2019-07-09 Alberto Calderone

Proofs, in Ludics, have an interpretation provided by their counter-proofs, that is the objects they interact with. We follow the same idea by proposing that sentence meanings are given by the counter-meanings they are opposed to in a…

Computation and Language · Computer Science 2009-10-09 Alain Lecomte , Myriam Quatrini

The principle of DEPENDENCY LENGTH MINIMIZATION, which seeks to keep syntactically related words close in a sentence, is thought to universally shape the structure of human languages for effective communication. However, the extent to which…

Computation and Language · Computer Science 2023-04-25 Sidharth Ranjan , Titus von der Malsburg

This paper proposes decoupling the dependency tree from word order, such that surface ordering is not determined by traversing the dependency tree. We develop the notion of a \emph{word order domain structure}, which is linked but…

cmp-lg · Computer Science 2007-05-23 Norbert Broeker

The growing demand for structured knowledge has led to great interest in relation extraction, especially in cases with limited supervision. However, existing distance supervision approaches only extract relations expressed in single…

Computation and Language · Computer Science 2017-08-16 Chris Quirk , Hoifung Poon