Efficient Sentence Retrieval Based on Syntactic Structure

This paper proposes an efficient method of sentence retrieval based on syntactic structure. Collins proposed Tree Kernel to calculate structural similarity. However, structual retrieval based on Tree Kernel is not practicable because the size of the index table by Tree Kernel becomes impractical. We propose more efficient algorithms approximating Tree Kernel: Tree Overlapping and Subpath Set. These algorithms are more efficient than Tree Kernel because indexing is possible with practical computation resources. The results of the experiments comparing these three algorithms showed that structural retrieval with Tree Overlapping and Subpath Set were faster than that with Tree Kernel by 100 times and 1,000 times respectively.

• Type: Conference
• Year: 2006
• Where: ACL
• Authors: Hiroshi Ichikawa, Keita Hakoda, Taiichi Hashimoto, Takenobu Tokunaga
• Keywords: ACL 2006, ACL 2007, Collins Proposed Tree, Tree Kernel, Tree Overlapping