| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wabsters (0) - 10 freq labsters (1) - 9 freq wabster (1) - 17 freq wabster's (1) - 3 freq wasters (1) - 6 freq waister (2) - 1 freq wastert (2) - 1 freq lobsters (2) - 37 freq wabsteids (2) - 9 freq maisters (2) - 38 freq hamsters (2) - 1 freq watters (2) - 86 freq wabsteed (2) - 1 freq tasters (2) - 1 freq masters (2) - 10 freq waaters (2) - 4 freq wastern (2) - 5 freq wastes (2) - 4 freq wabsteid (2) - 78 freq daesters (2) - 1 freq labster's (2) - 1 freq waitters (2) - 4 freq waiters (2) - 8 freq casters (2) - 2 freq washers (2) - 1 freq |
wabsters (0) - 10 freq labsters (2) - 9 freq wasters (2) - 6 freq wabster's (2) - 3 freq wabster (2) - 17 freq wabsites (3) - 3 freq wabsteids (3) - 9 freq webster (3) - 8 freq lobsters (3) - 37 freq washers (4) - 1 freq casters (4) - 2 freq waiters (4) - 8 freq waitters (4) - 4 freq labster (4) - 6 freq labster- (4) - 1 freq labster's (4) - 1 freq websites (4) - 8 freq busters (4) - 1 freq waster (4) - 13 freq waters (4) - 18 freq walters (4) - 4 freq hamsters (4) - 1 freq watters (4) - 86 freq waister (4) - 1 freq daesters (4) - 1 freq |
SoundEx code - W123 wee-buikit - 1 freq wabsteid - 78 freq website - 54 freq websites - 8 freq wabsite - 41 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 - WBSTRS wabsters - 10 freq wabster's - 3 freq |
WABSTERS |
| Time to execute Levenshtein function - 0.228719 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.383323 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.030254 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.039935 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.000906 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. |