| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| debaitabil (0) - 1 freq debatable (3) - 1 freq availabil (4) - 1 freq detail (4) - 43 freq debait (4) - 1 freq debatin (4) - 3 freq devastatit (4) - 1 freq debaiten (4) - 1 freq estimabil (4) - 1 freq debilitatin (4) - 2 freq dabaittie (4) - 2 freq defaitit (4) - 1 freq deegital (4) - 4 freq debatit (4) - 9 freq €˜britain (5) - 1 freq deviatit (5) - 2 freq tel-tail (5) - 1 freq deebaiten (5) - 1 freq repairable (5) - 1 freq bailbail (5) - 1 freq digital (5) - 25 freq dessicatit (5) - 1 freq dental (5) - 7 freq veritable (5) - 2 freq botabit (5) - 1 freq |
debaitabil (0) - 1 freq debatable (3) - 1 freq habitable (6) - 4 freq dabaittie (6) - 2 freq debatit (6) - 9 freq deegital (6) - 4 freq debaiten (6) - 1 freq detail (6) - 43 freq debait (6) - 1 freq debatin (6) - 3 freq daithlie (7) - 1 freq adaptable (7) - 1 freq heritable (7) - 4 freq debutante (7) - 1 freq desirable (7) - 4 freq battil (7) - 2 freq d'italia (7) - 1 freq debbie (7) - 2 freq decibel (7) - 1 freq debnicol (7) - 5 freq taibil (7) - 3 freq orbital (7) - 3 freq delectable (7) - 1 freq debated (7) - 3 freq relatable (7) - 3 freq |
SoundEx code - D131 dib-dabs - 1 freq debt-free - 1 freq doubtfu - 3 freq doubtful - 4 freq doubtfully - 2 freq debatable - 1 freq debaitabil - 1 freq davidpsnp - 1 freq debdev - 1 freq davidbowie - 1 freq davidpreece - 1 freq devtober - 1 freq davidboatymcboa - 2 freq davidbu - 1 freq davidpaisley - 4 freq davidpwebb - 1 freq daviddavismp - 1 freq davidofficer - 1 freq davidfe - 6 freq davidpolson - 1 freq |
MetaPhone code - TBTBL debatable - 1 freq debaitabil - 1 freq |
DEBAITABIL |
| Time to execute Levenshtein function - 0.310507 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.756741 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.080322 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.101080 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.000903 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. |