| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fraerful (0) - 1 freq faerful (1) - 2 freq fretful (2) - 2 freq fearful (2) - 10 freq ferful (2) - 2 freq graetful (2) - 1 freq ferfil (3) - 7 freq fearfu (3) - 15 freq earful (3) - 2 freq fruitful (3) - 2 freq forgetful (3) - 2 freq cheerful (3) - 3 freq fairfal (3) - 1 freq ferfull (3) - 2 freq graceful (3) - 10 freq pouerful (3) - 3 freq fateful (3) - 3 freq grateful (3) - 33 freq tearful (3) - 2 freq ferfal (3) - 8 freq pooerful (3) - 10 freq powerful (3) - 21 freq fowerfaul (3) - 1 freq forceful (3) - 2 freq frae's (4) - 2 freq |
fraerful (0) - 1 freq faerful (2) - 2 freq ferful (3) - 2 freq fearful (3) - 10 freq fretful (3) - 2 freq fowerfaul (4) - 1 freq fairfal (4) - 1 freq fruitful (4) - 2 freq ferfil (4) - 7 freq graetful (4) - 1 freq forceful (4) - 2 freq ferfal (4) - 8 freq powerful (5) - 21 freq barraful (5) - 1 freq sorraeful (5) - 1 freq tearful (5) - 2 freq farrell (5) - 1 freq freffly (5) - 1 freq pooerful (5) - 10 freq fearfu (5) - 15 freq grateful (5) - 33 freq forgetful (5) - 2 freq earful (5) - 2 freq ferfull (5) - 2 freq cheerful (5) - 3 freq |
SoundEx code - F661 far-ower-far - 1 freq fraerful - 1 freq farrer-ben - 1 freq ferrer-ben - 1 freq |
MetaPhone code - FRRFL fraerful - 1 freq |
FRAERFUL |
| Time to execute Levenshtein function - 0.226870 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.428402 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.043357 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.037020 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.000929 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. |