| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| waukrife (0) - 12 freq wakrife (1) - 1 freq waakrife (1) - 1 freq waukrif (1) - 2 freq darkrife (2) - 1 freq wakerife (2) - 2 freq waakrif (2) - 1 freq waakie (3) - 1 freq mirkrife (3) - 1 freq auldrife (3) - 1 freq painrife (3) - 1 freq caldrife (3) - 1 freq aurrie (3) - 1 freq maukie (3) - 1 freq maurice (3) - 4 freq aumrie (3) - 3 freq waurrit (3) - 1 freq waullie (3) - 2 freq wildrife (3) - 1 freq baukie (3) - 2 freq jaurie (3) - 1 freq walkie (3) - 5 freq taurrie (3) - 2 freq cauldrife (3) - 9 freq waurily (3) - 1 freq |
waukrife (0) - 12 freq waukrif (1) - 2 freq waakrife (1) - 1 freq wakrife (1) - 1 freq waakrif (2) - 1 freq wakerife (2) - 2 freq darkrife (4) - 1 freq wanryfe (4) - 1 freq winryfe (5) - 1 freq waurily (5) - 1 freq waeklike (5) - 1 freq warie (5) - 1 freq coulrife (5) - 4 freq warkie (5) - 1 freq wauknin (5) - 1 freq waurnae (5) - 1 freq waukin (5) - 24 freq mockrife (5) - 1 freq waurrit (5) - 1 freq waakie (5) - 1 freq mirkrife (5) - 1 freq auldrife (5) - 1 freq painrife (5) - 1 freq waukers (5) - 1 freq wildrife (5) - 1 freq |
SoundEx code - W261 waukrife - 12 freq wakerife - 2 freq wakrife - 1 freq waakrife - 1 freq washerwife - 1 freq waakrif - 1 freq waukrif - 2 freq wgsaraband - 14 freq wjrpntz - 1 freq |
MetaPhone code - WKRF waukrife - 12 freq wakerife - 2 freq wakrife - 1 freq waakrife - 1 freq waakrif - 1 freq waukrif - 2 freq |
WAUKRIFE |
| Time to execute Levenshtein function - 0.599647 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 - 1.379987 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.108399 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.114511 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.000755 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. |