The Domain of Set-Valued Feature Structures  

Oleh:

Moshier, M. Andrew ; Pollard, Carl J.

Jenis: Article from Journal - ilmiah internasional
Dalam koleksi: Linguistics and Philosophy=> ada di SpringerLink 1997(vol.1) - Mutakhir; JSTOR vol. 17 no. 6 (Oct. 1994), page 601-631.
Fulltext: 25001570.pdf (2.48MB)

Isi artikel

It is well-known that feature structures (Rounds and Kasper 1986) can be fruitfully viewed as forming a Scott domain (Moshier 1988). Once a linguistically motivated notion of "set value" in feature structures is countenanced, however, this is no longer possible inasmuch as unification of set values in general fails to yield a unique result. In Pollard and Moshier 1990 it was shown that, while falling short of forming a Scott domain, the set of feature structures possibly containing set values satisfies the weaker condition of forming a "2/3 SFP domain" when equipped with an appropriate notion of subsumption: that is, for any finite set S of feature structures, there is a finite set M of minimal upper bounds of S such that any upper bound of S is approximated by a member of M. Unfortunately, the 2/3 SFP domains are not as pleasant to work with as Scott domains since they are not closed under all the familiar domain constructions; and the question has remained open whether the feature structure domain satisfies the added condition of profiniteness. (The profinite o algebraic domains with least elements are a subclass of the 2/3 SFP domains which enjoy the pleasant property of being the largest full subcategory of W-algebraic domains that is closed under the usual domain constructions.) In this paper we resolve this question in the affirmative.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali