| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gestured (0) - 12 freq gesture (1) - 32 freq gestered (1) - 1 freq gesturet (1) - 1 freq gestures (1) - 21 freq gesturt (2) - 1 freq restored (2) - 11 freq pestered (2) - 1 freq textured (2) - 2 freq ventured (2) - 9 freq lectured (2) - 3 freq gestur (2) - 1 freq mestered (2) - 1 freq gesturin (2) - 18 freq featured (2) - 9 freq gestural (2) - 2 freq festered (2) - 3 freq tested (3) - 21 freq lested (3) - 4 freq bettered (3) - 4 freq gestern (3) - 1 freq stared (3) - 69 freq centred (3) - 5 freq tortured (3) - 18 freq gethered (3) - 8 freq |
gestured (0) - 12 freq gestered (1) - 1 freq gesturet (2) - 1 freq gestures (2) - 21 freq gesture (2) - 32 freq mestered (3) - 1 freq gesturin (3) - 18 freq gestural (3) - 2 freq gestur (3) - 1 freq festered (3) - 3 freq pestered (3) - 1 freq restored (3) - 11 freq gesturt (3) - 1 freq stoured (4) - 4 freq lectured (4) - 3 freq mustered (4) - 1 freq basturd (4) - 2 freq stored (4) - 15 freq gestern (4) - 1 freq gestert (4) - 2 freq stared (4) - 69 freq textured (4) - 2 freq glistered (4) - 3 freq gester (4) - 2 freq egested (4) - 1 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 |
GESTURED |
| Time to execute Levenshtein function - 0.252488 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.350678 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.027329 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.038183 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.000892 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. |