| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ermine (0) - 7 freq ervine (1) - 1 freq ermie (1) - 1 freq erline (1) - 1 freq o'mine (2) - 4 freq errins (2) - 1 freq eamin (2) - 1 freq vermin (2) - 3 freq errin (2) - 1 freq remine (2) - 2 freq fermin (2) - 32 freq termint (2) - 2 freq erling (2) - 1 freq erying (2) - 1 freq reine (2) - 2 freq erin (2) - 9 freq domine (2) - 2 freq erwin (2) - 1 freq engine (2) - 50 freq examine (2) - 13 freq ertie (2) - 12 freq ermans (2) - 1 freq eine (2) - 1 freq famine (2) - 15 freq trine (2) - 2 freq |
ermine (0) - 7 freq remine (2) - 2 freq erline (2) - 1 freq ermie (2) - 1 freq ervine (2) - 1 freq remin (3) - 1 freq erne (3) - 4 freq raine (3) - 1 freq rhine (3) - 2 freq famine (3) - 15 freq rine (3) - 1 freq eomin (3) - 1 freq urine (3) - 2 freq eryin (3) - 3 freq reamin (3) - 6 freq reimin (3) - 1 freq hermin (3) - 2 freq ernie (3) - 50 freq irvine (3) - 21 freq ermans (3) - 1 freq germane (3) - 1 freq mine (3) - 660 freq reine (3) - 2 freq erin (3) - 9 freq vermin (3) - 3 freq |
SoundEx code - E655 erm-in-erm - 1 freq ermine - 7 freq erinnin - 1 freq earnin - 8 freq ernan's - 1 freq ermans - 1 freq earnins - 4 freq ern'in' - 1 freq ermintrude - 1 freq erymanthian - 3 freq |
MetaPhone code - ERMN ermine - 7 freq |
ERMINE |
| Time to execute Levenshtein function - 0.595729 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 - 1.214992 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.087850 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.123497 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.058111 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. |