The logic of typed feature structures
The logic of typed feature structures
Experiments with discrimination-tree indexing and path indexing for term retrieval
Journal of Automated Reasoning
XRel: a path-based approach to storage and retrieval of XML documents using relational databases
ACM Transactions on Internet Technology (TOIT)
Handbook of automated reasoning
Building a large annotated corpus of English: the penn treebank
Computational Linguistics - Special issue on using large corpora: II
Efficient feature structure operations without compilation
Natural Language Engineering
A bag of useful techniques for efficient and robust parsing
ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
Indexing methods for efficient parsing
NAACLstudent '03 Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology: Proceedings of the HLT-NAACL 2003 student research workshop - Volume 3
A tabulation-based parsing method that reduces copying
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
On two classes of feature paths in large-scale unification grammars
New developments in parsing technology
A persistent feature-object database for intelligent text archive systems
IJCNLP'04 Proceedings of the First international joint conference on Natural Language Processing
| Hi-index | 0.00 |
This paper describes an indexing substrate for typed feature structures (ISTFS), which is an efficient retrieval engine for typed feature structures. Given a set of typed feature structures, the ISTFS efficiently retrieves its subset whose elements are unifiable or in a subsumption relation with a query feature structure. The efficiency of the ISTFS is achieved by calculating a unifiability checking table prior to retrieval and finding the best index paths dynamically.