Algorithms of constructing computer dictionary of Russian literal paronyms and its application
The work is devoted to development and application of a computer dictionary that comprises Russian one-letter paronyms, i.e. words that differ in one letter and can be obtained from each other by omission or insertion of a letter, replacing of a letter by another one or permutation of two adjacent letters (for example, Rus. words: vremja - bremja, otpechtat - opechatat ). The dictionary is developed for computer-aided correction of occasional errors (so called malapropisms) occurred in texts. Errors of this type replace one content word by a similar content word with quite different meaning, thus violating the original meaning of the utterance. Paronyms of the developed dictionary are used as variants for correcting one-letter-wrong words, so that changing the context of an erroneous word while correcting it is not required. Due to the latter requirement the concept of literal paronyms is refined by taking into account splitting of complete morphological paradigms and the property of their parallelism. Morphological paradigms of two lexemes are parallel, given that an elementary editing operation (one-letter deletion, insertion, replacement, interchange) exists, transforming each wordform of the first lexeme to the corresponding wordform of the second lexeme. The paper describes the process of development of the one-letter paronyms dictionary, as well as main steps of algorithms that produce correction variants for erroneous words based on the dictionary, both for the cases of complete and incomplete morphological paradigms parallelism for the word under correction and its poronym. The statistics of dictionary content is presented, the total dictionary volume is 70,000 vocables, in average three paronyms per a vocable.