| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| findlay (0) - 19 freq finlay (1) - 18 freq finlayp (2) - 1 freq yinday (2) - 1 freq fiddly (2) - 1 freq kindly (2) - 49 freq findan (2) - 6 freq finely (2) - 3 freq finally (2) - 306 freq finola (2) - 3 freq lindsay (2) - 7 freq funday (2) - 1 freq finlan (2) - 1 freq fondly (2) - 8 freq dinkly (3) - 5 freq indyah (3) - 1 freq inda (3) - 1 freq fundy (3) - 1 freq fynaly (3) - 3 freq fiddled (3) - 1 freq yirdly (3) - 1 freq filla (3) - 1 freq windas (3) - 4 freq fin'al (3) - 1 freq fiddles (3) - 18 freq |
findlay (0) - 19 freq fondly (2) - 8 freq finlay (2) - 18 freq finally (3) - 306 freq funday (3) - 1 freq finola (3) - 3 freq finely (3) - 3 freq findan (3) - 6 freq fiddly (3) - 1 freq kindly (3) - 49 freq fiddle (4) - 65 freq finds (4) - 39 freq fynally (4) - 4 freq kindlie (4) - 3 freq fently (4) - 1 freq mandalay (4) - 1 freq sindle (4) - 1 freq fingle (4) - 1 freq fendan (4) - 1 freq final (4) - 166 freq finder (4) - 5 freq windle (4) - 1 freq fonly (4) - 1 freq findoca (4) - 3 freq friendly (4) - 43 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.202453 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.376709 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.032378 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.040397 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.001002 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. |