tech,0-1-C90-3072,bq |
The results of the experiment show that in most of the cases the
<term>
cooccurrence statistics
</term>
indeed reflect the
<term>
semantic constraints
</term>
and thus provide a basis for a useful
<term>
disambiguation tool
</term>
.
<term>
Spelling-checkers
</term>
have become an integral part of most
<term>
text processing software
</term>
.
|
#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. |
tech,8-1-C90-3072,bq |
<term>
Spelling-checkers
</term>
have become an integral part of most
<term>
text processing software
</term>
.
|
#16730
Spelling-checkers have become an integral part of mosttext processing software. |
lr,15-2-C90-3072,bq |
From different reasons among which the speed of processing prevails they are usually based on
<term>
dictionaries of word forms
</term>
instead of
<term>
words
</term>
.
|
#16749
From different reasons among which the speed of processing prevails they are usually based ondictionaries of word forms instead of words. |
lr,21-2-C90-3072,bq |
From different reasons among which the speed of processing prevails they are usually based on
<term>
dictionaries of word forms
</term>
instead of
<term>
words
</term>
.
|
#16755
From different reasons among which the speed of processing prevails they are usually based on dictionaries of word forms instead ofwords. |
other,8-3-C90-3072,bq |
This approach is sufficient for languages with little
<term>
inflection
</term>
such as
<term>
English
</term>
, but fails for
<term>
highly inflective languages
</term>
such as
<term>
Czech
</term>
,
<term>
Russian
</term>
,
<term>
Slovak
</term>
or other
<term>
Slavonic languages
</term>
.
|
#16765
This approach is sufficient for languages with littleinflection such as English, but fails for highly inflective languages such as Czech, Russian, Slovak or other Slavonic languages. |
other,11-3-C90-3072,bq |
This approach is sufficient for languages with little
<term>
inflection
</term>
such as
<term>
English
</term>
, but fails for
<term>
highly inflective languages
</term>
such as
<term>
Czech
</term>
,
<term>
Russian
</term>
,
<term>
Slovak
</term>
or other
<term>
Slavonic languages
</term>
.
|
#16768
This approach is sufficient for languages with little inflection such asEnglish, but fails for highly inflective languages such as Czech, Russian, Slovak or other Slavonic languages. |
other,16-3-C90-3072,bq |
This approach is sufficient for languages with little
<term>
inflection
</term>
such as
<term>
English
</term>
, but fails for
<term>
highly inflective languages
</term>
such as
<term>
Czech
</term>
,
<term>
Russian
</term>
,
<term>
Slovak
</term>
or other
<term>
Slavonic languages
</term>
.
|
#16773
This approach is sufficient for languages with little inflection such as English, but fails forhighly inflective languages such as Czech, Russian, Slovak or other Slavonic languages. |
other,23-3-C90-3072,bq |
This approach is sufficient for languages with little
<term>
inflection
</term>
such as
<term>
English
</term>
, but fails for
<term>
highly inflective languages
</term>
such as
<term>
Czech
</term>
,
<term>
Russian
</term>
,
<term>
Slovak
</term>
or other
<term>
Slavonic languages
</term>
.
|
#16780
This approach is sufficient for languages with little inflection such as English, but fails for highly inflective languages such as Czech,Russian, Slovak or other Slavonic languages. |
other,25-3-C90-3072,bq |
This approach is sufficient for languages with little
<term>
inflection
</term>
such as
<term>
English
</term>
, but fails for
<term>
highly inflective languages
</term>
such as
<term>
Czech
</term>
,
<term>
Russian
</term>
,
<term>
Slovak
</term>
or other
<term>
Slavonic languages
</term>
.
|
#16782
This approach is sufficient for languages with little inflection such as English, but fails for highly inflective languages such as Czech, Russian,Slovak or other Slavonic languages. |
other,28-3-C90-3072,bq |
This approach is sufficient for languages with little
<term>
inflection
</term>
such as
<term>
English
</term>
, but fails for
<term>
highly inflective languages
</term>
such as
<term>
Czech
</term>
,
<term>
Russian
</term>
,
<term>
Slovak
</term>
or other
<term>
Slavonic languages
</term>
.
|
#16785
This approach is sufficient for languages with little inflection such as English, but fails for highly inflective languages such as Czech, Russian, Slovak or otherSlavonic languages. |
other,8-4-C90-3072,bq |
We have developed a special method for describing
<term>
inflection
</term>
for the purpose of building
<term>
spelling-checkers
</term>
for such languages .
|
#16796
We have developed a special method for describinginflection for the purpose of building spelling-checkers for such languages. |
tech,14-4-C90-3072,bq |
We have developed a special method for describing
<term>
inflection
</term>
for the purpose of building
<term>
spelling-checkers
</term>
for such languages .
|
#16802
We have developed a special method for describing inflection for the purpose of buildingspelling-checkers for such languages. |
tech,16-5-C90-3072,bq |
The speed of the resulting program lies somewhere in the middle of the scale of existing
<term>
spelling-checkers
</term>
for
<term>
English
</term>
and the main
<term>
dictionary
</term>
fits into the standard
<term>
360K floppy
</term>
, whereas the number of recognized
<term>
word forms
</term>
exceeds 6 million ( for
<term>
Czech
</term>
) .
|
#16823
The speed of the resulting program lies somewhere in the middle of the scale of existingspelling-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). |
other,18-5-C90-3072,bq |
The speed of the resulting program lies somewhere in the middle of the scale of existing
<term>
spelling-checkers
</term>
for
<term>
English
</term>
and the main
<term>
dictionary
</term>
fits into the standard
<term>
360K floppy
</term>
, whereas the number of recognized
<term>
word forms
</term>
exceeds 6 million ( for
<term>
Czech
</term>
) .
|
#16825
The speed of the resulting program lies somewhere in the middle of the scale of existing spelling-checkers forEnglish and the main dictionary fits into the standard 360K floppy, whereas the number of recognized word forms exceeds 6 million (for Czech). |
lr,22-5-C90-3072,bq |
The speed of the resulting program lies somewhere in the middle of the scale of existing
<term>
spelling-checkers
</term>
for
<term>
English
</term>
and the main
<term>
dictionary
</term>
fits into the standard
<term>
360K floppy
</term>
, whereas the number of recognized
<term>
word forms
</term>
exceeds 6 million ( for
<term>
Czech
</term>
) .
|
#16829
The speed of the resulting program lies somewhere in the middle of the scale of existing spelling-checkers for English and the maindictionary fits into the standard 360K floppy, whereas the number of recognized word forms exceeds 6 million (for Czech). |
other,27-5-C90-3072,bq |
The speed of the resulting program lies somewhere in the middle of the scale of existing
<term>
spelling-checkers
</term>
for
<term>
English
</term>
and the main
<term>
dictionary
</term>
fits into the standard
<term>
360K floppy
</term>
, whereas the number of recognized
<term>
word forms
</term>
exceeds 6 million ( for
<term>
Czech
</term>
) .
|
#16834
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 standard360K floppy, whereas the number of recognized word forms exceeds 6 million (for Czech). |
other,35-5-C90-3072,bq |
The speed of the resulting program lies somewhere in the middle of the scale of existing
<term>
spelling-checkers
</term>
for
<term>
English
</term>
and the main
<term>
dictionary
</term>
fits into the standard
<term>
360K floppy
</term>
, whereas the number of recognized
<term>
word forms
</term>
exceeds 6 million ( for
<term>
Czech
</term>
) .
|
#16842
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 recognizedword forms exceeds 6 million (for Czech). |
tech,10-6-C90-3072,bq |
Further , a special method has been developed for easy
<term>
word classification
</term>
.
|
#16862
Further, a special method has been developed for easyword classification. |