| E14-2013 | approach we take for efficient | sub-string matching | in more detail in section 3.3 |
| W00-1312 | experiments , we relied on a simple | sub-string matching | algorithm to extract words from |
| W02-0307 | all . In contrast , access by | sub-string matching | on individual component terms |
| E14-2013 | the user . Both steps require a | sub-string matching | algorithm which is able to deal |
| C80-1038 | has not only a full-string but a | sub-string matching | ability ( Fig. 5 ) . KEIRYO GENGO |
| A00-1005 | provided in the next section ) . The | sub-string matching | algorithm greatly enhances the |
| P10-4010 | Light et al. , 2004 ) found that | sub-string matching | of 14 pre-defined string literals |
| A00-1005 | received from the user using a | sub-string matching | algorithm that uses character-based |
| A00-1005 | dialogue manager . Therefore , the | sub-string matching | module takes as input a user |
| A00-1005 | the context-based parser uses a | sub-string matching | algorithm that uses character-based |
| A00-1005 | by the context-based parser for | sub-string matching | specially in cases when the DM |
