IDEAS home Printed from https://ideas.repec.org/a/wsi/nmncxx/v04y2008i01ns1793005708000970.html
   My bibliography  Save this article

USING GRAPHEMEn-GRAMS IN SPELLING CORRECTION AND AUGMENTATIVE TYPING SYSTEMS

Author

Listed:
  • ALKET MEMUSHAJ

    (School of Engineering, University of Bridgeport, Connecticut, USA)

  • TAREK M. SOBH

    (School of Engineering, University of Bridgeport, Connecticut, USA)

Abstract

Probabilistic language models have gained popularity in Natural Language Processing due to their ability to successfully capture language structures and constraints with computational efficiency. Probabilistic language models are flexible and easily adapted to language changes over time as well as to some new languages. Probabilistic language models can be trained and their accuracy strongly related to the availability of large text corpora.In this paper, we investigate the usability of grapheme probabilistic models, specifically graphemen-grams models in spellchecking as well as augmentative typing systems. Graphemen-gram models require substantially smaller training corpora and that is one of the main drivers for this thesis in which we build graphemen-gram language models for the Albanian language. There are presently no available Albanian language corpora to be used for probabilistic language modeling.Our technique attempts to augment spellchecking and typing systems by utilizing graphemen-gram language models in improving suggestion accuracy in spellchecking and augmentative typing systems. Our technique can be implemented in a standalone tool or incorporated in another tool to offer additional selection/scoring criteria.

Suggested Citation

  • Alket Memushaj & Tarek M. Sobh, 2008. "USING GRAPHEMEn-GRAMS IN SPELLING CORRECTION AND AUGMENTATIVE TYPING SYSTEMS," New Mathematics and Natural Computation (NMNC), World Scientific Publishing Co. Pte. Ltd., vol. 4(01), pages 87-106.
    • Handle: RePEc:wsi:nmncxx:v:04:y:2008:i:01:n:s1793005708000970
    DOI: 10.1142/S1793005708000970
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S1793005708000970
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S1793005708000970?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:wsi:nmncxx:v:04:y:2008:i:01:n:s1793005708000970. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/nmnc/nmnc.shtml .

    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.