| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fcv (0) - 1 freq fhv (1) - 1 freq ccv (1) - 1 freq ecv (1) - 1 freq fuv (1) - 1 freq fav (1) - 7 freq fc (1) - 54 freq cv (1) - 4 freq fev (1) - 1 freq fca (1) - 1 freq fv (1) - 3 freq tcg (2) - 1 freq ful (2) - 51 freq flu (2) - 36 freq fau (2) - 1 freq bck (2) - 1 freq fiq (2) - 1 freq f (2) - 187 freq rcs (2) - 2 freq ic (2) - 6 freq fog (2) - 34 freq nav (2) - 3 freq foy (2) - 35 freq v (2) - 266 freq ebv (2) - 1 freq |
fcv (0) - 1 freq cv (2) - 4 freq fca (2) - 1 freq fv (2) - 3 freq fc (2) - 54 freq fev (2) - 1 freq fav (2) - 7 freq fhv (2) - 1 freq ccv (2) - 1 freq ecv (2) - 1 freq fuv (2) - 1 freq fock (3) - 288 freq fack (3) - 180 freq fyve (3) - 8 freq faiv (3) - 1 freq fech (3) - 1 freq ofc (3) - 1 freq efc (3) - 1 freq fic (3) - 1 freq fecl (3) - 1 freq furv (3) - 1 freq facs (3) - 1 freq foc' (3) - 1 freq fvy (3) - 1 freq cva (3) - 1 freq |
SoundEx code - F210 fishwife - 2 freq facefu - 2 freq feckfu - 12 freq fekfu - 8 freq fishwifie - 1 freq fozie-bie - 1 freq fackfu - 1 freq fazziboy - 4 freq fjb - 2 freq fzbh - 1 freq fycpp - 1 freq fozzybhoy - 1 freq fqqf - 1 freq fsb - 1 freq fckxf - 1 freq fuzxv - 1 freq fcv - 1 freq fkbv - 3 freq fkgb - 1 freq |
MetaPhone code - FKF feckfu - 12 freq fekfu - 8 freq fackfu - 1 freq fqqf - 1 freq vqgh - 1 freq hfucva - 1 freq fcv - 1 freq |
FCV |
| Time to execute Levenshtein function - 0.380468 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.820758 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.074758 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.083225 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.000857 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. |