Transition network grammars for natural language analysis
Communications of the ACM
Logic compression of dictionaries for multilingual spelling checkers
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
| Hi-index | 0.00 |
In every application that concerns the automatic processing of natural language, the problem of the dictionary size is posed. In this paper, we propose a compression dictionary algorithm based on an affix analysis of the non diacritical Arabic.It consists in decomposing a word into its first elements taking into account the different linguistic transformations that can affect the morphological structures.This work has been achieved as part of a study of the automatic detection and correction of spelling errors in the non diacritical Arabic texts.