Every resolved pair is searched through the undirected reviewed graph, bounded at 12 edges.
MULTI-WORD EVIDENCE LAB
PAIRWISE LAB ↗THE QUESTION THE GRAPH WAS BUILT TO ANSWER2–8 WORDS
CONNECT
THE WHOLE
FAMILY.
Ask how several words are related. *SET-U computes pairwise shortest paths, then builds a compact spanning forest from cited lexical edges. A shared person or text may bridge islands, but it is never mislabeled as ancestry.
Enter no more than 8 words at once.
03
WHAT THIS VIEW PROVES
COMPACT DOES NOT MEAN CERTAIN
Cited ancestry, borrowing, derivation, and semantic continuation paths are preferred over historical-context bridges.
The shortest available pair paths are greedily selected until each connectable word belongs to one network.
This is a compact evidence view, not a claim that scholarship has one uniquely minimal family tree.