Paper: Logic Compression Of Dictionaries For Multilingual Spelling Checkers

ACL ID C94-1047
Title Logic Compression Of Dictionaries For Multilingual Spelling Checkers
Venue International Conference on Computational Linguistics
Session Main Conference
Year 1994
  • Boubaker Meddeb-Hamrouni (Institute of Information and Applied Mathematics Grenoble, Grenoble France; University of Grenoble 1, Grenoble France; CNRS, France; WinSoft S.A., Grenoble France)

To provide practical spelling checkers on micro-com- puters, good compression algorithms,'~'c essenlial. CutTeut techniques used to compress lexicons for indo-Fmropean languages provide efficient spelling checker. Applying the.~une methods to languages which have a different morpho- logical system (Arabic, Turkish,)... gives insufficient re- suits. To get better results, we apply other "logical" com- pression mechanisms based on tile structure of the lan- guage itself. Experiments with muir)lingual dictionaries show a significant reduction rate attributable to our logic compression alone and even better resnlls when using our method in conjunction with existing methods. KEY WORDS: Spelling checkers, Multilinguism, Compression, Dictionary, Finite-state machines.