| W15-3023 | ℓmax is the highest log | likelihood segmentation | for the current word . This can |
| W14-2803 | probabilities to determine the maximum | likelihood segmentation | as defined by a simple generative |
| H93-1023 | , corresponding to the maximum | likelihood segmentation | . While one could imagine letting |
| H94-1054 | , 1993 \ -RSB- uses a maximum | likelihood segmentation | algorithm which , in essence |
| N10-1107 | models use EM to learn the maximum | likelihood segmentation | into graphones ( Deligne and |
