| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| earrin (0) - 1 freq earnin (1) - 8 freq tarrin (1) - 1 freq errin (1) - 1 freq earrins (1) - 2 freq garrin (1) - 35 freq warrin (1) - 1 freq jarrin (1) - 2 freq barrin (1) - 7 freq searin (2) - 4 freq tarin (2) - 1 freq darrn (2) - 1 freq parin (2) - 4 freq serrin (2) - 5 freq warin (2) - 2 freq nearin (2) - 6 freq bargin (2) - 2 freq bearin (2) - 28 freq larnin (2) - 27 freq barkin (2) - 27 freq farin (2) - 10 freq warran (2) - 4 freq varrit (2) - 1 freq yarnin (2) - 18 freq garron (2) - 6 freq |
earrin (0) - 1 freq errin (1) - 1 freq rairin (2) - 22 freq rarin (2) - 5 freq rearin (2) - 8 freq arran (2) - 15 freq barrin (2) - 7 freq erran (2) - 3 freq eairryin (2) - 1 freq garrin (2) - 35 freq earrins (2) - 2 freq earnin (2) - 8 freq tarrin (2) - 1 freq warrin (2) - 1 freq jarrin (2) - 2 freq yearnin (3) - 1 freq earn (3) - 41 freq gurrin (3) - 1 freq airin (3) - 4 freq hurrin (3) - 1 freq herrin (3) - 24 freq earrier (3) - 1 freq fairin (3) - 13 freq tirrin (3) - 3 freq arhin (3) - 1 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 |
EARRIN |
| Time to execute Levenshtein function - 0.188080 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.424869 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.036435 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.037863 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.000932 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. |