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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
