| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| findlay (0) - 19 freq finlay (1) - 18 freq finlan (2) - 1 freq funday (2) - 1 freq finally (2) - 296 freq fondly (2) - 8 freq yinday (2) - 1 freq kindly (2) - 48 freq finlayp (2) - 1 freq findan (2) - 6 freq lindsay (2) - 6 freq finola (2) - 1 freq finely (2) - 3 freq inklan (3) - 1 freq findins (3) - 4 freq indian (3) - 32 freq kingly (3) - 1 freq ridley (3) - 2 freq munday (3) - 1 freq tingly (3) - 2 freq fin'al (3) - 1 freq pindar (3) - 1 freq fiedles (3) - 2 freq mindmap (3) - 1 freq fidgy (3) - 1 freq |
findlay (0) - 19 freq finlay (2) - 18 freq fondly (2) - 8 freq finola (3) - 1 freq finely (3) - 3 freq kindly (3) - 48 freq findan (3) - 6 freq finally (3) - 296 freq funday (3) - 1 freq fiddle (4) - 52 freq fently (4) - 1 freq fandan (4) - 7 freq fonly (4) - 1 freq windle (4) - 1 freq fynally (4) - 4 freq fynaly (4) - 3 freq tindal (4) - 4 freq fingle (4) - 1 freq fianally (4) - 1 freq finder (4) - 5 freq kindlie (4) - 3 freq findin (4) - 71 freq finds (4) - 35 freq findoca (4) - 3 freq faintly (4) - 12 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 |
FINDLAY |
| Time to execute Levenshtein function - 0.194561 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.378793 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.028883 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.037187 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.000980 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. |