DocumentCode :
3179543
Title :
AEDA: Arabic edit distance algorithm Towards a new approach for Arabic name matching
Author :
Abdel Ghafour, Hesham H. ; El-Bastawissy, A. ; Heggazy, Abdel Fattah A
Author_Institution :
Coll. of Comput. & Inf. Technol., Arab Acad. for Sci., Technol., & Maritime Transp., Cairo, Egypt
fYear :
2011
fDate :
Nov. 29 2011-Dec. 1 2011
Firstpage :
307
Lastpage :
311
Abstract :
String matching algorithms play a vital & crucial role in many applications such as search engines, object identification, hand written recognition, name searching in large databases, data cleansing, and automatic spell checking. Many algorithms have been developed to measure string similarity but most of them designed mainly to handle Latin-based languages. In this paper, we propose a new algorithm for Arabic string matching which takes into consideration the unique features of the Arabic language and the different similarity levels of the Arabic letters such as phonetic similarity and character form similarity in addition to keyboard distance.
Keywords :
natural language processing; string matching; AEDA; Arabic edit distance algorithm; Arabic language; Arabic letters; Arabic name matching; Latin-based languages; automatic spell checking; character form similarity; data cleansing; hand written recognition; keyboard distance; name searching; object identification; phonetic similarity; search engines; string matching algorithms; Biological information theory; Cleaning; Indexes; Keyboards; Object recognition; TV; Arabic Character Recognition; Arabic Edit Distance; Arabic Name Matching; Arabic Spell Checking; Dynamic Programming; Levenshtein Algorithm; String Similarity;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Engineering & Systems (ICCES), 2011 International Conference on
Conference_Location :
Cairo
Print_ISBN :
978-1-4577-0127-6
Type :
conf
DOI :
10.1109/ICCES.2011.6141061
Filename :
6141061
Link To Document :
بازگشت