In our scheme, the RS segment whose first word is closest to X is labeled "A"; the second-closest segment is labeled "B", etc.
segments are labeled in order of the (Koehn, 2004) penalty; the "A" segment gets the lowest penalty.