| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gloves-gin (0) - 1 freq gloves-if (2) - 1 freq gloves-at (3) - 1 freq grovelin (4) - 1 freq lave-in (4) - 1 freq governin (4) - 4 freq glowerin (4) - 61 freq gloggin (4) - 1 freq glesgan (4) - 1 freq glesgie (4) - 6 freq glossin (4) - 4 freq glessin (4) - 1 freq gloves (4) - 48 freq gloves-that (4) - 2 freq loggin (5) - 1 freq lossin (5) - 32 freq sloshin (5) - 3 freq blowstin (5) - 2 freq doverin (5) - 15 freq govermen (5) - 2 freq gloved (5) - 4 freq groves (5) - 2 freq gleamin (5) - 21 freq fleshin (5) - 2 freq loveen (5) - 1 freq |
gloves-gin (0) - 1 freq gloves-if (4) - 1 freq gloves-at (5) - 1 freq glesgan (6) - 1 freq gloves-that (7) - 2 freq gloves (7) - 48 freq glivs-dat (7) - 1 freq gleswegian (7) - 13 freq glossin (7) - 4 freq gless-grien (7) - 1 freq glessin (7) - 1 freq lave-in (7) - 1 freq gloggin (7) - 1 freq glesgie (7) - 6 freq glesgy (8) - 7 freq glansin (8) - 7 freq claes-line (8) - 1 freq goins-on (8) - 1 freq glissin (8) - 2 freq gliskin (8) - 5 freq glesgay (8) - 1 freq glesgae (8) - 17 freq glivesport (8) - 1 freq gleven (8) - 1 freq glesgo (8) - 1 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 gulps - 7 freq globe's - 1 freq gloves-that - 2 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 - KLFSJN gloves-gin - 1 freq |
GLOVES-GIN |
| Time to execute Levenshtein function - 0.523835 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.750047 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.033837 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.042200 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.000947 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. |