| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wabsteid (0) - 76 freq wabsteed (1) - 1 freq wabsteids (1) - 9 freq wab-steid (1) - 7 freq wawsteids (2) - 1 freq wasted (2) - 23 freq waw-steid (2) - 1 freq waisted (2) - 1 freq wabsters (2) - 10 freq wabster (2) - 17 freq waffted (3) - 2 freq wated (3) - 1 freq warstit (3) - 1 freq wastlin (3) - 1 freq waanted (3) - 19 freq steid (3) - 64 freq mastoid (3) - 1 freq insteid (3) - 309 freq bedsteid (3) - 1 freq warsled (3) - 13 freq wabiti (3) - 1 freq waistin (3) - 1 freq waa-heid (3) - 1 freq easterd (3) - 1 freq hamesteid (3) - 3 freq |
wabsteid (0) - 76 freq wabsteed (1) - 1 freq wab-steid (2) - 7 freq wabsteids (2) - 9 freq wasted (3) - 23 freq wabster (3) - 17 freq waisted (3) - 1 freq wabsites (4) - 3 freq webster (4) - 8 freq wabsite (4) - 41 freq wabsters (4) - 10 freq waw-steid (4) - 1 freq wawsteids (4) - 1 freq casted (5) - 2 freq washed (5) - 89 freq wastit (5) - 21 freq tasted (5) - 20 freq labster (5) - 6 freq laisted (5) - 3 freq walted (5) - 1 freq wastird (5) - 4 freq abstain (5) - 6 freq waste (5) - 120 freq wastin (5) - 32 freq hasted (5) - 2 freq |
SoundEx code - W123 wee-buikit - 1 freq website - 54 freq websites - 8 freq wabsite - 41 freq wabsteid - 76 freq wabster - 17 freq wabsteids - 9 freq wabsters - 10 freq wabster's - 3 freq webster - 8 freq wabsteed - 1 freq wabsites - 3 freq wab-steid - 7 freq wabsteid-castin - 2 freq webacked - 1 freq wwbst - 1 freq wfsds - 1 freq wabster-scunner - 1 freq |
MetaPhone code - WBSTT wabsteid - 76 freq wabsteed - 1 freq wab-steid - 7 freq |
WABSTEID |
| Time to execute Levenshtein function - 0.211100 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.356378 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.033269 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.048484 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.001133 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. |