| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| glipes (0) - 8 freq clipes (1) - 1 freq glides (1) - 5 freq glipe (1) - 9 freq clips (2) - 9 freq cliped (2) - 1 freq glisks (2) - 10 freq glided (2) - 6 freq globes (2) - 2 freq lines (2) - 216 freq wipes (2) - 4 freq glimer (2) - 1 freq likes (2) - 523 freq olives (2) - 17 freq gies (2) - 501 freq swipes (2) - 2 freq guises (2) - 1 freq glebes (2) - 1 freq glifs (2) - 1 freq glints (2) - 6 freq pipes (2) - 83 freq glied (2) - 1 freq blibes (2) - 1 freq knipes (2) - 3 freq grapes (2) - 23 freq |
glipes (0) - 8 freq glipe (2) - 9 freq glides (2) - 5 freq glaips (2) - 1 freq clipes (2) - 1 freq glimps (3) - 1 freq slips (3) - 36 freq glype (3) - 3 freq flips (3) - 2 freq giles (3) - 9 freq gluives (3) - 3 freq glivs (3) - 13 freq gapes (3) - 1 freq slopes (3) - 12 freq grypes (3) - 1 freq uglies (3) - 1 freq gliss (3) - 1 freq gloves (3) - 48 freq gulps (3) - 6 freq glares (3) - 7 freq gypes (3) - 17 freq grips (3) - 18 freq glims (3) - 8 freq gropes (3) - 1 freq lips (3) - 193 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 - KLPS claps - 4 freq kelpies - 12 freq clips - 9 freq collapse - 16 freq gulps - 6 freq clipes - 1 freq glipes - 8 freq cleopas - 2 freq glaips - 1 freq glaeps - 2 freq calypso - 1 freq gollops - 1 freq collops - 3 freq klopps - 1 freq |
GLIPES |
| Time to execute Levenshtein function - 0.249067 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.364193 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.027370 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.037333 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.000803 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. |