| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| autopilot (0) - 1 freq autoricht (3) - 1 freq €œtoilet (4) - 1 freq utopia (4) - 1 freq automatit (4) - 1 freq sub-plot (4) - 1 freq autopsy (4) - 2 freq autoritie (4) - 3 freq automaton (4) - 1 freq autocrat (4) - 4 freq wumpilt (4) - 1 freq utopian (4) - 4 freq astonist (4) - 5 freq astonisht (4) - 4 freq pilot (4) - 24 freq autosort (4) - 1 freq utopias (4) - 1 freq toilet (4) - 93 freq antonio (4) - 1 freq opint (5) - 1 freq eulogisit (5) - 1 freq hauf-pint (5) - 1 freq putit (5) - 2 freq auncient (5) - 74 freq aff-pit (5) - 6 freq |
autopilot (0) - 1 freq toilet (5) - 93 freq pilot (5) - 24 freq tumilt (6) - 1 freq trailt (6) - 7 freq utility (6) - 7 freq i'plot (6) - 1 freq tooslet (6) - 1 freq toppit (6) - 1 freq catapult (6) - 1 freq pylot (6) - 3 freq ootpit (6) - 28 freq plot (6) - 38 freq tilt (6) - 30 freq spilt (6) - 20 freq tootlt (6) - 1 freq toalt (6) - 1 freq toppet (6) - 2 freq ettilt (6) - 25 freq pilet (6) - 1 freq output (6) - 2 freq twilt (6) - 2 freq tousilt (6) - 1 freq outlet (6) - 3 freq typit (6) - 3 freq |
SoundEx code - A314 audible - 4 freq audibly - 1 freq autopilot - 1 freq |
MetaPhone code - ATPLT autopilot - 1 freq |
AUTOPILOT |
| Time to execute Levenshtein function - 0.200491 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.377271 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.027332 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.038490 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.000911 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. |