A Corpus of 21st Century Scots Texts

Intro a b c d e f g h i j k l m n o p q r s t u v w x y z Texts Writers Statistics Top200 Search Compare

Levenshtein Distance

Enter a word to find nearest neighbouring words, for example ahint

- basic concord - pre-sorted concord - post-sorted concord - map and chronology - chronogrid - fine-grain concord -

Similar words to twa-thoosan in Corpus

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
twa-thoosan'd (2) - 1 freq
twa-horse (4) - 1 freq
thoosan (4) - 114 freq
wasthoose (4) - 1 freq
tea-hoose (4) - 1 freq
choosan (5) - 2 freq
twa-thirds (5) - 1 freq
tattoos (5) - 18 freq
washhoose (5) - 1 freq
hauf-thoosand (5) - 1 freq
haa-hoose (5) - 1 freq
cathoose (5) - 1 freq
waathirman (5) - 1 freq
warehoos (5) - 1 freq
thoosand (5) - 115 freq
thoosen (5) - 2 freq
tattooin (5) - 3 freq
twa-twa (5) - 1 freq
tea-houss (5) - 1 freq
twa-fur-wan (5) - 1 freq
withooten (5) - 2 freq
thousan (5) - 44 freq
twa-thrie (5) - 4 freq
warehoose (5) - 3 freq
thoosin (5) - 1 freq
twa-thoosan'd (4) - 1 freq
twa-times (7) - 5 freq
twa-tumes (7) - 1 freq
twa-thrie (7) - 4 freq
twa-three (7) - 130 freq
tea-hoose (7) - 1 freq
wasthoose (7) - 1 freq
twa-horse (7) - 1 freq
thoosan (7) - 114 freq
thousan (8) - 44 freq
tea-houss (8) - 1 freq
two-tone (8) - 1 freq
thoosin (8) - 1 freq
twae-thrie (8) - 1 freq
twa-twa (8) - 1 freq
twaa-three (8) - 1 freq
withooten (8) - 2 freq
twae-three (8) - 6 freq
hauf-thoosand (8) - 1 freq
twae-thre (8) - 1 freq
twa-thirds (8) - 1 freq
thoosen (8) - 2 freq
twalfths (9) - 1 freq
whithorn (9) - 2 freq
twaethree (9) - 2 freq
SoundEx code - T325
twitchin - 9 freq
thatchin - 2 freq
twa-thoosan'd - 1 freq
twitchan - 2 freq
titchin - 2 freq
tattie-howkin - 4 freq
tuithsome - 1 freq
tedisome - 1 freq
tattie-scones - 1 freq
titchmarsh - 1 freq
tudqnoqneq - 1 freq
MetaPhone code - TW0SN
TWA-THOOSAN
Time to execute Levenshtein function - 0.247743 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.433764 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.029972 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.052464 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.001168 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.