Options
Adaptive algorithm in glossary search
Author(s)
Date Issued
2003
Publisher
CSREA Press
ISBN
1932415076
978-193241507-0
Citation
Proceedings of the International Conference on Information and Knowledge Engineering, 2003, Vol. 1, pp. 11 - 16
Type
Conference Proceedings
Abstract
This paper deals with algorithm to curtail the computation time of approximate string matching by dynamic programming. We formulate the user requirement for eligible matches as inequality solving problem. The pith can be divided into two parts. First, the record is examined if has potential to fulfill the requirement before infiltrating into a time-consuming search. Then, only the region which can lead to the calculated similarity score is explored. This strategy shows a several fold speedup in a common glossary database.
Loading...
Availability at HKSYU Library
