| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wlrqslwr (0) - 1 freq warsles (4) - 2 freq warsslin (4) - 2 freq warsled (4) - 13 freq chrysler (4) - 1 freq wrassler (4) - 1 freq warssled (4) - 5 freq wrestler (4) - 1 freq warslet (4) - 6 freq warsaw (4) - 1 freq worser (4) - 3 freq warslin (4) - 17 freq wurds'r (4) - 1 freq warbler (4) - 1 freq warssles (4) - 2 freq warsle (4) - 24 freq worsley (4) - 1 freq warstit (5) - 1 freq wzroqhl (5) - 1 freq wirsells (5) - 2 freq worsid (5) - 2 freq warldlie (5) - 1 freq warsils (5) - 1 freq whusslet (5) - 1 freq firsled (5) - 1 freq |
wlrqslwr (0) - 1 freq wrassler (7) - 1 freq warbler (8) - 1 freq worser (8) - 3 freq warslin (8) - 17 freq warssles (8) - 2 freq worsley (8) - 1 freq warsle (8) - 24 freq warsaw (8) - 1 freq wurds'r (8) - 1 freq warsslin (8) - 2 freq warslet (8) - 6 freq warsles (8) - 2 freq chrysler (8) - 1 freq warsled (8) - 13 freq wrestler (8) - 1 freq warssled (8) - 5 freq wrasslin (9) - 7 freq wirsels (9) - 80 freq warsel (9) - 3 freq wylqsp (9) - 1 freq walrus (9) - 9 freq watslure (9) - 2 freq wildflower (9) - 3 freq warselt (9) - 2 freq |
SoundEx code - W462 walrus - 9 freq weel-rigged - 1 freq weel-respected - 1 freq whalers - 8 freq wheelers - 1 freq well-respected - 1 freq weill-wrocht - 2 freq weel-wrocht - 3 freq waalruses - 1 freq weel-regairdit - 2 freq weel-respectit - 1 freq weel-wirked - 1 freq woolwork - 2 freq wlrqslwr - 1 freq |
MetaPhone code - LRKSLR wlrqslwr - 1 freq |
WLRQSLWR |
| Time to execute Levenshtein function - 0.254572 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.466157 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.030661 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.038001 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.000924 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. |