| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hamilton (0) - 40 freq hamilton's (2) - 3 freq magilton (2) - 2 freq milton (2) - 4 freq hamilt (2) - 1 freq hilton (2) - 2 freq hairten (3) - 1 freq haltoun (3) - 1 freq hamelan (3) - 1 freq melton (3) - 1 freq hatton (3) - 1 freq hamil (3) - 2 freq chilton (3) - 1 freq hailsin (3) - 2 freq hailin (3) - 7 freq hamelorn (3) - 2 freq hailth (3) - 2 freq hametoon (3) - 5 freq charlton (3) - 2 freq jamieson (3) - 21 freq hackston (3) - 14 freq badminton (3) - 6 freq calton (3) - 10 freq hameilt (3) - 1 freq pilton (3) - 1 freq |
hamilton (0) - 40 freq hilton (3) - 2 freq milton (3) - 4 freq hamilt (3) - 1 freq hameilt (4) - 1 freq hametoon (4) - 5 freq holton (4) - 5 freq hamelaun (4) - 1 freq hamelt (4) - 72 freq hamelorn (4) - 2 freq humiliation (4) - 5 freq melton (4) - 1 freq haltoun (4) - 1 freq magilton (4) - 2 freq hamilton's (4) - 3 freq hamelan (4) - 1 freq jimhamilton (5) - 1 freq haldon (5) - 1 freq camelon (5) - 7 freq wilton (5) - 1 freq hanlon (5) - 2 freq hamlets (5) - 1 freq hallon (5) - 1 freq stilton (5) - 2 freq humilitie (5) - 1 freq |
SoundEx code - H543 haimelt - 5 freq hamelt - 72 freq hummlt - 3 freq hamilton - 40 freq haunled - 8 freq hamlets - 1 freq hummelt - 2 freq humiliatit - 2 freq humilitie - 1 freq hamlet's - 2 freq humiliate - 2 freq humiliation - 5 freq han-waaled - 2 freq humiliating - 1 freq han'led - 1 freq hum'led - 1 freq humiliated - 1 freq hamilton-megommerie - 1 freq humility - 2 freq hummled - 1 freq hannled - 2 freq hameilt - 1 freq 'hamlet' - 1 freq hamlet - 10 freq humelitie - 1 freq haunlit - 1 freq haunnilt - 1 freq hamilt - 1 freq haunnelt - 1 freq haunlet - 2 freq hamilton's - 3 freq hameldaeme - 1 freq hamiltondecor - 9 freq |
MetaPhone code - HMLTN hamilton - 40 freq |
HAMILTON |
| Time to execute Levenshtein function - 0.219622 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.381577 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.029799 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.041184 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.000894 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. |