| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| erun (0) - 2 freq egrun (1) - 1 freq erum (1) - 1 freq orun (1) - 1 freq run (1) - 634 freq arun (1) - 2 freq grun (1) - 422 freq rerun (1) - 1 freq 'run (1) - 1 freq erin (1) - 9 freq ern (1) - 14 freq eeran (2) - 2 freq rn (2) - 4 freq brung (2) - 21 freq crub (2) - 3 freq tru (2) - 1 freq erenn (2) - 1 freq fern (2) - 5 freq erms (2) - 48 freq elren (2) - 1 freq ru (2) - 1 freq true (2) - 532 freq frug (2) - 2 freq runt (2) - 7 freq herin (2) - 2 freq |
erun (0) - 2 freq arun (1) - 2 freq erin (1) - 9 freq ern (1) - 14 freq run (1) - 634 freq orun (1) - 1 freq ran (2) - 451 freq rn (2) - 7 freq aran (2) - 5 freq urn (2) - 6 freq ryn (2) - 2 freq aren (2) - 3 freq aroun (2) - 129 freq ruin (2) - 36 freq irn (2) - 35 freq erne (2) - 4 freq eiron (2) - 1 freq rin (2) - 453 freq iron (2) - 107 freq ron (2) - 14 freq ren (2) - 11 freq roun (2) - 329 freq eryin (2) - 3 freq iran (2) - 2 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 |
ERUN |
| Time to execute Levenshtein function - 0.235462 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.365317 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.028032 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.037477 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.000910 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. |