| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gluffit (0) - 1 freq pluffit (1) - 1 freq glufft (1) - 2 freq lufit (2) - 1 freq gluttit (2) - 1 freq bluffin (2) - 1 freq gluffy (2) - 2 freq gluff (2) - 19 freq gliffie (2) - 1 freq puffit (2) - 3 freq chuffit (2) - 2 freq gluffed (2) - 10 freq guffie (2) - 3 freq wauffit (2) - 1 freq pluffin (2) - 2 freq luftit (2) - 7 freq gluggit (2) - 1 freq pluffie (2) - 1 freq stuffit (2) - 1 freq guffin (2) - 1 freq luftin (3) - 2 freq glebefit (3) - 2 freq glut (3) - 5 freq guffed (3) - 4 freq fludit (3) - 1 freq |
gluffit (0) - 1 freq glufft (1) - 2 freq pluffit (2) - 1 freq gliffie (3) - 1 freq gluffed (3) - 10 freq gluffy (3) - 2 freq gluff (3) - 19 freq gliffed (4) - 3 freq guffin (4) - 1 freq stuffit (4) - 1 freq gliffs (4) - 6 freq glebefit (4) - 2 freq graffiti (4) - 7 freq gliff (4) - 35 freq pluffie (4) - 1 freq gluggit (4) - 1 freq lufit (4) - 1 freq gluttit (4) - 1 freq bluffin (4) - 1 freq puffit (4) - 3 freq chuffit (4) - 2 freq luftit (4) - 7 freq wauffit (4) - 1 freq pluffin (4) - 2 freq guffie (4) - 3 freq |
SoundEx code - G413 gluepot - 1 freq gloved - 4 freq gliffed - 3 freq galloped - 7 freq gallovidian - 1 freq globed - 1 freq gulpit - 3 freq gluffed - 10 freq gleeved - 1 freq golloped - 4 freq glaepit - 4 freq glaip'd - 1 freq glaipid - 1 freq gulped - 7 freq glivved - 1 freq glufft - 2 freq gluffit - 1 freq glovit - 1 freq glippit - 1 freq gullpit - 1 freq galevitchin - 1 freq glbtm - 1 freq |
MetaPhone code - KLFT gloved - 4 freq qualified - 15 freq gliffed - 3 freq cleft - 5 freq qualifeed - 1 freq qualifee'd - 1 freq gluffed - 10 freq gleeved - 1 freq culfed - 4 freq caliphate - 1 freq cleaved - 2 freq claught - 49 freq clift - 3 freq glivved - 1 freq glufft - 2 freq gluffit - 1 freq calved - 1 freq glovit - 1 freq cleavit - 1 freq |
GLUFFIT |
| Time to execute Levenshtein function - 0.387264 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.553953 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.027619 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.037573 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.000930 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. |