SciELO - Scientific Electronic Library Online

 
vol.6 número3Filtros Robustos RM-KNN con Diferentes Funciones de Influencia para Supresión de Ruido Impulsivo en Imágenes Digitales índice de autoresíndice de materiabúsqueda de artículos
Home Pagelista alfabética de revistas  

Servicios Personalizados

Artículo

Indicadores

Links relacionados

  • No hay artículos similaresSimilares en SciELO

Compartir


Computación y Sistemas

versión impresa ISSN 1405-5546

Resumen

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.

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

        · resumen en Español     · texto en Inglés     · pdf en Inglés