Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
fleep (0) - 1 freq fleed (1) - 13 freq fleet (1) - 42 freq fleen (1) - 4 freq flee (1) - 197 freq pleep (1) - 3 freq sleep (1) - 406 freq bleep (1) - 2 freq fleer (1) - 124 freq leep (1) - 2 freq flees (1) - 73 freq fleeta (2) - 1 freq freed (2) - 13 freq sleept (2) - 1 freq flett (2) - 4 freq filee (2) - 1 freq flied (2) - 1 freq 'flees (2) - 1 freq aleen (2) - 97 freq flier (2) - 1 freq flewn (2) - 1 freq sleeps (2) - 47 freq feet (2) - 960 freq flet (2) - 30 freq deep (2) - 581 freq |
fleep (0) - 1 freq flees (2) - 73 freq leep (2) - 2 freq flyp (2) - 3 freq flp (2) - 2 freq flop (2) - 4 freq fleer (2) - 124 freq flip (2) - 9 freq flap (2) - 32 freq fleen (2) - 4 freq bleep (2) - 2 freq fleet (2) - 42 freq fleed (2) - 13 freq flee (2) - 197 freq sleep (2) - 406 freq pleep (2) - 3 freq fleece (3) - 11 freq flyer (3) - 1 freq slep (3) - 10 freq flaes (3) - 1 freq fleud (3) - 2 freq flea (3) - 11 freq leap (3) - 17 freq floe (3) - 1 freq fleit (3) - 2 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 |
FLEEP |
Time to execute Levenshtein function - 0.519507 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.467879 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.028343 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.047670 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.000918 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. |