| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| walrus (0) - 9 freq allus (2) - 4 freq wards (2) - 30 freq waarms (2) - 1 freq warrum (2) - 1 freq warts (2) - 5 freq callus (2) - 1 freq wairns (2) - 1 freq wales (2) - 37 freq waleys (2) - 1 freq warum (2) - 5 freq walks (2) - 97 freq walnuts (2) - 6 freq walts (2) - 1 freq wares (2) - 6 freq warns (2) - 2 freq war's (2) - 3 freq waards (2) - 1 freq walays (2) - 1 freq walcum (2) - 31 freq wars (2) - 61 freq wal's (2) - 1 freq wall's (2) - 8 freq wals (2) - 1 freq walins (2) - 2 freq |
walrus (0) - 9 freq wars (3) - 61 freq wares (3) - 6 freq walts (3) - 1 freq wal's (3) - 1 freq wals (3) - 1 freq walls (3) - 27 freq waars (3) - 1 freq waurs (3) - 1 freq walins (3) - 2 freq walks (3) - 97 freq walays (3) - 1 freq waleys (3) - 1 freq wales (3) - 37 freq walkies (4) - 8 freq valorous (4) - 2 freq waldies (4) - 10 freq wls (4) - 1 freq waters (4) - 18 freq waals (4) - 7 freq wilds (4) - 7 freq welr (4) - 1 freq whars (4) - 3 freq whalers (4) - 8 freq wells (4) - 19 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 - WLRS walrus - 9 freq whalers - 8 freq wheelers - 1 freq |
WALRUS |
| Time to execute Levenshtein function - 0.186522 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.340051 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.027183 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.036686 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.000930 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. |