For more detail, we remove any abbreviations from a KG node (such as "New York (NY)" is changed to "New York"), before finding the first phrase in the sentence that matches the longest prefix of the node.
as illustrated in the slashed blue box of Figure  2, the result contains several labeled arcs, each connecting a word pair (such as "wants" and "boy").