| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| featureless (0) - 1 freq measureless (2) - 1 freq futurless (3) - 1 freq fearless (3) - 10 freq features' (3) - 1 freq features (3) - 45 freq faultless (4) - 1 freq fauseness (4) - 2 freq careless (4) - 10 freq featurs (4) - 14 freq tuneless (4) - 2 freq faceless (4) - 5 freq stateless (4) - 2 freq feature (4) - 43 freq barreless (4) - 3 freq heartless (4) - 6 freq fireless (4) - 3 freq fatures (4) - 1 freq natheless (4) - 2 freq yearless (4) - 1 freq meatless (4) - 1 freq tireless (4) - 1 freq fathomless (4) - 1 freq furmless (4) - 1 freq heatless (4) - 1 freq |
featureless (0) - 1 freq futurless (3) - 1 freq measureless (4) - 1 freq fearless (4) - 10 freq fireless (5) - 3 freq tireless (5) - 1 freq features' (5) - 1 freq features (5) - 45 freq heatless (6) - 1 freq fathomless (6) - 1 freq leaderless (6) - 1 freq furmless (6) - 1 freq faithless (6) - 5 freq faitherless (6) - 3 freq treeless (6) - 3 freq flouerless (6) - 1 freq meatless (6) - 1 freq faiderless (6) - 1 freq yearless (6) - 1 freq tuneless (6) - 2 freq featurs (6) - 14 freq careless (6) - 10 freq faultless (6) - 1 freq stateless (6) - 2 freq faceless (6) - 5 freq |
SoundEx code - F364 faitherless - 3 freq futurless - 1 freq faitherly - 1 freq federal - 5 freq faither'll - 1 freq faiderly - 1 freq faiderless - 1 freq faitherlike - 1 freq food-relatit - 1 freq featureless - 1 freq fatherly - 1 freq federalism - 1 freq |
MetaPhone code - FTRLS futurless - 1 freq faiderless - 1 freq featureless - 1 freq |
FEATURELESS |
| Time to execute Levenshtein function - 0.237813 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.385688 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.028794 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.038700 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.001063 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. |