English
Related papers

Related papers: Crossings as a side effect of dependency lengths

200 papers

As speakers turn their thoughts into sentences, they maintain a balance between the complexity of words and syntax. However, it is unclear whether this syntax-lexicon tradeoff is unique to the spoken language production that is under the…

Computation and Language · Computer Science 2022-06-28 Neguine Rezaii

The theoretical code-switching (CS) literature provides numerous pointwise investigations that aim to explain patterns in CS, i.e. why bilinguals switch language in certain positions in a sentence more often than in others. A resulting…

Computation and Language · Computer Science 2025-07-29 Igor Sterner , Simone Teufel

In the recent issue of PNAS, Futrell et al. claims that their study of 37 languages gives the first large scale cross-language evidence for Dependency Length Minimization, which is an overstatement that ignores similar previous researches.…

Computation and Language · Computer Science 2016-09-27 Haitao Liu , Chunshan Xu , Junying Liang

Semantics of a sentence is defined with much less ambiguity than semantics of a single word, and we assume that it should be better preserved by translation to another language. If multilingual sentence embeddings intend to represent…

Computation and Language · Computer Science 2024-06-28 Oleg Vasilyev , Fumika Isono , John Bohannon

Syntactic dependency parsing is an important task in natural language processing. Unsupervised dependency parsing aims to learn a dependency parser from sentences that have no annotation of their correct parse trees. Despite its difficulty,…

Computation and Language · Computer Science 2020-10-06 Wenjuan Han , Yong Jiang , Hwee Tou Ng , Kewei Tu

Sentence simplification aims to make sentences easier to read and understand. Recent approaches have shown promising results with sequence-to-sequence models which have been developed assuming homogeneous target audiences. In this paper we…

Computation and Language · Computer Science 2019-10-11 Jonathan Mallinson , Mirella Lapata

In this paper we build on earlier observations and theory regarding word length frequency and sequential distribution to develop a mathematical characterization of some of the language features distinguishing isometrically lineated text…

cmp-lg · Computer Science 2007-05-23 Hideaki Aoyama , John Constable

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

The syntactic structure of a sentence can be described as a tree that indicates the syntactic relationships between words. In spite of significant progress in unsupervised methods that retrieve the syntactic structure of sentences, guessing…

Computation and Language · Computer Science 2026-03-09 Ramon Ferrer-i-Cancho , Marta Arias

Syntax connects words to each other in very specific ways. Two words are syntactically connected if they depend directly on each other. Syntactic connections usually happen within a sentence. Gathering all those connection across several…

Computation and Language · Computer Science 2025-03-11 Juan Soria-Postigo , Luis F Seoane

Stanford typed dependencies are a widely desired representation of natural language sentences, but parsing is one of the major computational bottlenecks in text analysis systems. In light of the evolving definition of the Stanford…

Computation and Language · Computer Science 2014-04-17 Lingpeng Kong , Noah A. Smith

The word order of a sentence is shaped by multiple principles. The principle of syntactic dependency distance minimization is in conflict with the principle of surprisal minimization (or predictability maximization) in single head syntactic…

Computation and Language · Computer Science 2025-10-31 Ramon Ferrer-i-Cancho

A dependent theory is a (first order complete theory) T which does not have the independence property. A main result here is: if we expand a model of T by the traces on it of sets definable in a bigger model then we preserve its being…

Logic · Mathematics 2013-02-20 Saharon Shelah

It is well-known that Choice and Regularity are independent of each other but have important common consequences of logical character (reflection principles, representations of classes by sets, etc.). We explain this phenomenon by isolating…

Logic · Mathematics 2007-09-20 Denis I. Saveliev

We show that the crossing number of any link that is known to be quasi-alternating is less than or equal to its determinant. Based on this, we conjecture that the crossing number of any quasi-alternating link is less than or equal to its…

Geometric Topology · Mathematics 2012-05-22 Khaled Qazaqzeh , Balkees Qublan , Abeer Jaradat

Recent work on language modelling has shifted focus from count-based models to neural models. In these works, the words in each sentence are always considered in a left-to-right order. In this paper we show how we can improve the…

Computation and Language · Computer Science 2015-07-07 Piotr Mirowski , Andreas Vlachos

This study investigates human and ChatGPT text simplification and its relationship to dependency distance. A set of 220 sentences, with increasing grammatical difficulty as measured in a prior user study, were simplified by a human expert…

Computation and Language · Computer Science 2024-06-27 Sumi Lee , Gondy Leroy , David Kauchak , Melissa Just

Syntactic theory has traditionally adopted a constructivist approach, in which a set of atomic elements are manipulated by combinatory operations to yield derived, complex elements. Syntactic structure is thus seen as the result or discrete…

Computation and Language · Computer Science 2019-01-01 Diego Gabriel Krivochen

Unsupervised on-the-fly back-translation, in conjunction with multilingual pretraining, is the dominant method for unsupervised neural machine translation. Theoretically, however, the method should not work in general. We therefore conduct…

Computation and Language · Computer Science 2024-03-28 Nicolas Guerin , Shane Steinert-Threlkeld , Emmanuel Chemla

A fundamental result in psycholinguistics is that less predictable words take a longer time to process. One theoretical explanation for this finding is Surprisal Theory (Hale, 2001; Levy, 2008), which quantifies a word's predictability as…

Computation and Language · Computer Science 2025-04-15 Ethan Gotlieb Wilcox , Tiago Pimentel , Clara Meister , Ryan Cotterell , Roger P. Levy