English
Related papers

Related papers: Tree-gram Parsing: Lexical Dependencies and Struct…

200 papers

We present a dataset for evaluating the grammaticality of the predictions of a language model. We automatically construct a large number of minimally different pairs of English sentences, each consisting of a grammatical and an…

Computation and Language · Computer Science 2018-08-29 Rebecca Marvin , Tal Linzen

This paper describes a new statistical parser which is based on probabilities of dependencies between head-words in the parse tree. Standard bigram probability estimation techniques are extended to calculate probabilities of dependencies…

cmp-lg · Computer Science 2008-02-03 Michael Collins

Different semantic interpretation tasks such as text entailment and question answering require the classification of semantic relations between terms or entities within text. However, in most cases it is not possible to assign a direct…

Computation and Language · Computer Science 2018-05-18 Siamak Barzegar , Andre Freitas , Siegfried Handschuh , Brian Davis

Generating a long, coherent text such as a paragraph requires a high-level control of different levels of relations between sentences (e.g., tense, coreference). We call such a logical connection between sentences as a (paragraph) flow. In…

Computation and Language · Computer Science 2019-09-02 Dongyeop Kang , Hiroaki Hayashi , Alan W Black , Eduard Hovy

In this paper we present a fully lexicalized grammar formalism as a particularly attractive framework for the specification of natural language grammars. We discuss in detail Feature-based, Lexicalized Tree Adjoining Grammars (FB-LTAGs), a…

cmp-lg · Computer Science 2008-02-03 B. Srinivas , Dania Egedi , Christy Doran , Tilman Becker

We consider retrofitting structure-aware Transformer-based language model for facilitating end tasks by proposing to exploit syntactic distance to encode both the phrasal constituency and dependency connection into the language model. A…

Computation and Language · Computer Science 2020-09-17 Hao Fei , Yafeng Ren , Donghong Ji

This paper explores relational syllogistic logics, a family of logical systems related to reasoning about relations in extensions of the classical syllogistic. These are all decidable logical systems. We prove completeness theorems and…

Logic · Mathematics 2023-06-22 Alex Kruckman , Lawrence S. Moss

While dependency parsers reach very high overall accuracy, some dependency relations are much harder than others. In particular, dependency parsers perform poorly in coordination construction (i.e., correctly attaching the "conj" relation).…

Computation and Language · Computer Science 2017-02-23 Jessica Ficler , Yoav Goldberg

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

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

Word embeddings have been found to capture a surprisingly rich amount of syntactic and semantic knowledge. However, it is not yet sufficiently well-understood how the relational knowledge that is implicitly encoded in word embeddings can be…

Artificial Intelligence · Computer Science 2017-08-22 Zied Bouraoui , Shoaib Jameel , Steven Schockaert

The intricate hierarchical structure of syntax is fundamental to the intricate and systematic nature of human language. This study investigates the premise that language models, specifically their attention distributions, can encapsulate…

Computation and Language · Computer Science 2023-12-27 Buvarp Gohsh , Woods Ali , Anders Michael

Because of their superior ability to preserve sequence information over time, Long Short-Term Memory (LSTM) networks, a type of recurrent neural network with a more complex computational unit, have obtained strong results on a variety of…

Computation and Language · Computer Science 2015-06-02 Kai Sheng Tai , Richard Socher , Christopher D. Manning

We release Galactic Dependencies 1.0---a large set of synthetic languages not found on Earth, but annotated in Universal Dependencies format. This new resource aims to provide training and development data for NLP methods that aim to adapt…

Computation and Language · Computer Science 2017-10-12 Dingquan Wang , Jason Eisner

Languages are grouped into families that share common linguistic traits. While this approach has been successful in understanding genetic relations between diverse languages, more analyses are needed to accurately quantify their…

Computation and Language · Computer Science 2024-10-04 Juan De Gregorio , Raúl Toral , David Sánchez

We argue that the resource sharing that is commonly manifest in semantic accounts of coordination is instead appropriately handled in terms of structure-sharing in LFG f-structures. We provide an extension to the previous account of LFG…

cmp-lg · Computer Science 2016-08-31 Andrew Kehler , Mary Dalrymple , John Lamping , Vijay Saraswat

Syntactic features play an essential role in identifying relationship in a sentence. Previous neural network models often suffer from irrelevant information introduced when subjects and objects are in a long distance. In this paper, we…

Computation and Language · Computer Science 2015-06-26 Kun Xu , Yansong Feng , Songfang Huang , Dongyan Zhao

While syntactic dependency annotations concentrate on the surface or functional structure of a sentence, semantic dependency annotations aim to capture between-word relationships that are more closely related to the meaning of a sentence,…

Computation and Language · Computer Science 2018-07-05 Timothy Dozat , Christopher D. Manning

The described tagger is based on a hidden Markov model and uses tags composed of features such as part-of-speech, gender, etc. The contextual probability of a tag (state transition probability) is deduced from the contextual probabilities…

cmp-lg · Computer Science 2008-02-03 Andre Kempe

The meaning of a sentence is a function of the relations that hold between its words. We instantiate this relational view of semantics in a series of neural models based on variants of relation networks (RNs) which represent a set of…

Computation and Language · Computer Science 2018-11-27 Lei Yu , Cyprien de Masson d'Autume , Chris Dyer , Phil Blunsom , Lingpeng Kong , Wang Ling
‹ Prev 1 4 5 6 7 8 10 Next ›