| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| glimpse (0) - 18 freq glimpses (1) - 3 freq glimps (1) - 1 freq glimpsed (1) - 1 freq glimpst (1) - 1 freq glimp (2) - 6 freq glipe (2) - 9 freq glims (2) - 8 freq glimped (2) - 2 freq limps (2) - 1 freq gimps (2) - 4 freq elipse (2) - 1 freq glintie (3) - 1 freq gliblee (3) - 2 freq glipes (3) - 8 freq climate (3) - 34 freq glamis (3) - 6 freq simple (3) - 205 freq glaims (3) - 1 freq jimps (3) - 2 freq limbie (3) - 1 freq climbs (3) - 2 freq clips (3) - 9 freq glittie (3) - 2 freq glisks (3) - 10 freq |
glimpse (0) - 18 freq glimps (1) - 1 freq glimpst (2) - 1 freq glimpsed (2) - 1 freq glimpses (2) - 3 freq gimps (3) - 4 freq limps (3) - 1 freq glimped (3) - 2 freq glimp (3) - 6 freq glims (3) - 8 freq slumps (4) - 3 freq glaips (4) - 1 freq glaeps (4) - 2 freq lumps (4) - 21 freq clumps (4) - 7 freq flumps (4) - 1 freq glaims (4) - 1 freq plumps (4) - 8 freq glumpy (4) - 1 freq elipse (4) - 1 freq glipe (4) - 9 freq lamps (4) - 36 freq glipes (4) - 8 freq glamis (4) - 6 freq flips (5) - 2 freq |
SoundEx code - G451 glimp - 6 freq glenfiddich - 2 freq glimpses - 3 freq glenbervie - 2 freq glenaphooka - 1 freq glenboor - 1 freq glimpse - 18 freq glimpsing - 1 freq glenfarg - 4 freq gleniffer - 2 freq glimpst - 1 freq glumpy - 1 freq glimpsed - 1 freq glampigleek - 3 freq gallimaufry - 1 freq glimps - 1 freq gallimaufray - 1 freq glimped - 2 freq glenbogle - 1 freq glenfinnan - 1 freq glenburn - 2 freq gwilymbowenrhys - 1 freq glennbbc - 4 freq glenfearce - 2 freq glenbuck - 1 freq |
MetaPhone code - KLMPS clump's - 1 freq clumps - 7 freq glimpse - 18 freq glimps - 1 freq |
GLIMPSE |
| Time to execute Levenshtein function - 0.280199 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.465513 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.029472 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.049062 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.001139 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. |