English
Related papers

Related papers: Using default inheritance to describe LTAG

200 papers

Building models that take advantage of the hierarchical structure of language without a priori annotation is a longstanding goal in natural language processing. We introduce such a model for the task of machine translation, pairing a…

Computation and Language · Computer Science 2017-09-07 James Bradbury , Richard Socher

Accurate syntactic representations are essential for robust generalization in natural language. Recent work has found that pre-training can teach language models to rely on hierarchical syntactic features - as opposed to incorrect linear…

Computation and Language · Computer Science 2023-06-01 Aaron Mueller , Tal Linzen

Syntactic Transformer language models aim to achieve better generalization through simultaneously modeling syntax trees and sentences. While prior work has been focusing on adding constituency-based structures to Transformers, we introduce…

Computation and Language · Computer Science 2024-07-25 Yida Zhao , Chao Lou , Kewei Tu

In this paper we introduce Latent Tree Language Model (LTLM), a novel approach to language modeling that encodes syntax and semantics of a given sentence as a tree of word roles. The learning phase iteratively updates the trees by moving…

Computation and Language · Computer Science 2016-09-06 Tomas Brychcin

In language model interpretability research, \textbf{circuit tracing} aims to identify which internal features causally contributed to a particular output and how they affected each other, with the goal of explaining the computations…

Computation and Language · Computer Science 2026-04-10 Aryaman Arora , Zhengxuan Wu , Jacob Steinhardt , Sarah Schwettmann

Regular tree grammars and regular path expressions constitute core constructs widely used in programming languages and type systems. Nevertheless, there has been little research so far on reasoning frameworks for path expressions where node…

Logic in Computer Science · Computer Science 2010-06-02 Everardo Barcenas , Pierre Geneves , Nabil Layaida , Alan Schmitt

This paper explores the kinds of probabilistic relations that are important in syntactic disambiguation. It proposes that two widely used kinds of relations, lexical dependencies and structural relations, have complementary disambiguation…

Computation and Language · Computer Science 2007-05-23 Khalil Sima'an

Identifying implicit discourse relations between text spans is a challenging task because it requires understanding the meaning of the text. To tackle this task, recent studies have tried several deep learning methods but few of them…

Computation and Language · Computer Science 2018-03-06 Yizhong Wang , Sujian Li , Jingfeng Yang , Xu Sun , Houfeng Wang

DATR is a declarative representation language for lexical information and as such, in principle, neutral with respect to particular processing strategies. Previous DATR compiler/interpreter systems support only one access strategy that…

cmp-lg · Computer Science 2008-02-03 Hagen Langer

Generating coherent and credible explanations remains a significant challenge in the field of AI. In recent years, researchers have delved into the utilization of entailment trees to depict explanations, which exhibit a reasoning process of…

Computation and Language · Computer Science 2024-03-12 Li Yuan , Yi Cai , Haopeng Ren , Jiexin Wang

This article describes the design of a common syntactic description for the core grammar of a group of related dialects. The common description does not rely on an abstract sub-linguistic structure like a metagrammar: it consists in a…

Computation and Language · Computer Science 2008-10-08 Pascal Vaillant

To a given gene tree topology $G$ and species tree topology $S$ with leaves labeled bijectively from a fixed set $X$, one can associate a set of ancestral configurations, each of which encodes a set of gene lineages that can be found at a…

Populations and Evolution · Quantitative Biology 2026-05-22 Egor Lappo , Noah A. Rosenberg

In this paper we present a transformation of finite propositional default theories into so-called propositional argumentation systems. This transformation allows to characterize all notions of Reiter's default logic in the framework of…

Artificial Intelligence · Computer Science 2007-05-23 Dritan Berzati , Bernhard Anrig , Juerg Kohlas

A grammar model for concurrent, object-oriented natural language parsing is introduced. Complete lexical distribution of grammatical knowledge is achieved building upon the head-oriented notions of valency and dependency, while inheritance…

cmp-lg · Computer Science 2008-02-03 Norbert Broeker , Udo Hahn , Susanne Schacht

A least common ancestor (LCA) of two leaves in a directed acyclic graph (DAG) is a vertex that is an ancestor of both leaves and has no proper descendant that is also their common ancestor. LCAs capture hierarchical relationships in rooted…

Combinatorics · Mathematics 2026-05-06 Anna Lindeberg , Anton Alfonsson , Vincent Moulton , Guillaume E. Scholz , Marc Hellmuth

While compositional accounts of human language understanding are based on a hierarchical tree-like process, neural models like transformers lack a direct inductive bias for such tree structures. Introducing syntactic inductive biases could…

Computation and Language · Computer Science 2025-03-25 Ananjan Nandi , Christopher D. Manning , Shikhar Murty

We suggest a compositional vector representation of parse trees that relies on a recursive combination of recurrent-neural network encoders. To demonstrate its effectiveness, we use the representation as the backbone of a greedy, bottom-up…

Computation and Language · Computer Science 2018-04-25 Eliyahu Kiperwasser , Yoav Goldberg

Revealing the syntactic structure of sentences in Chinese poses significant challenges for word-level parsers due to the absence of clear word boundaries. To facilitate a transition from word-level to character-level Chinese dependency…

Computation and Language · Computer Science 2024-06-07 Yang Hou , Zhenghua Li

Syntactic parsing is essential in natural-language processing, with constituent structure being one widely used description of syntax. Traditional views of constituency demand that constituents consist of adjacent words, but this poses…

Computation and Language · Computer Science 2024-10-14 Lukas Mielczarek

Default logic can be regarded as a mechanism to represent families of belief sets of a reasoning agent. As such, it is inherently second-order. In this paper, we study the problem of representability of a family of theories as the set of…

Logic in Computer Science · Computer Science 2007-05-23 Victor Marek , Jan Treur , Miroslaw Truszczynski