| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| walrus (0) - 9 freq waleys (2) - 1 freq callus (2) - 1 freq jairus (2) - 3 freq albus (2) - 4 freq wall's (2) - 8 freq wards (2) - 30 freq allus (2) - 4 freq warts (2) - 5 freq waarks (2) - 5 freq palus (2) - 1 freq warls (2) - 4 freq gallus (2) - 97 freq walins (2) - 2 freq walls (2) - 29 freq walcum (2) - 31 freq warks (2) - 132 freq wares (2) - 6 freq waards (2) - 1 freq war's (2) - 3 freq wales (2) - 39 freq taurus (2) - 5 freq walks (2) - 100 freq walcums (2) - 10 freq salus (2) - 1 freq |
walrus (0) - 9 freq waurs (3) - 1 freq wal's (3) - 1 freq walts (3) - 1 freq walins (3) - 2 freq walks (3) - 100 freq wars (3) - 61 freq waars (3) - 2 freq wales (3) - 39 freq waleys (3) - 1 freq wals (3) - 1 freq walays (3) - 1 freq walls (3) - 29 freq wares (3) - 6 freq valorous (4) - 2 freq wiles (4) - 11 freq wails (4) - 6 freq wilds (4) - 7 freq wels (4) - 5 freq whaurs (4) - 9 freq waals (4) - 7 freq waels (4) - 4 freq wylds (4) - 1 freq wells (4) - 19 freq waalls (4) - 1 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.205025 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.380588 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.027847 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.037023 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.000981 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. |