| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| glivs (0) - 13 freq gliss (1) - 1 freq gliv (1) - 1 freq glifs (1) - 1 freq glims (1) - 8 freq gluvs (1) - 2 freq 'live (2) - 2 freq gliff (2) - 35 freq plies (2) - 3 freq glass (2) - 80 freq shivs (2) - 2 freq ilive (2) - 1 freq girs (2) - 4 freq gis (2) - 1 freq olives (2) - 17 freq clims (2) - 1 freq give (2) - 161 freq lims (2) - 2 freq guvs (2) - 1 freq gains (2) - 8 freq glaiss (2) - 62 freq glaips (2) - 1 freq flips (2) - 2 freq muivs (2) - 1 freq bliss (2) - 59 freq |
glivs (0) - 13 freq gluvs (1) - 2 freq gluives (2) - 3 freq gloves (2) - 48 freq glims (2) - 8 freq gliss (2) - 1 freq gliv (2) - 1 freq glifs (2) - 1 freq glove (3) - 10 freq luvs (3) - 11 freq glows (3) - 6 freq gvs (3) - 1 freq gloss (3) - 7 freq gluv's (3) - 1 freq glais (3) - 1 freq glipes (3) - 8 freq glegs (3) - 1 freq glaims (3) - 1 freq globs (3) - 2 freq gives (3) - 19 freq gleds (3) - 2 freq lives (3) - 236 freq glides (3) - 5 freq uglies (3) - 1 freq glass (3) - 80 freq |
SoundEx code - G412 globes - 2 freq gloves - 48 freq gloves-if - 1 freq gliffs - 6 freq gloves-gin - 1 freq glib-glabbit - 2 freq gluv's - 1 freq globe's - 1 freq gloves-that - 2 freq gulps - 6 freq glipes - 8 freq glivs - 13 freq glivs-dat - 1 freq glaips - 1 freq glib-gabbitlie - 1 freq glib-gabbit - 2 freq glebes - 1 freq gluives - 3 freq gloves-at - 1 freq globs - 2 freq glaeps - 2 freq goalposts - 1 freq gollops - 1 freq glifs - 1 freq gellyfsh - 1 freq glfvhwkl - 1 freq gluvs - 2 freq glvfeuyqch - 1 freq glivesport - 1 freq |
MetaPhone code - KLFS cliffs - 29 freq gloves - 48 freq cluifs - 1 freq cloves - 4 freq gliffs - 6 freq calfies - 4 freq cleughs - 3 freq gluv's - 1 freq calves - 4 freq cleaves - 1 freq culfs - 2 freq glivs - 13 freq gluives - 3 freq calfes - 1 freq calfie's - 1 freq calf's - 2 freq cliff's - 1 freq cleeves - 1 freq clefs - 1 freq glifs - 1 freq gluvs - 2 freq |
GLIVS |
| Time to execute Levenshtein function - 0.189593 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.342719 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.027636 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.037358 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.000863 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. |