Measuring Tree Similarity for Natural Language Processing Based Information Retrieval
- Cite this paper as:
- Lin Z., Wang H., McClean S. (2010) Measuring Tree Similarity for Natural Language Processing Based Information Retrieval. In: Hopfe C.J., Rezgui Y., Métais E., Preece A., Li H. (eds) Natural Language Processing and Information Systems. NLDB 2010. Lecture Notes in Computer Science, vol 6177. Springer, Berlin, Heidelberg
Natural language processing based information retrieval (NIR) aims to go beyond the conventional bag-of-words based information retrieval (KIR) by considering syntactic and even semantic information in documents. NIR is a conceptually appealing approach to IR, but is hard due to the need to measure distance/similarity between structures. We aim to move beyond the state of the art in measuring structure similarity for NIR.
In this paper, a novel tree similarity measurement dtwAcs is proposed in terms of a novel interpretation of trees as multi dimensional sequences. We calculate the distance between trees by the way of computing the distance between multi dimensional sequences, which is conducted by integrating the all common subsequences into the dynamic time warping method. Experimental result shows that dtwAcs outperforms the state of the art.
Unable to display preview. Download preview PDF.