| tech,0-1-C90-3072,bq | <term> disambiguation tool </term> . <term> | Spelling-checkers | </term> have become an integral part of | #16722 The results of the experiment show that in most of the cases the cooccurrence statistics indeed reflect the semantic constraints and thus provide a basis for a useful disambiguation tool. Spelling-checkers have become an integral part of most text processing software. |
| lr,21-2-C90-3072,bq | dictionaries of word forms </term> instead of <term> | words | </term> . This approach is sufficient for | #16755 From different reasons among which the speed of processing prevails they are usually based on dictionaries of word forms instead of words . |
| tech,14-4-C90-3072,bq | </term> for the purpose of building <term> | spelling-checkers | </term> for such languages . The speed of | #16802 We have developed a special method for describing inflection for the purpose of building spelling-checkers for such languages. |
| tech,16-5-C90-3072,bq | the middle of the scale of existing <term> | spelling-checkers | </term> for <term> English </term> and the main | #16823 The speed of the resulting program lies somewhere in the middle of the scale of existing spelling-checkers for English and the main dictionary fits into the standard 360K floppy, whereas the number of recognized word forms exceeds 6 million (for Czech). |
