C96-2136 |
satisfactory \ -LSB- ` or an interactive
|
spelling corrector
|
. For example , when the accuracy
|
A88-1013 |
the abbreviation detector , the
|
spelling corrector
|
only treats words which consist
|
A92-1015 |
the internal word list of the
|
spelling corrector
|
. Other words that do not appear
|
A92-1015 |
this way a parser can help the
|
spelling corrector
|
to reduce the set of correction
|
A92-1015 |
cooperated very well with the
|
spelling corrector
|
( 6 correct guesses , 2 wrong
|
A92-1015 |
describing here . Ideally , a
|
spelling corrector
|
should come up with one ( correct
|
A92-1015 |
the internal word list of the
|
spelling corrector
|
. The main disadvantage of this
|
C88-1034 |
detected . The parser can recall the
|
spelling corrector
|
, if need be , . Then , knowledge
|
A92-1015 |
The parser interacts with the
|
spelling corrector
|
and handles certain types of
|
A92-1015 |
Augmented Context-free Grammars . The
|
spelling corrector
|
is based on trigram and triphone
|
E12-1054 |
the failed attempt of automatic
|
spelling correctors
|
to correct a misspelled word
|
C88-1034 |
processing the parse tree . The
|
spelling corrector
|
module is designed to help correct
|
A92-1047 |
for efficient access . When the
|
spelling corrector
|
is called to suggest possible
|
A88-1013 |
Correction The interaction of the
|
spelling corrector
|
with the morphological analyzer
|
C96-2131 |
the syntactic level , just as a
|
spelling corrector
|
is helpless if a word is transformed
|
E87-1033 |
Some of the modules , such as the
|
spelling corrector
|
, the robusteness component ,
|
A92-1015 |
correct spelling obtained from the
|
spelling corrector
|
. Word lattices can of course
|
E83-1032 |
a pretreatment in a so called
|
spelling corrector
|
. If all the words used in the
|
A83-1002 |
. The analyzer contains a good
|
spelling corrector
|
and a good morphology algorithm
|
D14-1102 |
preceded by has , have , or had . The
|
spelling corrector
|
uses Jazzy , an open source Java
|