Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
wildlifeni (0) - 2 freq wildlife (2) - 15 freq wildrife (3) - 1 freq wilelife (3) - 2 freq wildlifemag (3) - 1 freq willen (4) - 4 freq willie (4) - 197 freq willile (4) - 1 freq willie's (4) - 22 freq willeen (4) - 2 freq willni (4) - 2 freq williew (4) - 1 freq wildfire (4) - 4 freq willint (4) - 5 freq willies (4) - 6 freq wiwildlife (4) - 1 freq willin (4) - 59 freq mildlie (4) - 1 freq willin' (4) - 3 freq willing (4) - 10 freq wildside (4) - 1 freq wellie (5) - 2 freq billion (5) - 34 freq ill-end (5) - 1 freq wilkin (5) - 2 freq |
wildlifeni (0) - 2 freq wildlife (3) - 15 freq wilelife (5) - 2 freq wildlifemag (5) - 1 freq wildrife (5) - 1 freq wildfire (6) - 4 freq wiwildlife (6) - 1 freq willin (6) - 59 freq willni (6) - 2 freq willeen (6) - 2 freq willen (6) - 4 freq waddlin (7) - 2 freq willna (7) - 25 freq windolene (7) - 2 freq wullin (7) - 23 freq willfu (7) - 1 freq will'n (7) - 3 freq wellen (7) - 1 freq wellin (7) - 5 freq wildly (7) - 7 freq weildin (7) - 1 freq willan (7) - 5 freq willno (7) - 1 freq weldin (7) - 1 freq willnae (7) - 101 freq |
SoundEx code - W434 wildly - 7 freq wieltly - 1 freq 'wildlaw' - 1 freq wildlife - 15 freq weel-tellt - 2 freq wildlaw - 13 freq €˜wildlaw - 4 freq wildlawyers - 1 freq wild-leukin - 1 freq wildlifephotography - 4 freq wildlifeni - 2 freq wildlifemag - 1 freq wiwildlife - 1 freq |
MetaPhone code - WLTLFN wildlifeni - 2 freq |
WILDLIFENI |
Time to execute Levenshtein function - 0.456732 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.696189 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.027706 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.088351 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.000958 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. |