SciELO - Scientific Electronic Library Online

 
vol.6 issue3Robust RM-KNN Filters with Different Influence Functions for Removal of Impulsive Noise in Digital Images author indexsubject indexsearch form
Home Pagealphabetic serial listing  

Services on Demand

Journal

Article

Indicators

Related links

  • Have no similar articlesSimilars in SciELO

Share


Computación y Sistemas

Print version ISSN 1405-5546

Abstract

GELBUKH, Alexander. Exact and Approximate Prefix Search under Access Locality Requirements for Morphological Analysis and Spelling Correction. Comp. y Sist. [online]. 2003, vol.6, n.3, pp.167-182. ISSN 1405-5546.

A data structure useful for prefix search in a very large dictionary with an unlimited query string is discussed. This problem is important for morphological analysis of inflective languages, including particularly difficult cases such as German word concatenation or Japanese writing system that does not use spaces; similar tasks arise in DNA computing. The data structure is optimized for locality of access: to find all necessary records, access to only one block (page) of the main data storage is guaranteed, which significantly improves performance. To illustrate its usefulness, the algorithms of exact and approximate search are described, with application to morphological analysis and spelling correction. The algorithms for building, exporting, and updating the data structure are explained.

Keywords : prefix search; approximate prefix search; approximate string matching; morphological analysis; spelling correction; natural language processing; DNA computing.

        · abstract in Spanish     · text in English     · English ( pdf )

 

Creative Commons License All the contents of this journal, except where otherwise noted, is licensed under a Creative Commons Attribution License