Dynamic programming matching for large scale information retrieval

Authors:
Eiko Yamamoto;Masahiro Kishida;Yoshinori Takenami;Yoshiyuki Takeda;Kyoji Umemura
Affiliations:
Communications Research Laboratory, Kyoto Japan;Sumitomo Electric Information Systems Co., Ltd., Osaka Japan;Sumitomo Electric Information Systems Co., Ltd., Osaka Japan;Toyohashi University of Technology, Aichi Japan;Toyohashi University of Technology, Aichi Japan
Venue:
AsianIR '03 Proceedings of the sixth international workshop on Information retrieval with Asian languages - Volume 11
Year:
2003

Citing 6
Cited 2

Suffix arrays: a new method for on-line string searches

SIAM Journal on Computing
An extension of Ukkonen's enhanced dynamic programming ASM algorithm

ACM Transactions on Information Systems (TOIS)
Overlapping statistical word indexing: a new indexing method for Japanese text

Proceedings of the 20th annual international ACM SIGIR conference on Research and development in information retrieval
Information storage and retrieval

Information storage and retrieval
Dynamic programming: a method for taking advantage of technical terminology in Japanese documents

IRAL '00 Proceedings of the fifth international workshop on on Information retrieval with Asian languages
A comparison of melodic database retrieval techniques using sung queries

Proceedings of the 2nd ACM/IEEE-CS joint conference on Digital libraries

Experiments in CLIR using fuzzy string search based on surface similarity

Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval
An error measure for japanese morphological analysis using similarity measures

KES'05 Proceedings of the 9th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

Though dynamic programming matching can carry out approximate string matching when there may be deletions or insertions in a document, its effectiveness and efficiency are usually too poor to use it for large-scale information retrieval. In this paper, we propose a method of dynamic programming matching for information retrieval. This method is as effective as a conventional information retrieval system, even though it is capable of approximate matching. It is also as efficient as a conventional system.