IDEAS home Printed from https://ideas.repec.org/a/bla/jamist/v56y2005i14p1504-1511.html
   My bibliography  Save this article

Word‐oriented approximate string matching using occurrence heuristic tables: A heuristic for searching Arabic text

Author

Listed:
  • Suleiman H. Mustafa

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.

Suggested Citation

  • Suleiman H. Mustafa, 2005. "Word‐oriented approximate string matching using occurrence heuristic tables: A heuristic for searching Arabic text," Journal of the American Society for Information Science and Technology, Association for Information Science & Technology, vol. 56(14), pages 1504-1511, December.
    • Handle: RePEc:bla:jamist:v:56:y:2005:i:14:p:1504-1511
    DOI: 10.1002/asi.20244
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/asi.20244
    Download Restriction: no
    File URL: https://libkey.io/10.1002/asi.20244?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:bla:jamist:v:56:y:2005:i:14:p:1504-1511. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: http://www.asis.org .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.