Off-line Parsability and the Well-foundedness of Subsumption

Details Off-line Parsability and the Well-foundedness of Subsumption Off-line Parsability and the Well-foundedness of Subsumption

1997-09-23

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

Computer Science

Computation and Language

19 pages, 1 postscript figure, uses fullname.sty

Scientific paper

Typed feature structures are used extensively for the specification of linguistic information in many formalisms. The subsumption relation orders TFSs by their information content. We prove that subsumption of acyclic TFSs is well-founded, whereas in the presence of cycles general TFS subsumption is not well-founded. We show an application of this result for parsing, where the well-foundedness of subsumption is used to guarantee termination for grammars that are off-line parsable. We define a new version of off-line parsability that is less strict than the existing one; thus termination is guaranteed for parsing with a larger set of grammars.

Affiliated with

Also associated with

No associations

Rating

Off-line Parsability and the Well-foundedness of Subsumption 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 Off-line Parsability and the Well-foundedness of Subsumption, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Off-line Parsability and the Well-foundedness of Subsumption will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-503909