English
Related papers

Related papers: Dutch Cross Serial Dependencies in HPSG

200 papers

Recursive processing in sentence comprehension is considered a hallmark of human linguistic abilities. However, its underlying neural mechanisms remain largely unknown. We studied whether a modern artificial neural network trained with…

Computation and Language · Computer Science 2021-05-04 Yair Lakretz , Dieuwke Hupkes , Alessandra Vergallito , Marco Marelli , Marco Baroni , Stanislas Dehaene

The patterns in which the syntax of different languages converges and diverges are often used to inform work on cross-lingual transfer. Nevertheless, little empirical work has been done on quantifying the prevalence of different syntactic…

Computation and Language · Computer Science 2020-07-14 Dmitry Nikolaev , Ofir Arviv , Taelin Karidi , Neta Kenneth , Veronika Mitnik , Lilja Maria Saeboe , Omri Abend

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

We reduce phrase-representation parsing to dependency parsing. Our reduction is grounded on a new intermediate representation, "head-ordered dependency trees", shown to be isomorphic to constituent trees. By encoding order information in…

Computation and Language · Computer Science 2015-03-03 Daniel Fernández-González , André F. T. Martins

Neural language models trained with a predictive or masked objective have proven successful at capturing short and long distance syntactic dependencies. Here, we focus on verb argument structure in German, which has the interesting property…

Computation and Language · Computer Science 2021-03-05 Charlotte Rochereau , Benoît Sagot , Emmanuel Dupoux

Traditional spoken language processing involves cascading an automatic speech recognition (ASR) system into text processing models. In contrast, "textless" methods process speech representations without ASR systems, enabling the direct use…

Computation and Language · Computer Science 2024-07-16 Shunsuke Kando , Yusuke Miyao , Jason Naradowsky , Shinnosuke Takamichi

We examine the line-wrap feature of text processors and show that adding characters to previously formatted lines leads to the cascading of words to subsequent lines and forms a state of self-organized criticality. We show the connection to…

adap-org · Physics 2009-10-28 Wolfgang Bauer , Scott Pratt

Recent analyses suggest that encoders pretrained for language modeling capture certain morpho-syntactic structure. However, probing frameworks for word vectors still do not report results on standard setups such as constituent and…

Computation and Language · Computer Science 2020-02-06 David Vilares , Michalina Strzyz , Anders Søgaard , Carlos Gómez-Rodríguez

Results of computational complexity exist for a wide range of phrase structure-based grammar formalisms, while there is an apparent lack of such results for dependency-based formalisms. We here adapt a result on the complexity of…

cmp-lg · Computer Science 2008-02-03 Peter Neuhaus , Norbert Broeker

Self-supervised speech models learn effective representations of spoken language, which have been shown to reflect various aspects of linguistic structure. But when does such structure emerge in model training? We study the encoding of a…

Computation and Language · Computer Science 2026-04-03 Marianne de Heer Kloots , Martijn Bentum , Hosein Mohebbi , Charlotte Pouw , Gaofei Shen , Willem Zuidema

Sequence to sequence (seq2seq) models are often employed in settings where the target output is natural language. However, the syntactic properties of the language generated from these models are not well understood. We explore whether such…

Computation and Language · Computer Science 2018-09-07 Johnny Tian-Zheng Wei , Khiem Pham , Brian Dillon , Brendan O'Connor

We provide a constraint based computational model of linear precedence as employed in the HPSG grammar formalism. An extended feature logic which adds a wide range of constraints involving precedence is described. A sound, complete and…

cmp-lg · Computer Science 2016-08-31 Suresh Manandhar

These lecture notes cover basic automata-theoretic concepts and logical formalisms for the modeling and verification of concurrent and distributed systems. Many of these concepts naturally extend the classical automata and logics over…

Logic in Computer Science · Computer Science 2021-10-19 Benedikt Bollig , Paul Gastin

Expressive text encoders such as RNNs and Transformer Networks have been at the center of NLP models in recent work. Most of the effort has focused on sentence-level tasks, capturing the dependencies between words in a single sentence, or…

Computation and Language · Computer Science 2021-09-15 Manuel Widmoser , Maria Leonor Pacheco , Jean Honorio , Dan Goldwasser

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

Syntactic parsing using dependency structures has become a standard technique in natural language processing with many different parsing models, in particular data-driven models that can be trained on syntactically annotated corpora. In…

Computation and Language · Computer Science 2020-01-30 Rahul Radhakrishnan Iyer , Miguel Ballesteros , Chris Dyer , Robert Frederking

Large Language Models (LLMs) exhibit strong implicit personalization ability, yet most existing approaches treat this behavior as a black box, relying on prompt engineering or fine tuning on user data. In this work, we adopt a mechanistic…

Computation and Language · Computer Science 2026-04-27 Weixu Zhang , Ye Yuan , Changjiang Han , Yuxing Tian , Zipeng Sun , Linfeng Du , Jikun Kang , Hong Kang , Xue Liu , Haolun Wu

This paper presents a novel treebank-driven approach to comparing syntactic structures in speech and writing using dependency-parsed corpora. Adopting a fully inductive, bottom-up method, we define syntactic structures as delexicalized…

Computation and Language · Computer Science 2026-02-24 Kaja Dobrovoljc

Dependency Grammar has been used by linguists as the basis of the syntactic components of their grammar formalisms. It has also been used in natural language parsing. In China, attempts have been made to use this grammar formalism to parse…

cmp-lg · Computer Science 2008-02-03 Bong Yeung Tom Lai , Changning Huang

The paper investigates the use of richer syntactic dependencies in the structured language model (SLM). We present two simple methods of enriching the dependencies in the syntactic parse trees used for intializing the SLM. We evaluate the…

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