The logic of typed feature structures
The logic of typed feature structures
Abstract interpretation and application to logic programs
Journal of Logic Programming
Term Indexing
Handbook of automated reasoning
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
A tabulation-based parsing method that reduces copying
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
Fundamentals of Database Systems (5th Edition)
Fundamentals of Database Systems (5th Edition)
| Hi-index | 0.00 |
This paper introduces an indexing method based on static analysis of grammar rules and type signatures for typed feature structure grammars (TFSGs). The static analysis tries to predict at compile-time which feature paths will cause unification failure during parsing at run-time. To support the static analysis, we introduce a new classification of the instances of variables used in TFSGs, based on what type of structure sharing they create. The indexing actions that can be performed during parsing are also enumerated. Non-statistical indexing has the advantage of not requiring training, and, as the evaluation using large-scale HPSGs demonstrates, the improvements are comparable with those of statistical optimizations. Such statistical optimizations rely on data collected during training, and their performance does not always compensate for the training costs.