| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| aither (0) - 140 freq 'ither (1) - 7 freq ither (1) - 3066 freq zither (1) - 6 freq daither (1) - 1 freq anther (1) - 2 freq nither (1) - 5 freq raither (1) - 273 freq naither (1) - 63 freq taither (1) - 1 freq gaither (1) - 83 freq gither (1) - 69 freq laither (1) - 2 freq aithers (1) - 7 freq ather (1) - 3 freq lither (1) - 1 freq rither (1) - 6 freq ainther (1) - 3 freq faither (1) - 1390 freq either (1) - 458 freq maither (1) - 1 freq anither (1) - 2008 freq alther (1) - 1 freq mither (1) - 1378 freq ayther (1) - 3 freq |
aither (0) - 140 freq ather (1) - 3 freq either (1) - 458 freq aether (1) - 1 freq ayther (1) - 3 freq ither (1) - 3066 freq mither (2) - 1378 freq cither (2) - 1 freq fither (2) - 12 freq dither (2) - 2 freq hither (2) - 6 freq tither (2) - 202 freq bither (2) - 12 freq ithir (2) - 34 freq uther (2) - 9 freq other (2) - 579 freq eether (2) - 12 freq ether (2) - 27 freq alther (2) - 1 freq ther (2) - 111 freq author (2) - 37 freq baither (2) - 2 freq wither (2) - 143 freq raither (2) - 273 freq anither (2) - 2008 freq |
SoundEx code - A360 aither - 140 freq author - 37 freq atour - 11 freq atore - 2 freq adhere - 7 freq atray - 2 freq aidder - 1 freq adore - 12 freq attire - 12 freq aeter - 1 freq ather - 3 freq at'r - 1 freq aether - 1 freq audrey - 13 freq attour - 5 freq atterie - 4 freq aider - 2 freq atoore - 3 freq €˜author - 1 freq aiterie - 1 freq atoure - 1 freq atower - 1 freq ayther - 3 freq adder - 4 freq attery - 1 freq attar - 1 freq athraw - 1 freq atter - 1 freq aidter - 1 freq atari - 1 freq adair - 1 freq atr - 1 freq |
MetaPhone code - A0R aither - 140 freq author - 37 freq ather - 3 freq €˜author - 1 freq ayther - 3 freq athraw - 1 freq |
AITHER |
| Time to execute Levenshtein function - 0.297988 milliseconds The Levenshtein distance is the number of characters you have to replace, insert or delete to transform one word into another, its useful for detecting typos and alternative spellings |
Time to execute Double Levenshtein function - 0.599594 milliseconds In a stroke of genius, this runs the Levenshtein function twice, once without vowels and adds the distance together, giving double weight to consonants. |
Time to execute SoundEx function - 0.087099 milliseconds Soundex is a phonetic algorithm for indexing names by sound, as pronounced in English. The goal is for homophones to be encoded to the same representation so that they can be matched despite minor differences in spelling. |
Time to execute MetaPhone function - 0.096182 milliseconds Metaphone is a phonetic algorithm, published by Lawrence Philips in 1990, for indexing words by their English pronunciation.[1] It fundamentally improves on the Soundex algorithm by using information about variations and inconsistencies in English spelling and pronunciation to produce a more accurate encoding, which does a better job of matching words and names which sound similar. |
Time to execute Manually curated function - 0.000942 milliseconds Manual Curation uses a lookup table / lexicon which has been created by hand which links words to their lemmas, and includes obvious typos and spelling variations. Not all words are covered. |