| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gestures (0) - 21 freq gestured (1) - 12 freq gesture (1) - 32 freq gesturet (1) - 1 freq gesturt (2) - 1 freq gestur (2) - 1 freq lectures (2) - 8 freq gesturin (2) - 18 freq features (2) - 45 freq textures (2) - 2 freq gestered (2) - 1 freq gestural (2) - 2 freq ventures (2) - 2 freq restores (2) - 1 freq pastures (2) - 4 freq dentures (2) - 6 freq postures (2) - 2 freq disturss (3) - 1 freq basturts (3) - 3 freq disturbs (3) - 1 freq bestirs (3) - 2 freq pictures (3) - 76 freq returns (3) - 27 freq natures (3) - 3 freq distres (3) - 1 freq |
gestures (0) - 21 freq gesture (2) - 32 freq gesturet (2) - 1 freq gestured (2) - 12 freq restores (3) - 1 freq pastures (3) - 4 freq postures (3) - 2 freq gestural (3) - 2 freq gestered (3) - 1 freq gesturin (3) - 18 freq gestur (3) - 1 freq gesturt (3) - 1 freq sesters (4) - 3 freq stres (4) - 1 freq gestert (4) - 2 freq distres (4) - 1 freq gester (4) - 2 freq gests (4) - 2 freq stores (4) - 30 freq gestern (4) - 1 freq pasturs (4) - 1 freq jesters (4) - 2 freq festers (4) - 1 freq textures (4) - 2 freq gastrous (4) - 3 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 - JSTRS gestures - 21 freq jesters - 2 freq |
GESTURES |
| Time to execute Levenshtein function - 0.216611 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.371823 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.027477 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.039980 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.001080 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. |