Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
wildebeest (0) - 5 freq wildwest (3) - 1 freq wildest (3) - 3 freq wilderness (3) - 14 freq wulderness (4) - 1 freq wide-eed (4) - 2 freq widest (4) - 3 freq wileness (4) - 1 freq wildness (4) - 6 freq wide-kent (4) - 1 freq weeest (4) - 2 freq ill-best (4) - 1 freq albeest (4) - 1 freq wild-ee'd (4) - 1 freq eildest (4) - 2 freq wing-beat (5) - 1 freq windae's (5) - 5 freq gildernewm (5) - 1 freq weetest (5) - 1 freq wildrife (5) - 1 freq hibees (5) - 11 freq welders (5) - 2 freq eldest (5) - 18 freq dearest (5) - 19 freq weirdest (5) - 2 freq |
wildebeest (0) - 5 freq wildwest (4) - 1 freq wildest (4) - 3 freq ill-best (6) - 1 freq albeest (6) - 1 freq wildness (6) - 6 freq owldest (6) - 5 freq eildest (6) - 2 freq widest (6) - 3 freq wilderness (6) - 14 freq eldest (7) - 18 freq welders (7) - 2 freq wulderness (7) - 1 freq waldies (7) - 10 freq wildside (7) - 1 freq wilds (7) - 7 freq wurdiest (7) - 1 freq weirdest (7) - 2 freq oldest (7) - 3 freq aaldest (7) - 8 freq weeest (7) - 2 freq wildcat (7) - 1 freq wild-ee'd (7) - 1 freq windae-seat (7) - 1 freq aldest (7) - 1 freq |
SoundEx code - W431 would've - 10 freq wildfire - 4 freq weel-developed - 1 freq wildflooers - 6 freq wild-flowers - 1 freq weel-developit - 1 freq wildebeest - 5 freq weill-adaptit - 1 freq wildflowers - 1 freq wildfloor - 1 freq wouldve - 1 freq wildwifeodanort - 1 freq wildflower - 3 freq |
MetaPhone code - WLTBST wildebeest - 5 freq |
WILDEBEEST |
Time to execute Levenshtein function - 0.198548 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.355908 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.027886 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.038296 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.000925 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. |