Disjoint Feature Structures
Download:
|
|
by Matthew Hurst
ftp://ftp.cogsci.ed.ac.uk/pub/matth/snlp95.ps
Add To MetaCart
Abstract:
This paper looks at some of the space and time issues faced in implementing feature structures for natural language parsers. The design of a space and time efficient graph representation is presented as well as an evaluation of it performance. 1
Citations
| 508 | An Efficient Context-Free Parsing Algorithm – Earley - 1970 |
| 364 | An Introduction to Unification-based Approaches to Grammar – Shieber - 1986 |
| 115 | Algorithm schemata and data structures in syntactic processing. CSL80-12, Xerox Corporation – Kay - 1980 |
| 65 | ProFIT: Prolog with features, inheritance and templates – Erbach - 1995 |
| 31 | A Structure-sharing representation for unificationbased grammar formalisms – Pereira - 1985 |
| 18 | Towards robust PATR – Douglas, Dale - 1992 |
| 12 | Structure sharing with binary trees – Karttunen, Kay - 1985 |
| 10 | Specifying logic programs in controlled natural language – Fuchs, Schwitter - 1994 |
| 5 | Logarithmic access arrays for prolog. Unpublished program – Warren - 1983 |
| 2 | Parsing for targetted errors in controlled languages – Hurst - 1995 |
| 1 | English: A guide for the preparation of aircraft maintenance documentation – Simplified - 1989 |
