DocumentCode
2757532
Title
Extended approximate string matching algorithms to detect name aliases
Author
Shaikh, Muniba ; Memon, Nasrullah ; Wiil, Uffe Koek
Author_Institution
Maersk Mc-Kinney Moller Inst., Univ. of Southern Denmark, Odense, Denmark
fYear
2011
fDate
10-12 July 2011
Firstpage
216
Lastpage
219
Abstract
This paper focuses on the problem of alias detection based on orthographic variations of Arabic names. Alias detection is the process to identify different variants of the same name. To detect aliases based on orthographic variations, the approximate string matching (ASM) algorithms are widely used that measure the similarities between two strings (i.e., the name and alias). ASM algorithms work well to detect various type of orthographic variations but still there is a need to develop techniques to detect correct aliases of Arabic names that occur due to the translation of Arabic names into English. An extension to widely used ASM algorithms is proposed to detect the name aliases that generate as a result of transliteration. This paper aims to improve the accuracy of the basic ASM algorithms in order to detect correct aliases. The experimental evaluation shows that proposed extension increases the accuracy of the basic algorithms to a considerable level.
Keywords
natural language processing; security of data; string matching; ASM algorithms; Arabic names; alias detection; approximate string matching algorithms; experimental evaluation; name aliases detection; orthographic variations; transliteration; Semantics; ASM algorithm; Orthographic Variations; Transliteration; Typographic Variations;
fLanguage
English
Publisher
ieee
Conference_Titel
Intelligence and Security Informatics (ISI), 2011 IEEE International Conference on
Conference_Location
Beijing
Print_ISBN
978-1-4577-0082-8
Type
conf
DOI
10.1109/ISI.2011.5984085
Filename
5984085
Link To Document