| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| flop (0) - 4 freq flip (1) - 8 freq flok (1) - 1 freq flog (1) - 1 freq flor (1) - 1 freq plop (1) - 4 freq flyp (1) - 3 freq floe (1) - 1 freq flap (1) - 32 freq flp (1) - 2 freq flo (1) - 7 freq flou (1) - 1 freq slop (1) - 2 freq flops (1) - 6 freq floo (1) - 1 freq flow (1) - 30 freq flot (1) - 2 freq fleg (2) - 84 freq fom (2) - 2 freq cclop (2) - 1 freq op (2) - 7 freq poop (2) - 3 freq plowp (2) - 3 freq floyd (2) - 3 freq hop (2) - 13 freq |
flop (0) - 4 freq flap (1) - 32 freq flyp (1) - 3 freq flip (1) - 8 freq flp (1) - 2 freq floo (2) - 1 freq flow (2) - 30 freq flot (2) - 2 freq fleep (2) - 1 freq flype (2) - 3 freq slop (2) - 2 freq flops (2) - 6 freq flor (2) - 1 freq flou (2) - 1 freq flog (2) - 1 freq flok (2) - 1 freq plop (2) - 4 freq floe (2) - 1 freq flo (2) - 7 freq floer (3) - 2 freq lep (3) - 5 freq floes (3) - 1 freq clip (3) - 36 freq clap (3) - 53 freq felon (3) - 2 freq |
SoundEx code - F410 flip - 8 freq flap - 32 freq floppy - 5 freq fluffy - 17 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 - FLP philp - 10 freq flip - 8 freq philip - 19 freq flap - 32 freq floppy - 5 freq flype - 3 freq flyp - 3 freq valpo - 1 freq philippe - 1 freq philippi - 1 freq phïlip - 2 freq flee-up - 2 freq phillipi - 1 freq pheelip - 2 freq follae-up - 4 freq follow-up - 2 freq phílip - 1 freq flop - 4 freq phillip - 2 freq philope - 2 freq fleep - 1 freq vlp - 1 freq philippaw - 8 freq philippa - 2 freq flp - 2 freq |
FLOP |
| Time to execute Levenshtein function - 0.203072 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.327604 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.028009 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.037703 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.000839 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. |