| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| whammle (0) - 2 freq shammle (1) - 1 freq whammled (1) - 1 freq wammle (1) - 2 freq whummle (1) - 7 freq whammlet (1) - 1 freq hummle (2) - 12 freq wummle (2) - 1 freq whummlet (2) - 1 freq whammy (2) - 2 freq ruammle (2) - 1 freq brammle (2) - 2 freq thimmle (2) - 4 freq rammle (2) - 3 freq hamnle (2) - 1 freq whammlin (2) - 1 freq whale (2) - 32 freq whummled (2) - 7 freq wammled (2) - 5 freq whummles (2) - 1 freq whummlle (2) - 1 freq whammelt (2) - 1 freq 'rammle' (3) - 1 freq whaim (3) - 1 freq wha're (3) - 4 freq |
whammle (0) - 2 freq whummle (1) - 7 freq whammlet (2) - 1 freq whammled (2) - 1 freq wammle (2) - 2 freq shammle (2) - 1 freq whummles (3) - 1 freq whummlle (3) - 1 freq whummled (3) - 7 freq thimmle (3) - 4 freq whummil (3) - 1 freq whammlin (3) - 1 freq whammy (3) - 2 freq hummle (3) - 12 freq wummle (3) - 1 freq whummlet (3) - 1 freq whammelt (3) - 1 freq whummlin (4) - 2 freq hummly (4) - 1 freq wummile (4) - 1 freq chamomile (4) - 1 freq whummelt (4) - 5 freq whummilt (4) - 2 freq brammle (4) - 2 freq rammle (4) - 3 freq |
SoundEx code - W540 whummlle - 1 freq wean'll - 3 freq whummle - 7 freq wainly - 1 freq whammle - 2 freq winmill - 1 freq wine'll - 1 freq wheen'll - 1 freq win'll - 1 freq whummil - 1 freq wummile - 1 freq wammle - 2 freq wummle - 1 freq wummily - 2 freq wan-nil - 1 freq wenl - 1 freq weenell - 8 freq wnl - 1 freq |
MetaPhone code - WML whummlle - 1 freq wimble - 1 freq whummle - 7 freq whammle - 2 freq wembley - 1 freq whummil - 1 freq wummile - 1 freq wammle - 2 freq wummle - 1 freq wummily - 2 freq |
WHAMMLE |
| Time to execute Levenshtein function - 0.222014 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.363666 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.027644 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.037217 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.000879 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. |