Spell checkers can use approximate string matching algorithms such as Levenshtein distance to find correct spellings of misspelled words. It is unclear whether morphological analysis-allowing for many forms of a word depending on its grammatical role-provides a significant benefit for English, though its benefits for highly synthetic languages such as German, Hungarian, or Turkish are clear.Īs an adjunct to these components, the program's user interface allows users to approve or reject replacements and modify the program's operation. For many other languages, such as those featuring agglutination and more complex declension and conjugation, this part of the process is more complicated. Even for a lightly inflected language like English, the spell checker will need to consider different forms of the same word, such as plurals, verbal forms, contractions, and possessives. An additional step is a language-dependent algorithm for handling morphology.This might contain just a list of words, or it might also contain additional information, such as hyphenation points or lexical and grammatical attributes. It then compares each word with a known list of correctly spelled words (i.e.It scans the text and extracts the words contained in it.4 Spell-checking for languages other than EnglishĪ basic spell checker carries out the following processes:.
0 kommentar(er)
