Implementing semantic frames as typed feature structures with XMG

Typed Feature Structures As Descriptions

A descr ip t ion is an enti ty tha t can be interpre ted as t rue or false of an object , and using fea ture s t ruc tures as descr ipt ions accrues several compu ta t i ona l benefits. In this paper , 1 create an explicit in te rpre ta t ion of a typed feature s t ruc ture used as a descript ion, define the not ion of a satisfiable fe.ature s t ructure , and create a s imple and effective a lg...

Parsing With Typed Feature Structures

Parsing with Typed Feature Structures

In this paper we provide for parsing with respect to grammars expressed in a general TFS-based formalism, a restriction of ALE. Our motivation being the design of an abstract (WAM-like) machine for the formalism, we consider parsing as a computational process and use it as an operational semantics to guide the design of the control structures for the abstract machine. We emphasize the notion of...

Typed Feature Structures for Expressing and Computationally Implementing Feature Cooccurence Restrictions

It has long been part of the folklore that typed feature structures were introduced into linguistics in order to replace the perceived-to-be-messy FCRs of GPSG. This correspondence between FCRs and typed feature structures, however, has never been made explicit. In fact, with the notion of appropriateness conditions used in Carpenter (1992), it is initially diicult to see how any dependency cou...

Term Encoding of Typed Feature Structures

I explore in this paper a variety of approaches to Prolog term encoding typed feature structure grammars. As in Carpenter [3], the signature for such grammars consists of a bounded complete partial order of types under subsumption (⊒) along with a partial function Approp:Type×Feat ⇀ Type. The appropriateness specification is subject to the constraint that feature-value specifications for subtyp...