| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| flp (0) - 2 freq vlp (1) - 1 freq flu (1) - 36 freq flc (1) - 1 freq fly (1) - 183 freq flo (1) - 7 freq fvp (1) - 1 freq fl (1) - 3 freq flap (1) - 32 freq fll (1) - 1 freq alp (1) - 1 freq flop (1) - 4 freq flr (1) - 3 freq zlp (1) - 1 freq flip (1) - 9 freq fp (1) - 4 freq flyp (1) - 3 freq klp (1) - 1 freq lp (1) - 8 freq wl (2) - 6 freq ola (2) - 1 freq far (2) - 1549 freq hlf (2) - 2 freq fold (2) - 18 freq pop (2) - 82 freq |
flp (0) - 2 freq flop (1) - 4 freq flyp (1) - 3 freq flap (1) - 32 freq flip (1) - 9 freq klp (2) - 1 freq flo (2) - 7 freq fp (2) - 4 freq lp (2) - 8 freq flype (2) - 3 freq vlp (2) - 1 freq fleep (2) - 1 freq zlp (2) - 1 freq flu (2) - 36 freq fl (2) - 3 freq fly (2) - 183 freq fvp (2) - 1 freq fll (2) - 1 freq flr (2) - 3 freq flc (2) - 1 freq alp (2) - 1 freq flit (3) - 64 freq efl (3) - 2 freq flet (3) - 30 freq flat (3) - 274 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 - FLP philp - 10 freq flip - 9 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 |
FLP |
| Time to execute Levenshtein function - 0.453550 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.797484 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.029224 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.081774 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.000846 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. |