| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| haemly (0) - 1 freq faemly (1) - 1 freq hummly (2) - 1 freq laekly (2) - 29 freq caumly (2) - 8 freq warmly (2) - 4 freq haels (2) - 1 freq famly (2) - 5 freq raelly (2) - 67 freq aerly (2) - 19 freq faemy (2) - 2 freq hally (2) - 1 freq hammy (2) - 7 freq haurly (2) - 16 freq hael (2) - 9 freq haelt (2) - 3 freq aenly (2) - 1 freq haily (2) - 27 freq amly (2) - 1 freq hailly (2) - 8 freq haly (2) - 60 freq seemly (2) - 1 freq hae'll (2) - 4 freq hardly (2) - 215 freq haem (2) - 53 freq |
haemly (0) - 1 freq hamley (2) - 1 freq faemly (2) - 1 freq hamely (2) - 45 freq halely (3) - 7 freq femly (3) - 3 freq seemly (3) - 1 freq haly (3) - 60 freq hiely (3) - 1 freq haem (3) - 53 freq healy (3) - 4 freq heely (3) - 1 freq hamil (3) - 2 freq hazily (3) - 1 freq harly (3) - 13 freq faimly (3) - 185 freq hailly (3) - 8 freq helly (3) - 16 freq homely (3) - 2 freq hammy (3) - 7 freq haurly (3) - 16 freq hally (3) - 1 freq famly (3) - 5 freq hummly (3) - 1 freq hael (3) - 9 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 |
HAEMLY |
| Time to execute Levenshtein function - 0.226241 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.368574 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.031582 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.037227 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.000867 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. |