| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| glaips (0) - 1 freq graips (1) - 3 freq glaims (1) - 1 freq glais (1) - 1 freq glaeps (1) - 2 freq glaiss (1) - 62 freq glims (2) - 8 freq glaissy (2) - 1 freq lips (2) - 193 freq glass (2) - 80 freq plaids (2) - 5 freq jaips (2) - 1 freq glaep (2) - 4 freq caips (2) - 1 freq laifs (2) - 2 freq gladys (2) - 4 freq plains (2) - 4 freq glaik (2) - 3 freq glaess (2) - 1 freq glaim (2) - 4 freq naips (2) - 1 freq gairs (2) - 1 freq glivs (2) - 13 freq laits (2) - 2 freq flaps (2) - 8 freq |
glaips (0) - 1 freq glaeps (1) - 2 freq glipes (2) - 8 freq glaiss (2) - 62 freq glais (2) - 1 freq glaims (2) - 1 freq graips (2) - 3 freq gliss (3) - 1 freq flips (3) - 2 freq glares (3) - 7 freq slaps (3) - 11 freq clips (3) - 9 freq gaups (3) - 2 freq grips (3) - 18 freq glaurs (3) - 1 freq gaps (3) - 9 freq glamis (3) - 6 freq gasps (3) - 7 freq glifs (3) - 1 freq glimps (3) - 1 freq gulps (3) - 6 freq laps (3) - 7 freq slips (3) - 36 freq glipe (3) - 9 freq glaises (3) - 2 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 |
GLAIPS |
| Time to execute Levenshtein function - 0.181625 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.390989 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.030078 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.038098 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.000812 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. |