| W03-1724 | bias to favor longer words than | maximal matching | segmentation . For the bakeoff |
| C92-1019 | statistical data supports that the | maximal matching | algorithm is the most effective |
| W05-1301 | and candidate mentions . Only | maximal matching | strings were used -- i.e. sub-strings |
| W10-3018 | tagging keywords is solved by | maximal matching | strategy . It is curious that |
| I05-3029 | through a process of Backward | Maximal Matching | ( BMM ) segmentation equipped |
| S15-2113 | relevant at this point is the | maximal matching | segmentation . The segmentation |
| I05-3021 | differs remarkably from the previous | maximal matching | approaches : it matches pre-segmented |
| W04-2406 | Research , or determining the | maximal matching | of a bipartite graph in Graph |
| M95-1018 | metric value , an d selected the | maximal matching | Egraph that exceeded the similarity |
| P93-1015 | problem now is to find the largest | maximal matching | ( or assignment ) that has the |
| N04-3008 | Operations Research and finding the | maximal matching | of a bipartite graph . Figure |
| N03-3004 | Research , and determining the | maximal matching | of a bipartite graph . Figure |
| W10-3213 | approach where the principle of | maximal matching | algorithm is applied to the input |
| J97-4004 | few variations of the sense of | maximal matching | . " Hence , many variations have |
| W10-3213 | the collection of lexicon , the | maximal matching | algorithm selects the segmentation |
| N03-2035 | However , simple algorithms such as | maximal matching | -LSB- 6 , 9 -RSB- and longest |
| I05-3021 | disambiguation module to polish its | maximal matching | output . However , this is not |
| I05-3029 | segmentation mechanism based on | maximal matching | , and other supplementary features |
| I05-3021 | optimization criterion , we have a | maximal matching | approach to word seg - mentation |
| P00-1078 | segmentation , the longest matching , | maximal matching | and probabilistic segmentation |
