| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| weefla (0) - 47 freq weeflas (1) - 3 freq weell (2) - 1 freq weefla's (2) - 3 freq weeel (2) - 3 freq weel (2) - 3975 freq weffle (2) - 1 freq weel- (2) - 1 freq weebly (2) - 1 freq weekly (2) - 25 freq weeda (2) - 25 freq eela (2) - 3 freq weegle (2) - 1 freq weell' (2) - 2 freq heelan (3) - 7 freq woeful (3) - 4 freq weesh (3) - 11 freq heera (3) - 3 freq adela (3) - 4 freq weesht (3) - 11 freq teefs (3) - 1 freq wae'll (3) - 14 freq werra (3) - 1 freq weerd (3) - 1 freq woefae (3) - 1 freq |
weefla (0) - 47 freq weeflas (2) - 3 freq wifle (3) - 1 freq weegle (3) - 1 freq woeful (3) - 4 freq weekly (3) - 25 freq weebly (3) - 1 freq weeel (3) - 3 freq weel (3) - 3975 freq weell (3) - 1 freq weffle (3) - 1 freq weakly (4) - 6 freq willa (4) - 3 freq wiel (4) - 1 freq waefu' (4) - 1 freq wael (4) - 9 freq waffle (4) - 8 freq wely (4) - 1 freq weft (4) - 6 freq whele (4) - 1 freq aweel (4) - 4 freq we'el (4) - 5 freq weal (4) - 8 freq wenl (4) - 1 freq we'l (4) - 7 freq |
SoundEx code - W140 whauphill - 1 freq wife'll - 2 freq wobbly - 6 freq woeful - 4 freq wifely - 2 freq wabblie - 1 freq wabble - 3 freq wheeple - 2 freq weefla - 47 freq waffle - 8 freq waefully - 4 freq wheipil - 3 freq weffle - 1 freq wifle - 1 freq woful - 2 freq wobully - 1 freq weebly - 1 freq woefully - 2 freq wobble - 2 freq |
MetaPhone code - WFL whauphill - 1 freq wife'll - 2 freq woeful - 4 freq wifely - 2 freq weefla - 47 freq waffle - 8 freq waefully - 4 freq weffle - 1 freq wifle - 1 freq woful - 2 freq woefully - 2 freq |
WEEFLA |
| Time to execute Levenshtein function - 0.199729 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.354213 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.027344 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.037074 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.000916 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. |