Typed Feature Structures as Descriptions
| dc.creator | King, Paul John | |
| dc.date | 1994-08-02 | |
| dc.date.accessioned | 2026-07-07T09:09:27Z | |
| dc.date.available | 2026-07-07T09:09:27Z | |
| dc.description | A description is an entity that can be interpreted as true or false of an object, and using feature structures as descriptions accrues several computational benefits. In this paper, I create an explicit interpretation of a typed feature structure used as a description, define the notion of a satisfiable feature structure, and create a simple and effective algorithm to decide if a feature structure is satisfiable. | |
| dc.description | COLING 94 reserve paper, 5 pages, LaTeX (no .sty exotica) | |
| dc.identifier | https://arxiv.org/abs/cmp-lg/9408003 | |
| dc.identifier | http://arxiv.org/abs/cmp-lg/9408003 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/151043 | |
| dc.subject | Computation and Language | |
| dc.title | Typed Feature Structures as Descriptions | |
| dc.type | text |