| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| emerant (0) - 9 freq emergant (1) - 1 freq eerant (1) - 2 freq emerants (1) - 1 freq emerent (1) - 1 freq emergent (2) - 1 freq eerrant (2) - 1 freq temerat (2) - 1 freq emigrant (2) - 2 freq emerald (2) - 17 freq eerans (2) - 1 freq meant (2) - 454 freq reverant (2) - 3 freq eeran (2) - 2 freq emergit (2) - 1 freq errant (2) - 2 freq earrant (2) - 1 freq elegant (2) - 12 freq rembrandt (3) - 4 freq meant' (3) - 1 freq cleant (3) - 4 freq bemeanit (3) - 1 freq merit (3) - 16 freq sternt (3) - 1 freq erran (3) - 3 freq |
emerant (0) - 9 freq emerent (1) - 1 freq emerants (2) - 1 freq eerant (2) - 2 freq emergant (2) - 1 freq meant (3) - 454 freq errant (3) - 2 freq earrant (3) - 1 freq eerrant (3) - 1 freq emergent (3) - 1 freq emigrant (3) - 2 freq emergit (3) - 1 freq byrant (4) - 1 freq querent (4) - 1 freq leernt (4) - 2 freq meent (4) - 22 freq imporant (4) - 1 freq lernt (4) - 4 freq merest (4) - 6 freq werent (4) - 1 freq moran (4) - 8 freq merrit (4) - 6 freq mereat (4) - 1 freq merkat (4) - 6 freq meint (4) - 6 freq |
SoundEx code - E565 enormous - 15 freq emerent - 1 freq emerant - 9 freq enorm - 11 freq enormity - 3 freq enormobibliotosspotificant - 1 freq enairmit - 1 freq emerants - 1 freq |
MetaPhone code - EMRNT emerent - 1 freq emerant - 9 freq |
EMERANT |
| Time to execute Levenshtein function - 0.195623 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.340881 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.026919 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.036679 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.000855 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. |