| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wannabe (0) - 6 freq wannae (1) - 6 freq cannaee (2) - 1 freq winnae (2) - 46 freq eannae (2) - 5 freq wanae (2) - 1 freq cannae (2) - 1640 freq wantae (2) - 14 freq wunnae (2) - 13 freq kannae (2) - 1 freq winnable (2) - 1 freq wannabees (2) - 3 freq wanease (2) - 1 freq annabel (2) - 1 freq wanna (2) - 15 freq wadnae (2) - 60 freq waznae (2) - 3 freq warnae (2) - 15 freq wasnae (2) - 127 freq wan-aff (3) - 1 freq innate (3) - 3 freq winsnae (3) - 1 freq hanfae (3) - 3 freq annone (3) - 1 freq kanna (3) - 1 freq |
wannabe (0) - 6 freq wannae (2) - 6 freq wannabees (3) - 3 freq winnable (3) - 1 freq wanna (3) - 15 freq wunnae (3) - 13 freq winnae (3) - 46 freq winnie (4) - 80 freq wannt (4) - 1 freq winnan (4) - 1 freq wanny (4) - 8 freq winna (4) - 384 freq wenna (4) - 1 freq wasnae (4) - 127 freq wunna (4) - 10 freq wunne (4) - 1 freq wanner (4) - 17 freq wadnae (4) - 60 freq cannae (4) - 1640 freq wantae (4) - 14 freq wanae (4) - 1 freq eannae (4) - 5 freq cannaee (4) - 1 freq warnae (4) - 15 freq kannae (4) - 1 freq |
SoundEx code - W510 womb - 8 freq weanp - 1 freq wannabe - 6 freq wimp - 1 freq whump - 2 freq wanhowp - 6 freq wanhope - 1 freq wan-off - 1 freq wanhowpfu - 1 freq wanhap - 1 freq winfa - 1 freq wunup - 1 freq wimpy - 5 freq wnvh - 1 freq wan-aff - 1 freq |
MetaPhone code - WNB wannabe - 6 freq |
WANNABE |
| Time to execute Levenshtein function - 0.214731 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.349850 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.027030 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.036913 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.000890 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. |