| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wabster (0) - 17 freq waster (1) - 13 freq webster (1) - 8 freq waister (1) - 1 freq wabsters (1) - 10 freq labster (1) - 6 freq faster (2) - 77 freq faaster (2) - 6 freq wastel (2) - 1 freq wasser (2) - 1 freq wastern (2) - 5 freq water (2) - 252 freq easter (2) - 41 freq wastes (2) - 4 freq walter (2) - 56 freq master (2) - 19 freq waater (2) - 34 freq wabster's (2) - 3 freq waitter (2) - 56 freq wabsteid (2) - 76 freq hubster (2) - 1 freq wabsites (2) - 3 freq caster (2) - 2 freq haister (2) - 2 freq wabsteed (2) - 1 freq |
wabster (0) - 17 freq webster (1) - 8 freq waster (2) - 13 freq wabsters (2) - 10 freq labster (2) - 6 freq waister (2) - 1 freq wester (3) - 6 freq wabsteed (3) - 1 freq hubster (3) - 1 freq wabsites (3) - 3 freq wabsteid (3) - 76 freq lobster (3) - 23 freq wooster (3) - 1 freq wabsite (3) - 41 freq mayster (4) - 1 freq waiter (4) - 34 freq watter (4) - 1016 freq wastert (4) - 1 freq waisted (4) - 1 freq wasters (4) - 6 freq waatter (4) - 2 freq wastet (4) - 2 freq aister (4) - 2 freq websites (4) - 8 freq bouster (4) - 1 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 - WBSTR wabster - 17 freq webster - 8 freq |
WABSTER |
| Time to execute Levenshtein function - 0.274559 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.449017 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.027037 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.037057 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.000851 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. |