| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| doubtful (0) - 4 freq doubtfu (1) - 3 freq doubtfully (2) - 2 freq dootful (2) - 3 freq boastful (3) - 1 freq mouthful (3) - 2 freq doubtin (3) - 3 freq towtful (3) - 1 freq doubt (3) - 94 freq doubtin' (3) - 1 freq mournful (3) - 2 freq youthful (3) - 3 freq dootfu (3) - 6 freq doubts (3) - 5 freq fruitful (3) - 2 freq doublt-up (3) - 1 freq hurtful (3) - 1 freq pouerful (3) - 3 freq doubted (3) - 7 freq doutsum (3) - 1 freq doubil (3) - 3 freq doubters (3) - 2 freq doleful (3) - 1 freq dutiful (3) - 1 freq moothful (4) - 8 freq |
doubtful (0) - 4 freq doubtfu (2) - 3 freq dootful (3) - 3 freq doubtfully (3) - 2 freq dutiful (4) - 1 freq hurtful (5) - 1 freq fruitful (5) - 2 freq doubted (5) - 7 freq doleful (5) - 1 freq doubts (5) - 5 freq doubters (5) - 2 freq doubil (5) - 3 freq dootfu (5) - 6 freq doubt (5) - 94 freq towtful (5) - 1 freq boastful (5) - 1 freq doubtin' (5) - 1 freq doubtin (5) - 3 freq dreadful (6) - 5 freq duffel (6) - 2 freq graetful (6) - 1 freq doubly (6) - 4 freq fitful (6) - 6 freq fretful (6) - 2 freq dootfae (6) - 1 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 - TBTFL doubtful - 4 freq doubtfully - 2 freq |
DOUBTFUL |
| Time to execute Levenshtein function - 0.352104 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.539853 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.032099 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.042352 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.000842 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. |