| C80-1038 | candidates which were selected by the | word analysis | function . The syntax analysis |
| J89-1003 | clause is the operator < . ) A | word analysis | consists of subterms called analysis |
| C80-1038 | next syntax analysis step . This | word analysis | program is not valid for consecutive |
| E85-1033 | about standard inflexions ) as | word analysis | . From a list of word descriptions |
| C80-1038 | Syntax Analysis Function When the | word analysis | is unsatisfactory to resolve |
| E85-1033 | been obtained and graphed after | word analysis | . We show here , in an example |
| C80-1038 | analysis functions ( Fig. 4 ) . a ) | word analysis | function b ) syntax analysis |
| E93-1059 | dictionary look-up processes and new | words analyses | in order to clearly identify |
| E87-1012 | shell ' making possible real time | word analysis | when only stems are stored . |
| C00-1012 | linguistic dimensions beyond single | word analysis | ; this is not unlike the approach |
| C92-1010 | an ahnost . 1000 words/second | word analysis | throughput \ -LSB- 19 \ -RSB- |
| E85-1033 | generation - word generation 4.1 | Word Analysis | The word analyser uses a knowledge |
| C80-1038 | ambiguous letter in a sentence , the | word analysis | program searches the dictionary |
| C80-1038 | has no candidate letter , the | word analysis | program consults the dictionary |
| C90-3046 | reasoning processes , we use the | word analysis | rather than parsing . 2 Underlying |
| A97-1009 | in turn is prefered to unknown | word analysis | . Even though the evaluation |
| E85-1033 | steps of the text processing : - | word analysis | - sentence analysis - reference |
| C80-1038 | analysis program calls the compound | word analysis | subprogram which looks up the |
| C80-1038 | ~ Analysxs ~ Wdegrding II 5.1 | Word Analysis | Function In case of encountering |
| E95-1028 | this context , highly efficient | word analysis | and generation at run-time are |
