| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gawston (0) - 25 freq gawstoun (1) - 3 freq gawstonl (1) - 1 freq galston (1) - 2 freq gakstoun (2) - 1 freq gascon (2) - 2 freq gawdon (2) - 1 freq aston (2) - 4 freq lawson (2) - 2 freq galston' (2) - 1 freq easton (2) - 3 freq garson (2) - 2 freq gawkin (3) - 13 freq ashton (3) - 4 freq lastin (3) - 9 freq glutton (3) - 5 freq sawtan (3) - 1 freq downton (3) - 1 freq gawsie (3) - 4 freq gaist (3) - 2 freq gotton (3) - 1 freq danson (3) - 1 freq peston (3) - 2 freq jason (3) - 24 freq gammon (3) - 5 freq |
gawston (0) - 25 freq gawstoun (1) - 3 freq galston (2) - 2 freq gawstonl (2) - 1 freq gakstoun (3) - 1 freq ogston (4) - 3 freq wastan (4) - 1 freq waistin (4) - 1 freq rowstin (4) - 4 freq gewttin (4) - 1 freq gustin (4) - 1 freq gemstone (4) - 1 freq gwetin (4) - 1 freq weston (4) - 7 freq gowster (4) - 2 freq wastin (4) - 32 freq lawson (4) - 2 freq aston (4) - 4 freq gawdon (4) - 1 freq gascon (4) - 2 freq galston' (4) - 1 freq easton (4) - 3 freq gowsty (4) - 5 freq garson (4) - 2 freq gowstie (4) - 6 freq |
SoundEx code - G235 gustin - 1 freq gawston - 25 freq gawstonl - 1 freq gakstoun - 1 freq ghaist-hauntit - 1 freq gawstoun - 3 freq gushetneuk - 5 freq ghostoons - 1 freq gawkitness - 1 freq gosden - 1 freq gostonbosyduisweel - 1 freq gawstonÂ’s - 1 freq guektiengieline - 1 freq |
MetaPhone code - KSTN quaisten - 23 freq questin - 11 freq cusdnae - 1 freq castin - 48 freq gustin - 1 freq costin - 5 freq kistin - 3 freq gawston - 25 freq coastin - 1 freq caistin - 1 freq cuisten - 2 freq keystane - 3 freq costan - 1 freq kie-stane - 3 freq castan - 1 freq kisteen - 1 freq casten - 2 freq gawstoun - 3 freq kestin - 2 freq €˜quaisten - 1 freq cuistin - 3 freq quaisteen - 1 freq gosden - 1 freq quaesten - 2 freq |
GAWSTON |
| Time to execute Levenshtein function - 0.195291 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.358051 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.027156 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.038307 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.001013 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. |