Reviewed dossiers resolved from the request.
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.
Distinct forms in the spanning evidence network.
Distinct cited lexical relationships used.
Distinct bibliographic records supporting this view.
2 EVIDENCE ISLANDS0 lexical branches · 0 context bridges
01
THE SPANNING EVIDENCE FOREST
0 BRANCHES CONNECT THE RESOLVED WORDS
NO REVIEWED CONNECTION WAS FOUND.
The search stopped after 12 lexical edges per pair. This is a statement about current graph coverage, not proof that the words are unrelated.
02
THE HONEST GAP
WHAT DOES NOT YET CONNECT
kin
etymology
03
WHAT THIS VIEW PROVES
COMPACT DOES NOT MEAN CERTAIN
Every resolved pair is searched through the undirected reviewed graph, bounded at 12 edges.
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.