| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| non-scots (0) - 3 freq monyscots (2) - 1 freq pan-scots (2) - 1 freq cpg-scots (3) - 1 freq non-stop (3) - 5 freq forscots (3) - 1 freq hotspots (4) - 2 freq consaits (4) - 20 freq nonstop (4) - 1 freq nochts (4) - 1 freq beingscots (4) - 10 freq on-come (4) - 1 freq scots (4) - 1 freq non-pc (4) - 1 freq conscious (4) - 24 freq monoglots (4) - 1 freq dogscott (4) - 1 freq hoscote (4) - 39 freq scots (4) - 1 freq doo-cot (4) - 1 freq hot-spot (4) - 1 freq no-show (4) - 1 freq youngscot (4) - 1 freq convicts (4) - 1 freq non-votin (4) - 1 freq |
non-scots (0) - 3 freq pan-scots (3) - 1 freq monyscots (4) - 1 freq non-stop (5) - 5 freq ink-spots (6) - 1 freq anglo-scots (6) - 1 freq cpg-scots (6) - 1 freq wainscots (6) - 1 freq forscots (6) - 1 freq beingscots (6) - 10 freq scots (7) - 11 freq scots (7) - 6843 freq coo-scones (7) - 3 freq noosts (7) - 2 freq contacts (7) - 7 freq non-smoker (7) - 1 freq doric-scots (7) - 1 freq onsets (7) - 2 freq nanobots (7) - 1 freq unnercuts (7) - 1 freq unionists (7) - 20 freq insects (7) - 5 freq coiningscots (7) - 1 freq sunspots (7) - 1 freq consists (7) - 11 freq |
SoundEx code - N523 non-stop - 5 freq newington - 3 freq non-starter - 1 freq non-shaetlan - 1 freq non-gàidhealtachd - 1 freq nimsht - 1 freq nonstop - 1 freq non-scots-speakers - 1 freq namaste - 2 freq namaste - 1 freq non-standard - 2 freq non-standardness - 1 freq namaste - 1 freq non-scots - 3 freq nine-stanza - 1 freq nuanced - 2 freq nanicht - 1 freq nonstandard - 1 freq |
MetaPhone code - NNSKTS non-scots - 3 freq |
NON-SCOTS |
| Time to execute Levenshtein function - 0.211759 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.387150 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.028231 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.038984 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.001034 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. |