 Word‐oriented approximate string matching using occurrence heuristic tables: A heuristic for searching Arabic textSuleiman H. Mustafa Journal of the American Society for Information Science and Technology, 2005, vol. 56, issue 14, 1504-1511 Abstract: In this article, a word‐oriented approximate string matching approach for searching Arabic text is presented. The distance between a pair of words is determined on the basis of aligning the two words by using occurrence heuristic tables. Two words are considered related if they have the same morphological or lexical basis. The heuristic reports an approximate match if common letters agree in order and noncommon letters represent valid affixes. The heuristic was tested by using four different alignment strategies: forward, backward, combined forward–backward, and combined backward– forward. Using the error rate and missing rate as performance indicators, the approach was successful in providing more than 80% correct matches. Within the conditions of the experiments performed, the results indicated that the combined forward–backward strategy seemed to exhibit the best performance. Most of the errors were caused by multiple‐letter occurrences and by the presence of weak letters in cases in which the shared core consisted of one or two letters. Date: 2005 Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:bla:jamist:v:56:y:2005:i:14:p:1504-1511 Ordering information: This journal article can be ordered from Access Statistics for this article More articles in Journal of the American Society for Information Science and Technology from Association for Information Science & Technology |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.