| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fondly (0) - 8 freq fonly (1) - 1 freq hordly (2) - 1 freq fond (2) - 101 freq foody (2) - 2 freq lonely (2) - 38 freq fundy (2) - 1 freq fooly (2) - 1 freq boldly (2) - 8 freq fondue (2) - 1 freq dondy (2) - 1 freq foundry (2) - 4 freq soundly (2) - 3 freq fently (2) - 1 freq oddly (2) - 1 freq loudly (2) - 27 freq foondy (2) - 1 freq funday (2) - 1 freq monday (2) - 231 freq kindly (2) - 49 freq onnly (2) - 37 freq fonds (2) - 1 freq fynaly (2) - 3 freq foully (2) - 1 freq lonly (2) - 2 freq |
fondly (0) - 8 freq fonly (2) - 1 freq findlay (2) - 19 freq funday (3) - 1 freq kindly (3) - 49 freq kundly (3) - 1 freq fonds (3) - 1 freq condle (3) - 1 freq fiddly (3) - 1 freq fently (3) - 1 freq finely (3) - 3 freq fynaly (3) - 3 freq foondy (3) - 1 freq fondue (3) - 1 freq soundly (3) - 3 freq foundry (3) - 4 freq fundy (3) - 1 freq fond (3) - 101 freq sandle (4) - 1 freq foond (4) - 141 freq find (4) - 786 freq founder (4) - 3 freq finale (4) - 4 freq needly (4) - 4 freq finola (4) - 3 freq |
SoundEx code - F534 faintly - 12 freq fondly - 8 freq findlay - 19 freq fendless - 1 freq found'll - 1 freq findlater - 3 freq €œfundilymundily - 1 freq fently - 1 freq fundilymundily - 1 freq |
MetaPhone code - FNTL faintly - 12 freq fondly - 8 freq findlay - 19 freq vandal - 1 freq vauntily - 1 freq found'll - 1 freq fently - 1 freq vindaloo - 1 freq |
FONDLY |
| Time to execute Levenshtein function - 0.221192 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.368938 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.029460 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.046149 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.001039 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. |