| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wildebeest (0) - 5 freq wildwest (3) - 1 freq wildest (3) - 3 freq wilderness (3) - 14 freq eildest (4) - 2 freq wulderness (4) - 1 freq weeest (4) - 2 freq wild-ee'd (4) - 1 freq ill-best (4) - 1 freq wileness (4) - 1 freq wide-kent (4) - 1 freq albeest (4) - 1 freq wildness (4) - 6 freq wide-eed (4) - 2 freq widest (4) - 3 freq wurd-leet (5) - 1 freq digeest (5) - 1 freq undervest (5) - 1 freq detest (5) - 2 freq indecent (5) - 1 freq auldest (5) - 46 freq glebes (5) - 1 freq wireless (5) - 55 freq widbines (5) - 2 freq liefest (5) - 2 freq |
wildebeest (0) - 5 freq wildwest (4) - 1 freq wildest (4) - 3 freq albeest (6) - 1 freq wildness (6) - 6 freq ill-best (6) - 1 freq widest (6) - 3 freq owldest (6) - 5 freq wilderness (6) - 14 freq eildest (6) - 2 freq waldies (7) - 10 freq aaldest (7) - 8 freq wildside (7) - 1 freq walthiest (7) - 1 freq aldest (7) - 1 freq windae-seat (7) - 1 freq weirdest (7) - 2 freq welders (7) - 2 freq wildcat (7) - 1 freq wilds (7) - 7 freq oldest (7) - 3 freq eldest (7) - 18 freq wurdiest (7) - 1 freq weeest (7) - 2 freq wild-ee'd (7) - 1 freq |
SoundEx code - W431 would've - 8 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.211691 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.363751 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.028693 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.038253 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.000871 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. |