An indexing scheme for typed feature structures
説明
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.
収録刊行物
-
- Proceedings of the 19th international conference on Computational linguistics -
-
Proceedings of the 19th international conference on Computational linguistics - 2 1-5, 2002-01-01
Association for Computational Linguistics (ACL)
