Off-line Parsability and the Well-foundedness of Subsumption
| dc.creator | Wintner, Shuly | |
| dc.creator | Francez, Nissim | |
| dc.date | 1997-09-23 | |
| dc.date.accessioned | 2026-07-07T09:10:59Z | |
| dc.date.available | 2026-07-07T09:10:59Z | |
| dc.description | 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. | |
| dc.description | 19 pages, 1 postscript figure, uses fullname.sty | |
| dc.identifier | https://arxiv.org/abs/cmp-lg/9709011 | |
| dc.identifier | http://arxiv.org/abs/cmp-lg/9709011 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/151527 | |
| dc.subject | Computation and Language | |
| dc.title | Off-line Parsability and the Well-foundedness of Subsumption | |
| dc.type | text |