| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gluepot (0) - 1 freq glaepit (2) - 4 freq glent (3) - 30 freq bluest (3) - 1 freq gruppit (3) - 23 freq lumpit (3) - 1 freq clumpit (3) - 1 freq glufft (3) - 2 freq giepit (3) - 5 freq gulpit (3) - 3 freq gluffit (3) - 1 freq glue (3) - 20 freq gauspit (3) - 1 freq sleepet (3) - 1 freq depot (3) - 1 freq taepot (3) - 1 freq lumpots (3) - 1 freq glenoe (3) - 1 freq gluggit (3) - 1 freq guesst (3) - 5 freq lept (3) - 2 freq gluttit (3) - 1 freq bluecoat (3) - 1 freq guest (3) - 42 freq gleekt (3) - 2 freq |
gluepot (0) - 1 freq glaepit (2) - 4 freq gulpit (3) - 3 freq guelt (4) - 1 freq slept (4) - 57 freq sleept (4) - 1 freq glut (4) - 5 freq glaep (4) - 4 freq gleekt (4) - 2 freq sleepit (4) - 40 freq glup (4) - 2 freq gleet (4) - 8 freq glippit (4) - 1 freq glekit (4) - 4 freq glert (4) - 1 freq glaepin (4) - 1 freq lept (4) - 2 freq glaeps (4) - 2 freq grupt (4) - 2 freq glett (4) - 2 freq glent (4) - 30 freq gauspit (4) - 1 freq sleepet (4) - 1 freq giepit (4) - 5 freq glaiket (5) - 9 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 - KLPT clapped - 28 freq gluepot - 1 freq clipped - 8 freq clappit - 46 freq clippit - 5 freq clappt - 4 freq kelpit - 4 freq cliped - 1 freq clyped - 8 freq galloped - 7 freq clippet - 2 freq clappet - 1 freq clipt - 1 freq gulpit - 3 freq golloped - 4 freq cloppit - 1 freq clypit - 1 freq glaepit - 4 freq glaip'd - 1 freq glaipid - 1 freq clip't - 1 freq gulped - 7 freq €œclapped - 1 freq glippit - 1 freq gullpit - 1 freq clippt - 1 freq |
GLUEPOT |
| Time to execute Levenshtein function - 0.183149 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.379234 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.027827 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.037620 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.000876 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. |