| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gestered (0) - 1 freq gestured (1) - 12 freq festered (1) - 3 freq mestered (1) - 1 freq pestered (1) - 1 freq gestern (2) - 1 freq clestered (2) - 1 freq glistered (2) - 3 freq teetered (2) - 3 freq geddered (2) - 1 freq keltered (2) - 2 freq entered (2) - 39 freq gester (2) - 2 freq gesturet (2) - 1 freq centered (2) - 1 freq gethered (2) - 8 freq mustered (2) - 1 freq pesteren (2) - 1 freq gestert (2) - 2 freq petered (2) - 3 freq gestures (2) - 21 freq ventered (2) - 1 freq gesture (2) - 32 freq bettered (2) - 4 freq nettered (2) - 2 freq |
gestered (0) - 1 freq gestured (1) - 12 freq pestered (2) - 1 freq mestered (2) - 1 freq festered (2) - 3 freq mustered (3) - 1 freq gestert (3) - 2 freq restored (3) - 11 freq gesturet (3) - 1 freq gesture (3) - 32 freq gestures (3) - 21 freq gester (3) - 2 freq glistered (3) - 3 freq gestern (3) - 1 freq gloutered (4) - 1 freq stared (4) - 69 freq easterd (4) - 1 freq egested (4) - 1 freq gesturin (4) - 18 freq gesturt (4) - 1 freq gestur (4) - 1 freq steired (4) - 4 freq gestural (4) - 2 freq steered (4) - 39 freq registered (4) - 16 freq |
SoundEx code - G236 gesture - 32 freq gestures - 21 freq gastrous - 3 freq gester - 2 freq gestered - 1 freq gowster - 2 freq gowsterous - 3 freq gestured - 12 freq gowsterie - 1 freq gastropods - 2 freq gouster - 5 freq gectaar - 1 freq gesturin - 18 freq gastro-enteritis - 1 freq gestur - 1 freq gousters - 3 freq gowsters - 1 freq gowsternous - 1 freq gastropod - 1 freq geisterlaut - 1 freq gestern - 1 freq ghosters - 1 freq gestert - 2 freq gesturt - 1 freq gesturet - 1 freq gestural - 2 freq go-getter - 1 freq gowstrous - 1 freq gousterie - 1 freq gazetteer - 1 freq gowsteri - 1 freq |
MetaPhone code - JSTRT gestered - 1 freq gestured - 12 freq gestert - 2 freq gesturt - 1 freq gesturet - 1 freq |
GESTERED |
| Time to execute Levenshtein function - 0.263976 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.597242 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.027417 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.071173 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.000798 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. |