H Abdel Ghafour, HeshamEl-Bastawissy, AliA Heggazy, Abdel Fattah2020-01-292020-01-292011978-1-4577-0128-3https://doi.org/10.1109/ICCES.2011.6141061https://cutt.ly/BrTYowBMSA Google ScholarString 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.enOctober University for University for Arabic Edit DistanceArabic Character RecognitionArabic Spell CheckingArabic Name MatchingDynamic ProgrammingLevenshtein AlgorithmString SimilarityBook chapterhttps://doi.org/10.1109/ICCES.2011.6141061