Figure 1 shows a tournament for the example of "with," where the word "watched" finally wins.
although the proposed model's worst-case time complexity is O(n 2), the experimental results demonstrated an average parsing time not much slower than O(n).