Journal of Logic, Language and Information 4 (2):111-143 (1995)
Abstract |
Feature structures are employed in various forms in many areas of linguistics. Informally, one can picture a feature structure as a sort of tree decorated with information about constraints requiring that specific subtrees be identical (isomorphic). Here I show that this informal picture of feature structures can be used to characterize exactly the class of feature structures under their usual subsumption ordering. Furthermore, once a precise definition of tree is fixed, this characterization makes use only of standard domain-theoretic notions regarding the information borne by elements in a domain, thus removing (or better, explaining) all apparentlyad hoc choices in the original definition of feature structures. In addition, I show how this characterization can be parameterized in order to yield similar characterizations of various different notions of feature structure, including acyclic structures, structures with appropriateness conditions and structures with apartness conditions (used to model path inequations). The generalizations to other notions of feature structure also emphasize that the construction given here is in fact independent of the application to feature structures.
|
Keywords | Feature structures domains constraints |
Categories | (categorize this paper) |
DOI | 10.1007/BF01048617 |
Options |
![]() ![]() ![]() ![]() |
Download options
References found in this work BETA
Domain Theory in Logical Form.Samson Abramsky - 1991 - Annals of Pure and Applied Logic 51 (1-2):1-77.
Citations of this work BETA
No citations found.
Similar books and articles
A Creationist Myth: Pragmatic Combination Not Feature Creation.Nick Braisby & Bradley Franks - 1998 - Behavioral and Brain Sciences 21 (1):19-20.
Order Independent and Persistent Typed Default Unification.Alex Lascarides, Ted Briscoe, Nicholas Asher & Ann Copestake - 1996 - Linguistics and Philosophy 19 (1):1 - 90.
Representing Law in Partial Information Structures.Niels Peek - 1997 - Artificial Intelligence and Law 5 (4):263-290.
The Impossibility of a Bivalent Truth-Functional Semantics for the Non-Boolean Propositional Structures of Quantum Mechanics.Ariadna Chernavska - 1981 - Philosophia 10 (1-2):1-18.
ℵ0-Categorical Tree-Decomposable Structures.A. H. Lachlan - 1992 - Journal of Symbolic Logic 57 (2):501 - 514.
Is There a Genuine Modal Perspective on Feature Structures?Marcus Kracht - 1995 - Linguistics and Philosophy 18 (4):401 - 458.
Fibred Semantics for Feature-Based Grammar Logic.Jochen Dörre, Esther König & Dov Gabbay - 1996 - Journal of Logic, Language and Information 5 (3-4):387-422.
The Domain of Set-Valued Feature Structures.M. Andrew Moshier & Carl J. Pollard - 1994 - Linguistics and Philosophy 17 (6):607-631.
Analytics
Added to PP index
2009-01-28
Total views
26 ( #400,588 of 2,411,744 )
Recent downloads (6 months)
1 ( #539,061 of 2,411,744 )
2009-01-28
Total views
26 ( #400,588 of 2,411,744 )
Recent downloads (6 months)
1 ( #539,061 of 2,411,744 )
How can I increase my downloads?
Downloads