| W06-0118 | maximum matching algorithm is a | greedy segmentation | approach . It proceeds through |
| D14-1117 | benefit of collective inference over | greedy segmentation | followed by evaluation . Collective |
| W11-0304 | 4.5 Extending to Beam Search The | greedy segmentation | proposed is limited in its ability |
| C04-1152 | efficient incremental algorithm for | greedy segmentation | of all words in the corpus , |
| P04-1024 | romanji characters . Note that a | greedy segmentation | method , such as the left-to-right |
| W11-0304 | hypotheses in a fashion similar to the | greedy segmentation | , but using a function based |
| S15-2107 | characters to lowercase and then use a | greedy segmentation | algorithm which scans the hashtag |
| D14-1117 | argument . 5.7 Collective vs. | greedy segmentation | To judge the quality of interpretations |
| P14-2090 | sections , we propose 2 Algorithm 1 | Greedy segmentation | search S * ← ∅ fork |
| E12-3008 | but artefacts of the somewhat | greedy segmentation | procedure I used . Alternative |
