| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| earn (0) - 41 freq earns (1) - 3 freq eard (1) - 1 freq eart (1) - 4 freq larn (1) - 16 freq eare (1) - 1 freq warn (1) - 35 freq darn (1) - 3 freq eari (1) - 1 freq ear (1) - 143 freq carn (1) - 1 freq karn (1) - 7 freq learn (1) - 294 freq earnt (1) - 10 freq earl (1) - 31 freq ean (1) - 46 freq yarn (1) - 49 freq yearn (1) - 1 freq ears (1) - 112 freq barn (1) - 68 freq ern (1) - 14 freq harn (1) - 5 freq cars (2) - 100 freq wearan (2) - 9 freq urn (2) - 6 freq |
earn (0) - 41 freq yearn (1) - 1 freq yarn (1) - 49 freq ern (1) - 14 freq arni (2) - 3 freq aaron (2) - 5 freq ran (2) - 451 freq yairn (2) - 32 freq erne (2) - 4 freq arun (2) - 2 freq airn (2) - 52 freq eeran (2) - 2 freq rn (2) - 7 freq erun (2) - 2 freq yirn (2) - 3 freq eiron (2) - 1 freq arna (2) - 23 freq irn (2) - 35 freq arne (2) - 1 freq erin (2) - 9 freq ayrn (2) - 1 freq rain (2) - 686 freq aren (2) - 3 freq aran (2) - 5 freq eerin (2) - 2 freq |
SoundEx code - E650 erm - 70 freq erun - 2 freq eairryin - 1 freq eeran - 2 freq earn - 41 freq eryin - 3 freq erum - 1 freq ern - 14 freq eerin - 2 freq eiron - 1 freq ermy - 2 freq errin - 1 freq erowen - 1 freq erwin - 1 freq erran' - 1 freq earrin - 1 freq erran - 3 freq ernie - 50 freq eireann - 1 freq ermie - 1 freq eirinn - 1 freq erowan - 1 freq erenn - 1 freq erin - 9 freq €˜erin - 1 freq erne - 4 freq erinm - 2 freq eye-rhyme - 1 freq |
MetaPhone code - ERN erun - 2 freq eeran - 2 freq earn - 41 freq ern - 14 freq eerin - 2 freq eiron - 1 freq errin - 1 freq erran' - 1 freq earrin - 1 freq erran - 3 freq ernie - 50 freq eireann - 1 freq eirinn - 1 freq erenn - 1 freq erin - 9 freq €˜erin - 1 freq erne - 4 freq aeaeron - 5 freq |
EARN |
| Time to execute Levenshtein function - 0.177392 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.359839 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.031898 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.040127 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.001015 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. |