| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wildfloor (0) - 1 freq wildflower (2) - 3 freq wildflooers (2) - 6 freq wildflowers (3) - 1 freq wildwood (3) - 1 freq vindaloos (4) - 1 freq wilford (4) - 1 freq kildour (4) - 2 freq willpooer (4) - 1 freq €˜floor (4) - 3 freq wild-flowers (4) - 1 freq willow' (4) - 1 freq willock (4) - 1 freq i'door (4) - 1 freq misdoor (4) - 1 freq willow (4) - 15 freq wilder (4) - 4 freq wildlife (4) - 15 freq willows (4) - 4 freq floor (4) - 87 freq willno (4) - 1 freq wildly (4) - 7 freq willox (4) - 1 freq vindaloo (4) - 1 freq sunfloor (4) - 1 freq |
wildfloor (0) - 1 freq wildflooers (3) - 6 freq wildflower (3) - 3 freq wildflowers (5) - 1 freq wildfire (5) - 4 freq caulifloor (6) - 8 freq wildly (6) - 7 freq wildlife (6) - 15 freq wilder (6) - 4 freq wildlaw (6) - 13 freq wildwood (6) - 1 freq caaliflooer (7) - 1 freq cauliflooer (7) - 2 freq willox (7) - 1 freq sunfloor (7) - 1 freq waller (7) - 1 freq willno (7) - 1 freq wilful (7) - 2 freq windfall (7) - 1 freq windsor (7) - 8 freq wilfully (7) - 1 freq floor (7) - 87 freq wild-flowers (7) - 1 freq €˜floor (7) - 3 freq willpooer (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 wouldÂ’ve - 1 freq wildwifeodanort - 1 freq wildflower - 3 freq |
MetaPhone code - WLTFLR wildfloor - 1 freq |
WILDFLOOR |
| Time to execute Levenshtein function - 0.410521 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.800635 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.082558 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.087142 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.000976 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. |