Typed unification grammars
Published 1 January 1990Open access
Martin Emele, Rémi Zajac
Citations67
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
TFS, a computer formalism in the class of logic formalisms which integrates a powerful type system, is introduced, and it is shown how to make use of the typing system to enforce general constraints and modularize linguistic descriptions.
Abstract
We introduce TFS, a computer formalism in the class of logic formalisms which integrates a powerful type system. Its basic data structures are typed feature structures. The type system encourages an object-oriented approach to linguistic description by providing a multiple inheritance mechanism and an inference mechanism which allows the specification of relations between levels of linguistic description defined as classes of objects. We illustrate this approach starting from a very simple DCG, and show how to make use of the typing system to enforce general constraints and modularize linguistic descriptions, and how further abstraction leads to a HPSG-like grammar.
Keywords
Computer Science
Medical Entomology and ZoologyInformation-based syntax and semantics
1,066 Citations1987Carl Pollard, Ivan A. Sag
The particular theory presented, head-driven phrase structure grammar (HPSG) - so-called because of its central notion of the grammatical head - is an information-based (or 'unification-based' theory that has its roots in a number of different research programs within linguistics and neighboring disciplines such as philosophy and computer science.
Artificial IntelligenceDefinite clause grammars for language analysis—A survey of the formalism and a comparison with augmented transition networks
985 Citations1980Fernando C. N. Pereira, David H. Warren
It is argued that DCGs can be at least as efficient as ATNs, whilst the DCG formalism is clearer, more concise and in practice more powerful.
Digital Access to Scholarship at Harvard (DASH) (Harvard University)An introduction to unification-based approaches to grammar
946 Citations1986Stuart M. Shieber
Theoretical Computer ScienceAn algebraic semantics approach to the effective resolution of type equations
123 Citations1986Hassan Aı̈t-Kaci
A method for solving systems of type equations by iterated rewriting of type symbols is proposed which defines an operational semantics for KBL, a Knowledge Base Language, which is shown that a KBL program can be seen as a system of equations.
ScholarlyCommons (University of Pennsylvania)A lattice theoretic approach to computation based on a calculus of partially ordered type structures (property inheritance, semantic nets, graph unification)
89 Citations1984Hassan Aı̈t-Kaci
A formal lattice-theoretic calculus of partially ordered type structures where the ordering is meant to reflect subtyping is defined and a model of computation which amounts to solving systems of simultaneous equations in a lattice of types is proposed.
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.
A Feature Logic with Subsorts
39 Citations1992Gert Smolka
A model theoretic open world semantics and it is shown that sorted feature structures constitute a canon-ical model, that is, without loss of generality subsumption and consistency of set descriptions can be considered with respect to feature structures only.
The <C,A>,T framework in Eurotra
32 Citations1986Doug Arnold, Steven Krauwer +3 more
A model for MT is described, developed within the Eurotra MT project, based on the idea of compositional translation by describing a basic, experimental notation which embodies the idea of compositional translation.
Expressing generalizations in unification-based grammar formalisms
27 Citations1989Marc Moens, Jo Calder +3 more
This paper shows how higher levels of generalization can be introduced into unification grammars by exploiting methods for typing grammatical objects and the sort system used in the semantic representation language.
A transfer model using a typed feature structure rewriting system with inheritance
20 Citations1989Rémi Zajac
A model for transfer in machine translation which uses a rewriting system for typed feature structures and is based on the semantics of typing feature structures as described in [Ait-Kaci 84].
Incorporating inheritance and feature structures into a Logic Grammar formalism
8 Citations1987Harry H. Porter
The ψ-term, an informational structure resembling feature-based functional structures but which also includes taxonomic inheritance, is described and is a proper superset of DCG and includes many features of PATR-II.
Parametrized abstract objects for linguistic information processing
5 Citations1985Hélène Bestougeff, Gérard Ligozat
This paper discusses the relevance of the choice of parametrized abstract objects as tools for linguistic information processing and exemplifies the use of such objects for temporal information.
Studies in linguistics and philosophyInterpreting Situation Schemata
2 Citations1987Jens Erik Fenstad, Per‐Kristian Halvorsen +2 more
The map is directed from linguistic form to situation schemata, hence the primacy of the former over the latter, and the situation schema is a theoretical notation, a convenient way of summing up information from the linguistic form relevant for the semantic interpretation.