| W97-0303 | first setting , MDP 1 , is Minimum | Distance Parsing | with maximum deviation penalty |
| W97-0303 | best analysis . Thus , Minimum | Distance Parsing | appears to be a reasonable approach |
| W06-2937 | identification rate of the longer | distance parsing | should be lower than the smaller |
| W97-0303 | In practice , however , Minimum | Distance Parsing | has only been used successfully |
| W97-0303 | argue that even though Minimum | Distance Parsing | offers a theoretically attractive |
| W97-0303 | independence that the minimum | distance parsing | approach has while avoiding some |
| P98-2185 | more efficient than the minimum | distance parsing | approach ( Rose and Lavie , 1997 |
| J95-3001 | Meanings output by the minimum | distance parsing | algorithm ( described be - low |
| A92-1002 | break the tie . The minimum - | distance parsing | algorithm is very robust -- it |
| A92-1002 | greater detail below . 4.2 Minimum | distance parsing | A challenging design problem |
| P98-2185 | 1995 ) , or relied on the minimum | distance parsing | approach ( Hipp , 1992 ; Smith |
| W97-0303 | Waibel Abstract Although Minimum | Distance Parsing | ( MDP ) offers a theoretically |
