Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
fendless (0) - 1 freq endless (1) - 51 freq deedless (2) - 1 freq fondness (2) - 6 freq enless (2) - 12 freq freendless (2) - 1 freq heidless (2) - 12 freq endiess (2) - 1 freq tentless (2) - 7 freq handless (2) - 3 freq heedless (2) - 6 freq vyndless (2) - 2 freq fenders (2) - 1 freq needless (2) - 16 freq wyndless (2) - 1 freq freindless (2) - 1 freq headless (2) - 1 freq mindless (2) - 3 freq fekless (2) - 1 freq endliss (2) - 1 freq fearless (2) - 9 freq feckless (2) - 14 freq fendiness (2) - 1 freq cenless (2) - 1 freq soondless (3) - 2 freq |
fendless (0) - 1 freq endless (2) - 51 freq wyndless (3) - 1 freq freindless (3) - 1 freq needless (3) - 16 freq fendiness (3) - 1 freq endliss (3) - 1 freq vyndless (3) - 2 freq mindless (3) - 3 freq handless (3) - 3 freq freendless (3) - 1 freq fondness (3) - 6 freq cenless (4) - 1 freq boundless (4) - 1 freq haundless (4) - 1 freq soundless (4) - 1 freq feckless (4) - 14 freq soondless (4) - 2 freq haandless (4) - 1 freq foandness (4) - 1 freq fondniss (4) - 1 freq endiess (4) - 1 freq deedless (4) - 1 freq fearless (4) - 9 freq tentless (4) - 7 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 - FNTLS 'vandalise - 1 freq vandals - 4 freq vyndlis - 2 freq vyndless - 2 freq vandal's - 1 freq fendless - 1 freq vandalise - 1 freq vandalize - 1 freq vindaloos - 1 freq |
FENDLESS |
Time to execute Levenshtein function - 0.198884 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.390859 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.028089 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.037685 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.000865 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. |