| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oliphant (0) - 4 freq flippant (2) - 2 freq clephant (2) - 1 freq elephant (2) - 35 freq orphans (3) - 35 freq orphan (3) - 14 freq slippan (3) - 7 freq plipan (3) - 1 freq clippan (3) - 3 freq slipan (3) - 1 freq epiphany (3) - 2 freq flippan (3) - 1 freq pliant (3) - 1 freq blichan (3) - 1 freq elephint (3) - 1 freq lippan (3) - 1 freq lippent (3) - 13 freq elephants (3) - 12 freq lapland (4) - 3 freq dolphin (4) - 5 freq slippet (4) - 1 freq elephant's (4) - 1 freq litigant (4) - 1 freq slant (4) - 3 freq lippit (4) - 2 freq |
oliphant (0) - 4 freq elephant (2) - 35 freq clephant (3) - 1 freq elephint (3) - 1 freq lippent (4) - 13 freq flippant (4) - 2 freq elephants (4) - 12 freq lippan (5) - 1 freq phont (5) - 3 freq alphabet (5) - 15 freq pliant (5) - 1 freq orphans (5) - 35 freq orphan (5) - 14 freq epiphany (5) - 2 freq lippen (6) - 69 freq aipent (6) - 1 freq lippend (6) - 1 freq plant (6) - 82 freq laant (6) - 1 freq opent (6) - 88 freq whant (6) - 15 freq unlippent (6) - 1 freq lipt (6) - 1 freq alpha (6) - 5 freq elephantine (6) - 1 freq |
SoundEx code - O415 oliphant - 4 freq oliphantwullie - 5 freq |
MetaPhone code - OLFNT oliphant - 4 freq |
OLIPHANT |
| Time to execute Levenshtein function - 0.259934 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.394230 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.033380 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.038008 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.000955 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. |