Adaptive algorithm in glossary search

被引：0

作者：

Leung, KK ^{[1
]}

Lee, KH ^{[1
]}

Leung, KS ^{[1
]}

机构：

[1] Chinese Univ Hong Kong, Dept Comp Sci & Engn, Hong Kong, Hong Kong, Peoples R China

来源：

IKE'03: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON INFORMATION AND KNOWLEDGE ENGINEERING, VOLS 1 AND 2 | 2003年

关键词：

dynamic programming; string matching; adaptive; glossaries;

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

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.

引用

页码：11 / 16

页数：6