APPROXIMATE STRING MATCHING TECHNIQUES

Peng, T., Mackay, C. (2014). APPROXIMATE STRING MATCHING TECHNIQUES. In: (Ed.) Proceedings of 16th International Conference on Enterprise INformation Systems, , () ( ed.). (pp. ). Lisbon, Portugal: . Scitepress.


ISBN:
ISSN:

Abstract

Data quality is a key to success for all kinds of businesses that have information applications involved, such as data integration for data warehouses, text and web mining, information retrieval, search engine for web applications, etc. In such applications, matching strings is one of the popular tasks. There are a number of approximate string matching techniques available. However, there is still a problem that remains unanswered: for a given dataset, how to select an appropriate technique and a threshold value required by this technique for the purpose of string matching. To challenge this problem, this paper analyses and evaluates a set of popular token-based string matching techniques on several carefully designed different datasets. A thorough experimental comparison confirms the statement that there is no clear overall best technique. However, some techniques do perform significantly better in some cases. Some suggestions have been presented, which can be used as guidance for researchers and practitioners to select an appropriate string matching technique and a corresponding threshold value for a given dataset.
[Read More]

Authors

Taoxin Peng
Lecturer
t.peng@napier.ac.uk
+44 131 455 2748

Areas of Expertise

Associated Projects