| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| blipped (0) - 1 freq flipped (1) - 5 freq clipped (1) - 8 freq slipped (1) - 45 freq whipped (2) - 8 freq clippet (2) - 2 freq slipper (2) - 4 freq lippen (2) - 68 freq clipper (2) - 3 freq flippid (2) - 1 freq lisped (2) - 1 freq plapped (2) - 1 freq limped (2) - 1 freq blissed (2) - 9 freq flopped (2) - 3 freq plopped (2) - 1 freq dipped (2) - 23 freq slippen (2) - 1 freq chipped (2) - 14 freq sipped (2) - 6 freq slopped (2) - 1 freq glimped (2) - 2 freq snipped (2) - 6 freq wipped (2) - 1 freq shipped (2) - 4 freq |
blipped (0) - 1 freq flipped (2) - 5 freq slipped (2) - 45 freq clipped (2) - 8 freq plopped (3) - 1 freq lapped (3) - 4 freq slopped (3) - 1 freq clapped (3) - 28 freq flapped (3) - 3 freq bopped (3) - 1 freq lopped (3) - 1 freq flopped (3) - 3 freq plapped (3) - 1 freq slippid (3) - 3 freq flippid (3) - 1 freq slapped (3) - 14 freq climped (4) - 1 freq blitzed (4) - 1 freq leppid (4) - 1 freq blinded (4) - 4 freq cliped (4) - 1 freq lipper (4) - 14 freq flipper (4) - 2 freq quipped (4) - 1 freq lippend (4) - 1 freq |
SoundEx code - B413 beloved - 25 freq believe't - 4 freq believed - 48 freq belovit - 5 freq believt - 1 freq bluffed - 1 freq bloviation - 1 freq bluebottle - 8 freq bluebottle's - 4 freq bluebottles - 3 freq believ't - 1 freq beluvit - 7 freq beluved - 1 freq bileeved - 1 freq bowl-fitted - 1 freq baeloved - 1 freq baelieved - 1 freq believit - 3 freq bull-bait - 2 freq bull-bate - 3 freq bull-bait's - 2 freq blabbit - 1 freq belly-button - 1 freq belevit - 1 freq beleved - 2 freq blue-bottle - 1 freq believet - 1 freq bloviate - 1 freq balbutt - 8 freq belouvit - 1 freq bull-beat - 2 freq belabedboots - 4 freq blipped - 1 freq |
MetaPhone code - BLPT blipped - 1 freq |
BLIPPED |
| Time to execute Levenshtein function - 0.192832 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.335689 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.027797 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.037663 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.000818 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. |