*SET-U

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.

2WORDS

Reviewed dossiers resolved from the request.

3NODES

Distinct forms in the spanning evidence network.

2EDGES

Distinct cited lexical relationships used.

4SOURCES

Distinct bibliographic records supporting this view.

ONE REVIEWED NETWORK1 lexical branches · 0 context bridges
algorismalgorithm
01

THE SPANNING EVIDENCE FOREST

1 BRANCHES CONNECT THE RESOLVED WORDS

01
REVIEWED LEXICAL PATH

algorism ↔ algorithm

2 EDGES
01
Present-Day English · early 13th century–today

algorism

calculation with Hindu-Arabic numerals; an arithmetic rule or procedure

attested
historical continuation

Calculation with Hindu-Arabic numerals remains central; later use becomes chiefly historical.

SOUND + EVIDENCE

Middle English algorisme / augrim stabilizes as the historical headword algorism with regularized spelling and pronunciation.

Merriam-Webster · Etymonline editors · establishedAlgorism — Word History · Etymology and First Known Use ↗OPEN EDGE 495 ↗
02
Middle English · 14th–15th centuries

algorisme / augrim

arithmetic using Hindu-Arabic numerals

attested
alteration

Arithmetic or numeral procedure narrowed and generalized into a finite stepwise procedure.

SOUND + EVIDENCE

The older ending -ism was reshaped to -ithm, commonly explained through association with Greek arithmos “number.”

Merriam-Webster · MacTutor editors · probableAlgorithm — Word History · Etymology and First Known Use ↗OPEN EDGE 83 ↗
03

WHAT THIS VIEW PROVES

COMPACT DOES NOT MEAN CERTAIN

01PAIRWISE SEARCH

Every resolved pair is searched through the undirected reviewed graph, bounded at 12 edges.

02LEXICAL FIRST

Cited ancestry, borrowing, derivation, and semantic continuation paths are preferred over historical-context bridges.

03SPANNING FOREST

The shortest available pair paths are greedily selected until each connectable word belongs to one network.

04NO STEINER CLAIM

This is a compact evidence view, not a claim that scholarship has one uniquely minimal family tree.