| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| waxwarks (0) - 2 freq wabwarks (1) - 1 freq waarks (2) - 5 freq wabwark (2) - 3 freq tawards (3) - 7 freq wayward (3) - 1 freq oarwark (3) - 1 freq bakwards (3) - 2 freq tacwards (3) - 1 freq taewards (3) - 186 freq taewarts (3) - 1 freq warks (3) - 132 freq bakwarts (3) - 1 freq awards (3) - 35 freq netwarks (3) - 2 freq waark (3) - 110 freq atwards (3) - 3 freq waaalks (3) - 1 freq waars (3) - 2 freq waards (3) - 1 freq waarms (3) - 1 freq ramarks (3) - 1 freq waaks (3) - 5 freq attacks (4) - 13 freq sharks (4) - 9 freq |
waxwarks (0) - 2 freq wabwarks (2) - 1 freq wabwark (4) - 3 freq waarks (4) - 5 freq warks (5) - 132 freq netwarks (5) - 2 freq roadwurks (6) - 1 freq netwirks (6) - 7 freq wraks (6) - 1 freq waaks (6) - 5 freq wurks (6) - 3 freq networks (6) - 1 freq netwaarks (6) - 8 freq airnwarks (6) - 2 freq wirks (6) - 50 freq works (6) - 121 freq wuidwark (6) - 2 freq waterworks (6) - 3 freq widwork (6) - 1 freq owerwark (6) - 1 freq railworks (6) - 1 freq ramarks (6) - 1 freq taewards (6) - 186 freq taewarts (6) - 1 freq bakwarts (6) - 1 freq |
SoundEx code - W262 whiskers - 22 freq whuskers - 12 freq washer's - 1 freq washers - 1 freq wagers - 1 freq waxwarks - 2 freq wikkers - 1 freq wieghorst - 1 freq waukers - 1 freq wiskers - 1 freq wuqrqlodfj - 1 freq wheekers - 1 freq wgjgrecg - 1 freq wowzers - 1 freq wickers - 1 freq weekirstyw - 1 freq wzroqhl - 1 freq wzrz - 1 freq wyqrwcrfw - 1 freq |
MetaPhone code - WKSWRKS waxwarks - 2 freq |
WAXWARKS |
| Time to execute Levenshtein function - 0.411436 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.633741 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.078620 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.094069 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.001957 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. |