| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| zebedee (0) - 7 freq zebedee's (2) - 3 freq teedee (2) - 1 freq ceedee (2) - 1 freq peeree (3) - 2 freq needae (3) - 1 freq jeedge (3) - 8 freq peeeee (3) - 2 freq meedle (3) - 1 freq meedae (3) - 2 freq peeeeee (3) - 2 freq eeeeeee (3) - 1 freq reydee (3) - 1 freq needet (3) - 2 freq heedge (3) - 1 freq cyberee (3) - 1 freq seeded (3) - 3 freq meedie (3) - 2 freq needle (3) - 39 freq awbudee (3) - 5 freq eberdeen (3) - 3 freq abudee (3) - 10 freq meeee (3) - 1 freq needie (3) - 3 freq heehee (3) - 2 freq |
zebedee (0) - 7 freq awbudee (4) - 5 freq bedae (4) - 1 freq abudee (4) - 10 freq bede (4) - 1 freq abdee (4) - 1 freq zebedee's (4) - 3 freq teedee (4) - 1 freq ceedee (4) - 1 freq bodee (4) - 2 freq awbodie (5) - 34 freq oobed (5) - 1 freq omebodie (5) - 1 freq seabed (5) - 2 freq abodie (5) - 2 freq naybidee (5) - 1 freq beee (5) - 3 freq bebeve (5) - 1 freq peedie (5) - 285 freq remede (5) - 1 freq leeded (5) - 1 freq meeded (5) - 1 freq heeded (5) - 14 freq bed (5) - 928 freq bedene (5) - 2 freq |
SoundEx code - Z130 zipped - 5 freq zapped - 2 freq zebedee - 7 freq zippt - 1 freq zipt - 1 freq zippit - 1 freq zpffyt - 1 freq |
MetaPhone code - SBT s'aboot - 1 freq sobbed - 7 freq sabbed - 5 freq sea-buit - 2 freq seabuit - 1 freq subtie - 1 freq seabed - 2 freq sabbat - 1 freq zebedee - 7 freq sobbit - 3 freq sabata - 1 freq sabbit - 1 freq sbt - 6 freq sbd - 2 freq |
ZEBEDEE |
| Time to execute Levenshtein function - 0.222660 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.491096 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.034139 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.072550 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.000957 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. |