| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| glebes (0) - 1 freq plebes (1) - 1 freq grebes (1) - 2 freq globes (1) - 2 freq glebe (1) - 5 freq grees (2) - 18 freq gloves (2) - 48 freq glegs (2) - 1 freq glenesk (2) - 1 freq fleres (2) - 1 freq glegest (2) - 1 freq gaetes (2) - 1 freq plees (2) - 6 freq genes (2) - 10 freq lees (2) - 63 freq le'es (2) - 1 freq flees (2) - 70 freq greves (2) - 1 freq glents (2) - 6 freq slebs (2) - 1 freq glipes (2) - 8 freq gled's (2) - 1 freq gees (2) - 41 freq glen's (2) - 4 freq glares (2) - 7 freq |
glebes (0) - 1 freq globes (1) - 2 freq globs (2) - 2 freq glebe (2) - 5 freq plebes (2) - 1 freq grebes (2) - 2 freq blibes (3) - 1 freq globe (3) - 30 freq glesea (3) - 2 freq gleb (3) - 1 freq gleams (3) - 2 freq gleems (3) - 1 freq gleers (3) - 1 freq glens (3) - 43 freq gleds (3) - 2 freq blebs (3) - 1 freq geebies (3) - 1 freq gebs (3) - 2 freq glides (3) - 5 freq gleans (3) - 1 freq globed (3) - 1 freq gless (3) - 392 freq glares (3) - 7 freq globe's (3) - 1 freq plebs (3) - 5 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 - KLBS globes - 2 freq clubs - 102 freq clubby's - 3 freq globe's - 1 freq club's - 5 freq glebes - 1 freq globs - 2 freq €˜clubs - 1 freq |
GLEBES |
| Time to execute Levenshtein function - 0.197141 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.342972 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.027340 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.037197 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.000792 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. |