Please use this identifier to cite or link to this item: http://hdl.handle.net/20.500.11861/7636
DC FieldValueLanguage
dc.contributor.authorLeung, Ka Kiten_US
dc.contributor.authorLee, Kin Hongen_US
dc.contributor.authorProf. LEUNG Kwong Saken_US
dc.date.accessioned2023-03-28T04:56:56Z-
dc.date.available2023-03-28T04:56:56Z-
dc.date.issued2003-
dc.identifier.citationProceedings of the International Conference on Information and Knowledge Engineering, 2003, Vol. 1, pp. 11 - 16en_US
dc.identifier.isbn1932415076-
dc.identifier.isbn978-193241507-0-
dc.identifier.urihttp://hdl.handle.net/20.500.11861/7636-
dc.description.abstractThis 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.en_US
dc.language.isoenen_US
dc.publisherCSREA Pressen_US
dc.relation.ispartofProceedings of the International Conference on Information and Knowledge Engineeringen_US
dc.titleAdaptive algorithm in glossary searchen_US
dc.typeConference Proceedingsen_US
item.fulltextNo Fulltext-
crisitem.author.deptDepartment of Applied Data Science-
Appears in Collections:Publication
Show simple item record

Page view(s)

21
checked on Jan 3, 2024

Google ScholarTM

Impact Indices

PlumX

Metrics


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.