Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
flav (0) - 1 freq flat (1) - 274 freq plav (1) - 1 freq flab (1) - 2 freq flag (1) - 70 freq fav (1) - 7 freq flax (1) - 3 freq flam (1) - 3 freq flaw (1) - 8 freq flan (1) - 3 freq flap (1) - 32 freq olav (1) - 1 freq flava (1) - 1 freq flae (1) - 2 freq flak (1) - 6 freq flay (1) - 2 freq floo (2) - 1 freq flask (2) - 23 freq lae (2) - 28 freq fhv (2) - 1 freq lava (2) - 4 freq fleh (2) - 2 freq fay (2) - 11 freq fcv (2) - 1 freq clag (2) - 4 freq |
flav (0) - 1 freq flava (1) - 1 freq flap (2) - 32 freq flan (2) - 3 freq olav (2) - 1 freq flae (2) - 2 freq flak (2) - 6 freq flaw (2) - 8 freq flay (2) - 2 freq plav (2) - 1 freq flam (2) - 3 freq flab (2) - 2 freq flat (2) - 274 freq flag (2) - 70 freq flax (2) - 3 freq fav (2) - 7 freq fly (3) - 183 freq flor (3) - 1 freq flane (3) - 2 freq fuv (3) - 1 freq fley (3) - 1 freq flr (3) - 3 freq cliv (3) - 1 freq fala (3) - 1 freq fll (3) - 1 freq |
SoundEx code - F410 flip - 9 freq flap - 32 freq floppy - 5 freq fluffy - 20 freq flype - 3 freq flyp - 3 freq flaff - 5 freq flab - 2 freq flee-up - 2 freq follae-up - 4 freq follow-up - 2 freq flop - 4 freq fluff - 5 freq fleep - 1 freq flyb - 1 freq flava - 1 freq flav - 1 freq flp - 2 freq |
MetaPhone code - FLF fluffy - 20 freq flaff - 5 freq valve - 1 freq philiphaugh - 2 freq philiphaw - 1 freq fluff - 5 freq vallvé - 1 freq vulva - 1 freq vlv - 1 freq flava - 1 freq flav - 1 freq volvo - 2 freq |
FLAV |
Time to execute Levenshtein function - 0.210459 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.344529 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.027612 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.037813 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.001182 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. |