| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hummel (0) - 5 freq bummel (1) - 1 freq cummel (1) - 1 freq hummer (1) - 2 freq tummel (1) - 5 freq rummel (1) - 6 freq humsel (1) - 3 freq hummels (1) - 1 freq hummed (1) - 10 freq hummil (1) - 2 freq hummelt (1) - 2 freq pummel (1) - 4 freq rommel (2) - 1 freq hunnel (2) - 4 freq hume (2) - 10 freq thumsel (2) - 1 freq bummer (2) - 21 freq hemmer (2) - 21 freq pummelt (2) - 1 freq lummed (2) - 2 freq hursel (2) - 14 freq cummed (2) - 1 freq himmer (2) - 1 freq gemmel (2) - 1 freq hemmed (2) - 3 freq |
hummel (0) - 5 freq hummil (1) - 2 freq pummel (2) - 4 freq cummel (2) - 1 freq hummle (2) - 12 freq bummel (2) - 1 freq hummly (2) - 1 freq hummed (2) - 10 freq hummelt (2) - 2 freq hummer (2) - 2 freq rummel (2) - 6 freq tummel (2) - 5 freq hummels (2) - 1 freq humsel (2) - 3 freq kummil (3) - 1 freq rammel (3) - 1 freq pommel (3) - 1 freq himsel (3) - 852 freq demmel (3) - 1 freq rummul (3) - 1 freq hummy (3) - 1 freq rummil (3) - 1 freq tommel (3) - 1 freq whummil (3) - 1 freq hummles (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 - 26 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 |
HUMMEL |
| Time to execute Levenshtein function - 0.707017 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.197197 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.100776 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.095682 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.000747 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. |