Term Encoding of Typed Feature Structures

Details Term Encoding of Typed Feature Structures Term Encoding of Typed Feature Structures

1995-12-22

arxiv.org/abs/cmp-lg/9512005v1

Proceedings of the Fourth International Workshop on Parsing Technologies, pp. 89-98, 1995

Computer Science

Computation and Language

12 pages Latex2e, ecltree, epic, eepic, tree-dvips

Scientific paper

This paper presents an approach to Prolog-style term encoding of typed feature structures. The type feature structures to be encoded are constrained by appropriateness conditions as in Carpenter's ALE system. But unlike ALE, we impose a further independently motivated closed-world assumption. This assumption allows us to apply term encoding in cases that were problematic for previous approaches. In particular, previous approaches have ruled out multiple inheritance and further specification of feature-value declarations on subtypes. In the present approach, these spececial cases can be handled as well, though with some increase in complexity. For grammars without multiple inheritance and specification of feature values, the encoding presented here reduces to that of previous approaches.

Affiliated with

Also associated with

No associations

Rating

Term Encoding of Typed Feature Structures does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Term Encoding of Typed Feature Structures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Term Encoding of Typed Feature Structures will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-621352