| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fently (0) - 1 freq gently (1) - 83 freq ently (1) - 2 freq dently (1) - 1 freq fenton (2) - 8 freq sentle (2) - 1 freq mintly (2) - 1 freq factly (2) - 1 freq faitly (2) - 2 freq denty (2) - 6 freq fettle (2) - 23 freq tenty (2) - 6 freq fent (2) - 11 freq flatly (2) - 2 freq dentily (2) - 1 freq jyntly (2) - 3 freq femely (2) - 1 freq feenty (2) - 1 freq fentin (2) - 2 freq fonly (2) - 1 freq jentle (2) - 2 freq ferrly (2) - 28 freq bentley (2) - 4 freq sentry (2) - 4 freq femily (2) - 21 freq |
fently (0) - 1 freq dently (2) - 1 freq faintly (2) - 12 freq ently (2) - 2 freq gently (2) - 83 freq fitly (3) - 1 freq neatly (3) - 26 freq fentit (3) - 3 freq bentley (3) - 4 freq finely (3) - 3 freq jentle (3) - 2 freq fluently (3) - 5 freq fondly (3) - 8 freq fleetly (3) - 1 freq gentle (3) - 79 freq gentily (3) - 4 freq fonly (3) - 1 freq tentily (3) - 22 freq huntly (3) - 18 freq fynaly (3) - 3 freq fentin (3) - 2 freq fettle (3) - 23 freq fent (3) - 11 freq factly (3) - 1 freq mintly (3) - 1 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 |
FENTLY |
| Time to execute Levenshtein function - 0.196075 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.341814 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.027128 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.036869 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.000873 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. |