| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wildflowers (0) - 1 freq wildflooers (1) - 6 freq wildflower (1) - 3 freq wild-flowers (1) - 1 freq wilefowlers (3) - 1 freq wildfloor (3) - 1 freq wildlawyers (3) - 1 freq mrsflowers (4) - 49 freq willpower (4) - 2 freq widower (4) - 2 freq followers (4) - 35 freq willowherb (4) - 1 freq cornflowers (4) - 1 freq flowers (4) - 15 freq sunflowers (4) - 3 freq leftowers (4) - 3 freq willows (4) - 4 freq wallopers (4) - 2 freq floeers (5) - 3 freq rodd-rowers (5) - 1 freq flowery (5) - 3 freq wilderness (5) - 14 freq villagers (5) - 5 freq willsher (5) - 1 freq fiddlers (5) - 9 freq |
wildflowers (0) - 1 freq wild-flowers (2) - 1 freq wildflower (2) - 3 freq wildflooers (2) - 6 freq wildlawyers (4) - 1 freq wildfloor (5) - 1 freq wilefowlers (6) - 1 freq cornflowers (7) - 1 freq flowers (7) - 15 freq willows (7) - 4 freq sunflowers (7) - 3 freq mrsflowers (7) - 49 freq leftowers (7) - 3 freq wallopers (7) - 2 freq followers (7) - 35 freq wildlaw (8) - 13 freq welders (8) - 2 freq wildfire (8) - 4 freq floowers (8) - 1 freq willpower (8) - 2 freq willowherb (8) - 1 freq widower (8) - 2 freq word-power (9) - 1 freq widows (9) - 4 freq willowbrae (9) - 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 - WLTFLWRS wild-flowers - 1 freq wildflowers - 1 freq |
WILDFLOWERS |
| Time to execute Levenshtein function - 0.209760 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.397454 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.028377 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.051316 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.000909 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. |