English
Related papers

Related papers: Formal Constraints on Dependency Syntax

200 papers

This paper presents a tree-to-tree transduction method for sentence compression. Our model is based on synchronous tree substitution grammar, a formalism that allows local distortion of the tree topology and can thus naturally capture…

Computation and Language · Computer Science 2014-01-23 Trevor Anthony Cohn , Mirella Lapata

A sharp tension exists about the nature of human language between two opposite parties: those who believe that statistical surface distributions, in particular using measures like surprisal, provide a better understanding of language…

Computation and Language · Computer Science 2023-02-20 Matteo Greco , Andrea Cometa , Fiorenzo Artoni , Robert Frank , Andrea Moro

In dependent type theory, being able to refer to a type universe as a term itself increases its expressive power, but requires mechanisms in place to prevent Girard's paradox from introducing logical inconsistency in the presence of…

Programming Languages · Computer Science 2025-03-03 Jonathan Chan , Stephanie Weirich

Phrase structure trees have a hierarchical structure. In many subjects, most notably in Taxonomy such tree structures have been studied using ultrametrics. Here syntactical hierarchical phrase trees are subject to a similar analysis, which…

Computation and Language · Computer Science 2015-12-04 Mark D. Roberts

It is commonly believed that knowledge of syntactic structure should improve language modeling. However, effectively and computationally efficiently incorporating syntactic structure into neural language models has been a challenging topic.…

Computation and Language · Computer Science 2020-05-13 Wenyu Du , Zhouhan Lin , Yikang Shen , Timothy J. O'Donnell , Yoshua Bengio , Yue Zhang

Recognizing visual entities in a natural language sentence and arranging them in a 2D spatial layout require a compositional understanding of language and space. This task of layout prediction is valuable in text-to-image synthesis as it…

Computation and Language · Computer Science 2024-12-03 Wolf Nuyts , Ruben Cartuyvels , Marie-Francine Moens

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

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

This work focuses on analyzing the form and extent of syntactic abstraction captured by BERT by extracting labeled dependency trees from self-attentions. Previous work showed that individual BERT heads tend to encode particular dependency…

Computation and Language · Computer Science 2021-01-01 Tomasz Limisiewicz , Rudolf Rosa , David Mareček

The derivation trees of a tree adjoining grammar provide a first insight into the sentence semantics, and are thus prime targets for generation systems. We define a formalism, feature-based regular tree grammars, and a translation from…

Computation and Language · Computer Science 2015-03-13 Sylvain Schmitz , Joseph Le Roux

We introduce a novel dependency parser, the hexatagger, that constructs dependency trees by tagging the words in a sentence with elements from a finite set of possible tags. In contrast to many approaches to dependency parsing, our approach…

Computation and Language · Computer Science 2023-08-01 Afra Amini , Tianyu Liu , Ryan Cotterell

This paper presents a decidable characterization of tree languages that can be defined by a boolean combination of Sigma_1 sentences. This is a tree extension of the Simon theorem, which says that a string language can be defined by a…

Formal Languages and Automata Theory · Computer Science 2015-07-01 Mikołaj Bojańczyk , Luc Segoufin , Howard Straubing

A key problem in the description of language structure is to explain its contradictory properties of specificity and generality, the contrasting poles of formulaic prescription and generative productivity. I argue that this is possible if…

cmp-lg · Computer Science 2008-02-03 Robert John Freeman

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 , Frederick Jelinek

A logic is presented for reasoning on iterated sequences of formulae over some given base language. The considered sequences, or "schemata", are defined inductively, on some algebraic structure (for instance the natural numbers, the lists,…

Logic in Computer Science · Computer Science 2012-04-16 Mnacho Echenim , Nicolas Peltier

This paper provides a geometric characterization of subclasses of the regular languages. We use finite model theory to characterize objects like strings and trees as relational structures. Logical statements meeting certain criteria over…

Formal Languages and Automata Theory · Computer Science 2019-08-23 Jonathan Rawski

Current syntactic theory limits the range of grammatical variation so severely that the logical problem of grammar learning is trivial. Yet, children exhibit characteristic stages in syntactic development at least through their sixth year.…

cmp-lg · Computer Science 2008-02-03 Robert Frank

The central role of the lexicon in Meaning-Text Theory (MTT) and other dependency-based linguistic theories cannot be replicated in linguistic theories based on context-free grammars (CFGs). We describe Tree Adjoining Grammar (TAG) as a…

cmp-lg · Computer Science 2008-02-03 Owen Rambow , Aravind Joshi

We introduce a logical foundation to reason on tree structures with constraints on the number of node occurrences. Related formalisms are limited to express occurrence constraints on particular tree regions, as for instance the children of…

Logic in Computer Science · Computer Science 2015-07-01 Everardo Bárcenas , Jesús Lavalle

The precise formulation of derivation for tree-adjoining grammars has important ramifications for a wide variety of uses of the formalism, from syntactic analysis to semantic interpretation and statistical language modeling. We argue that…

cmp-lg · Computer Science 2009-09-25 Yves Schabes , Stuart M. Shieber
‹ Prev 1 3 4 5 6 7 10 Next ›