Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
hummil (0) - 2 freq hummin (1) - 18 freq hummit (1) - 1 freq rummil (1) - 1 freq hummel (1) - 5 freq whummil (1) - 1 freq kummil (1) - 1 freq mummils (2) - 1 freq gummin (2) - 1 freq bummilt (2) - 1 freq hummy (2) - 1 freq summit (2) - 54 freq hummlt (2) - 3 freq huil (2) - 3 freq tummilt (2) - 8 freq humpit (2) - 1 freq hummed (2) - 10 freq mummilt (2) - 1 freq hammin (2) - 1 freq tummel (2) - 5 freq hummle (2) - 12 freq himmin (2) - 4 freq tummile (2) - 1 freq hummly (2) - 1 freq hummels (2) - 1 freq |
hummil (0) - 2 freq hummel (1) - 5 freq hummly (2) - 1 freq hummle (2) - 12 freq hummin (2) - 18 freq kummil (2) - 1 freq hummit (2) - 1 freq rummil (2) - 1 freq whummil (2) - 1 freq pummel (3) - 4 freq hamil (3) - 2 freq cummel (3) - 1 freq fammil (3) - 1 freq hummelt (3) - 2 freq bummel (3) - 1 freq humsel (3) - 3 freq hummer (3) - 2 freq wummily (3) - 2 freq rummile (3) - 1 freq hummels (3) - 1 freq wummile (3) - 1 freq hemmi (3) - 1 freq rummel (3) - 6 freq rummul (3) - 1 freq sammil (3) - 1 freq |
SoundEx code - H540 hamelie - 2 freq hamely - 45 freq hummle - 12 freq haunle - 26 freq hunnul - 4 freq hunnel - 4 freq hunnle - 2 freq hannel - 1 freq hannile - 1 freq hannle - 5 freq hummel - 5 freq homely - 2 freq hæmlie - 1 freq hanle - 4 freq hamnle - 1 freq hummil - 2 freq henley - 1 freq haunil - 1 freq hamley - 1 freq haunnil - 1 freq haunnle - 7 freq hummly - 1 freq haunel - 3 freq haemly - 1 freq hamil - 2 freq humilie - 1 freq hanlo - 1 freq |
MetaPhone code - HML humble - 27 freq hamelie - 2 freq hamely - 45 freq hummle - 12 freq humbly - 6 freq hummel - 5 freq homely - 2 freq hummil - 2 freq hamley - 1 freq hummly - 1 freq haemly - 1 freq hamil - 2 freq humilie - 1 freq |
HUMMIL |
Time to execute Levenshtein function - 0.267594 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.343960 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.028811 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.037485 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.000908 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. |