Let
Sigma be the set of all letters
and define
f as a function from Sigma star to Sigma star
via
f of the empty string equals the empty string, f of a x equals w f of x if a is l or r, f of a x equals a f of x otherwise
Then define an equivalence relation via
tilde
x tilde y if and only if f of x equals f of y
For example, horror hollow, as both words map to howwow.
Then the (non-singleton) equivalence classes that have the longest (English) words are:
noncowwectivewy: {noncollectively, noncorrectively}
twanswationawwy: {translationally, transrationally}
The equivalence classes of size 3 with the longest words are:
mowawities: {molalities, molarities, moralities}
The largest equivalence classes are:
wawe: {lare, rale, rare, wale, ware, wawe}
weaw: {leal, lear, real, rear, weal, wear}
wawes: {lares, rales, rares, wales, wares, wawes}
wowwy: {lolly, lorry, lowly, lowry, wolly, worry}
wowwies: {lollies, lorries, lowries, rollies, wollies, worries}
