Eodermdrome¶
eodermdrome · letter · validated
A word whose letters, read as the edges of a graph, trace a closed figure crossing every edge once. The checker verifies the closed walk and the unrepeated edges, not the non-planarity of Borgmann's stricter reading.
Provenance¶
- Source: Dmitri A. Borgmann, Language on Vacation (1965)
- Attribution:
reference— attested in a standard reference rather than traced to an origin - Checkability:
self— decidable from the text and its parameters alone - Attested:
codified— formulated as a rule by a tradition rather than declared by an author
Details¶
- Kind: restrictive
- Languages: en
- Requires:
tokens,fold_diacritics - Deterministic: yes
Prompt hint¶
Find words whose letter pairs trace a closed graph without repeating an edge.
Parameters¶
| Name | Type | Default | Description |
|---|---|---|---|
fold_diacritics |
boolean | True |
Treat accented letters as their base letter, and ß as ss. |
Examples¶
the-word-itself¶
en — this text satisfies the procedure.
eodermdrome
Source: Dmitri A. Borgmann, Language on Vacation (1965)
an-open-walk¶
en — this text does not satisfy the procedure.
abc
Source: constructed counterexample