A Comparison of Text String Similarity Algorithms for POI Name Harmonisation

Author(s):  
Jiří Kysela
2011 ◽  
Vol 20 (9) ◽  
pp. 2594-2605 ◽  
Author(s):  
Chucai Yi ◽  
YingLi Tian
Keyword(s):  

2016 ◽  
Author(s):  
Timothy Baldwin ◽  
Huizhi Liang ◽  
Bahar Salehi ◽  
Doris Hoogeveen ◽  
Yitong Li ◽  
...  

2013 ◽  
Vol 25 (10) ◽  
pp. 2217-2230 ◽  
Author(s):  
Chuitian Rong ◽  
Wei Lu ◽  
Xiaoli Wang ◽  
Xiaoyong Du ◽  
Yueguo Chen ◽  
...  

Author(s):  
Misturah Adunni Alaran ◽  
AbdulAkeem Adesina Agboola ◽  
Adio Taofiki Akinwale ◽  
Olusegun Folorunso

The reality of human existence and their interactions with various things that surround them reveal that the world is imprecise, incomplete, vague, and even sometimes indeterminate. Neutrosophic logic is the only theory that attempts to unify all previous logics in the same global theoretical framework. Extracting data from a similar environment is becoming a problem as the volume of data keeps growing day-in and day-out. This chapter proposes a new neutrosophic string similarity measure based on the longest common subsequence (LCS) to address uncertainty in string information search. This new method has been compared with four other existing classical string similarity measure using wordlist as data set. The analyses show the performance of proposed neutrosophic similarity measure to be better than the existing in information retrieval task as the evaluation is based on precision, recall, highest false match, lowest true match, and separation.


Author(s):  
Cairong Yan ◽  
Jian Wang ◽  
Bin Zhu ◽  
Wenjing Guo

Author(s):  
Hamid Haidarian Shahri

Entity resolution (also known as duplicate elimination) is an important part of the data cleaning process, especially in data integration and warehousing, where data are gathered from distributed and inconsistent sources. Learnable string similarity measures are an active area of research in the entity resolution problem. Our proposed framework builds upon our earlier work on entity resolution, in which fuzzy rules and membership functions are defined by the user. Here, we exploit neuro-fuzzy modeling for the first time to produce a unique adaptive framework for entity resolution, which automatically learns and adapts to the specific notion of similarity at a meta-level. This framework encompasses many of the previous work on trainable and domain-specific similarity measures. Employing fuzzy inference, it removes the repetitive task of hard-coding a program based on a schema, which is usually required in previous approaches. In addition, our extensible framework is very flexible for the end user. Hence, it can be utilized in the production of an intelligent tool to increase the quality and accuracy of data.


Sign in / Sign up

Export Citation Format

Share Document