| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ermans (0) - 1 freq germans (1) - 32 freq crans (2) - 1 freq errand (2) - 5 freq organs (2) - 12 freq ernan's (2) - 1 freq trans (2) - 5 freq eans (2) - 10 freq herman (2) - 1 freq ermine (2) - 7 freq emma's (2) - 1 freq errands (2) - 11 freq eras (2) - 2 freq ferman (2) - 1 freq womans (2) - 5 freq erms (2) - 48 freq germany (2) - 36 freq ehman (2) - 1 freq servans (2) - 4 freq brians (2) - 1 freq germane (2) - 1 freq sermons (2) - 9 freq lemans (2) - 1 freq wrans (2) - 1 freq wumans (2) - 1 freq |
ermans (0) - 1 freq romans (2) - 44 freq germans (2) - 32 freq eerrans (3) - 1 freq errins (3) - 1 freq rans (3) - 1 freq mans (3) - 21 freq lemans (3) - 1 freq wumans (3) - 1 freq eerans (3) - 1 freq humans (3) - 55 freq armand (3) - 1 freq roumans (3) - 2 freq remains (3) - 61 freq normans (3) - 3 freq demans (3) - 1 freq sermons (3) - 9 freq armani (3) - 1 freq raans (3) - 2 freq erns (3) - 1 freq ermine (3) - 7 freq womans (3) - 5 freq erms (3) - 48 freq organs (3) - 12 freq examins (4) - 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 - ERMNS ermans - 1 freq |
ERMANS |
| Time to execute Levenshtein function - 0.215018 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.351230 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.027479 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.037305 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.000888 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. |