Encoding Lexicalized Tree Adjoining Grammars with a nonmonotonic inheritance hierarchy
Published 1 January 1995Open access
Roger Evans, Gerald Gazdar, David Weir
Citations26
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This paper shows how DATR, a widely used formal language for lexical knowledge representation, can be used to define an LTAG lexicon as an inheritance hierarchy with internal lexical rules.
Abstract
This paper shows how DATR, a widely used formal language for lexical knowledge representation, can be used to define an I_TAG lexicon as an inheritance hierarchy with internal lexical rules.A bottom-up featural encoding is used for LTAG trees and this allows lexical rules to be implemented as covariation constraints within feature structures.Such an approach eliminates the considerable redundancy otherwise associated with an LTAG lexicon. 1
Keywords
Computer Science
Journal of Computer and System SciencesTree adjunct grammars
774 Citations1975Aravind K. Joshi, Leon S. Levy +1 more
A tree generating system called a tree adjunct grammar is described and its formal properties are studied relating them to the tree generating systems of Brainerd and Rounds and to the recognizable sets and local sets discussed by Thatcher.
ScholarlyCommons (University of Pennsylvania)A Lexicalized Tree Adjoining Grammar for English
313 Citations1990Anne Abeillé, Kathleen Bishop +2 more
A representation of prepositional complements that is based on extended elementary trees, and how to deal with semantic non compositionality in verb-particle combinations, light verb constructions and idioms, without losing the internal syntactic composition of these structures are presented.
Journal of LinguisticsNetwork Morphology: a DATR account of Russian nominal inflection
283 Citations1993Greville G. Corbett, Norman Fraser
A declarative approach to inflectional morphology is introduced, which is called Network Morphology, using the lexical representation language DATR, and it is shown that it can account for a range of data, and can provide a more satisfying analysis than was previously available.
Cambridge University Press eBooksInheritance, Defaults and the Lexicon
137 Citations1994Ted Briscoe Valeria, Valeria de Paiva +2 more
The ACQUILEX LKB: an introduction Ann Copestake, Antonio Sanfilippo, Ted Briscoe and Valeria de Paiva, types and constraints in the LKB, and Defaults in lexical representation.
Lexical rules in the hierarchical lexicon
116 Citations1989Daniel Flickinger
Inference in DATR
85 Citations1989Roger Evans, Gerald Gazdar
This paper presents the syntax and inference mechanisms for the DATR language, a declarative language for representing a restricted class of inheritance networks, permitting both multiple and default inheritance.
Structure sharing in lexicalized tree-adjoining grammars
44 Citations1992K. Vijay‐Shanker, Yves Schabes
In the envisaged scheme, the use of a hierarchical lexicon and of lexical and syntactic rules for lexicalized tree-adjoining grammars will capture important linguistic generalizations and also allows for a space efficient representation of the grammar.
Reasoning with descriptions of trees
34 Citations1992James Rogers, K. Vijay‐Shanker
A logic for describing trees which allows us to reason about both the parent and domination relationship, and serves to formalize the reasoning on which these applications are based.
Making DATR work for speech: lexicon compilation in SUNDIAL
25 Citations1992François Andry, Norman Fraser +3 more
DIALEX is presented, an inheritance-based tool that facilitates the rapid construction of linguistic knowledge bases that inherits morphosyntactic, syntactic, and lexico-semantic constraints from an application independent set of structured base definitions.
Prosodic Inheritance and morphological generalisations
19 Citations1991Sabine Reinhard, Dafydd Gibbon
Models of an extensive range of German Umlaut and Arabic intercalation facts, implemented in DATR, show that the Pl approach also covers 'hard cases' more homogeneously and more extensively than previous computational treatments.
European Conference on Artificial IntelligenceAn application of DATR: the TIC lexicon
19 Citations1990Lynne Cahill, Roger Evans
This paper describes an application of DATR in a practical lexical context, using it in the Traffic Information Collator (TIC), a knowledge-based system operating in the domain of road traffic incident reports.
DATR as a lexical component for PATR
17 Citations1991James Kilbury, Petra Naerger +1 more
The representation of lexical entries requires special means which basic PATR systems do not include, but the language DATR, however, can be used to define an inheritance network serving as the lexical component.
Morphonology in the lexicon
16 Citations1993Lynne Cahill
This paper discusses how the alternations can be defined in the inheritance-based lexical representation language DATR, and how the phonological aspects can be built upon to bring it closer to an integrated lexicon with representations which can be used by both the morphology and phonology of a language.
Syllable-based morphology
15 Citations1990Lynne Cahill
This paper presents a language for the description of morphological alternations which is based on syllable structure and is compared to Koskenniemi's two-level account of morphonology.
UKnowledge (University of Kentucky)Conflict in Russian Genitive Plural Assignment: A Solution Represented in DATR
15 Citations1994Dunstan Brown, Andrew Hippisley
An explicit account of the conflict and its mediation of the Russian genitive plural is presented by basing this study on default inheritance on lexical knowledge representation language DATR, and it is shown that the conflict here can be resolved by reference to subsystems over and above the paradigm, such as stress.
Inheriting verb alternations
14 Citations1993Adam Kilgarriff
The paper shows how the verbal lexicon can be formalised in a way that captures and exploits generalisations about the alternation behaviour of verb classes, and offers practical benefits to computational lexicographers.
Reverse queries in DATR
7 Citations1994Hagen Langer
This paper presents an alternative access strategy (reverse query strategy) for a non-trivial subset of DATR that closely resembles the set of inference rules of the procedural semantics of DATOR.
Classification in Feature-Based Default Inheritance Hierarchies
6 Citations1993Marc Light
This paper formalizes this problem for feature-based default inheritance hierarchies and presents an approximation algorithm for it, which shows that this algorithms is efficient and looks at some of the possible problematic situations for the algorithm.
INSYST
4 Citations1993Marc Light, Sabine Reinhard +1 more
INSYST (INserter SYSTem) can efficiently insert lexical items under the appropriate nodes in hierarchies specified in the DATR formalism and uses a classification algorithm that maximizes the number of inherited features for each entry.
arXiv (Cornell University)Status of the XTAG System
2 Citations1994Christy Doran, Dania Egedi +2 more
This paper presents a description of and recent improvements to the various components of the XTAG system, and presents the recent performance of the wide-coverage grammar on various corpora and compares it against the performance of other wide- coverage and domain-specific grammars.