W03-1306 | matching algorithm was used for | candidate recognition | . The results are shown in Table |
W03-1306 | string searching algorithm for | candidate recognition | . Section 3 describes how to |
W03-1306 | way to exploit a dictionary for | candidate recognition | is the exact ( longest ) match |
W03-1306 | the details of each phase . 3 | Candidate Recognition | The most straightforward way |
W13-3608 | subsections we introduce our correction | candidate recognition | procedure and the features used |