How Is the Best Match Selected?
When faced with the choice of the best match, that is to say, when several candidate matches overlap, the following criteria are used:
The shortest match in terms of token is preferred. For example, searching for A
NEAR B
in the text A A B B
selects A [A B]
B
.
The greater the sum of the lengths of element annotations the better. For example, if more
than one annotation A
appear on a token, the longest is chosen.