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 tamson in Corpus

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
tamson (0) - 32 freq
damson (1) - 1 freq
taison (1) - 1 freq
tamason (1) - 2 freq
samson (1) - 8 freq
tampson (1) - 1 freq
tamsons (1) - 2 freq
thamson (1) - 1 freq
tamasin (2) - 1 freq
jason (2) - 24 freq
cramson (2) - 2 freq
saison (2) - 20 freq
garson (2) - 2 freq
lawson (2) - 2 freq
maison (2) - 4 freq
sanson (2) - 1 freq
masson (2) - 3 freq
saeson (2) - 4 freq
hanson (2) - 1 freq
teason (2) - 2 freq
taisin (2) - 1 freq
simson (2) - 1 freq
tamson's (2) - 19 freq
manson (2) - 14 freq
alson (2) - 1 freq
tamson (0) - 32 freq
tamason (1) - 2 freq
tamasin (2) - 1 freq
tamsons (2) - 2 freq
tomsin (2) - 2 freq
thamson (2) - 1 freq
tampson (2) - 1 freq
taison (2) - 1 freq
damson (2) - 1 freq
samson (2) - 8 freq
jameson (3) - 2 freq
teason (3) - 2 freq
simson (3) - 1 freq
mason (3) - 11 freq
taisin (3) - 1 freq
adamson (3) - 1 freq
traeson (3) - 1 freq
tampan (3) - 1 freq
tams (3) - 4 freq
thomson (3) - 26 freq
maison (3) - 4 freq
tossan (4) - 4 freq
etymon (4) - 1 freq
tisen (4) - 1 freq
tims (4) - 8 freq
SoundEx code - T525
thinkin - 574 freq
thinking - 85 freq
think--an - 1 freq
thankin - 5 freq
tension - 32 freq
thinkna - 1 freq
tamson's - 19 freq
thomson - 26 freq
thinggyin - 1 freq
tin-canned - 1 freq
tamson - 32 freq
thinkan - 52 freq
thamesmooth - 1 freq
thingman - 2 freq
thinkin' - 22 freq
thingumay - 1 freq
thanking - 1 freq
theinken - 6 freq
thinken - 2 freq
thenkin - 3 freq
theinkin - 1 freq
tomsin - 2 freq
timaagine - 1 freq
time-consumein - 1 freq
tamsons' - 1 freq
tensions - 3 freq
tankin - 2 freq
thïnkin - 7 freq
tinkin - 57 freq
tennyson - 1 freq
tunkin - 1 freq
thingmy - 3 freq
tamasin - 1 freq
tamsons - 2 freq
tamason - 2 freq
tensjin - 1 freq
thingymabab - 1 freq
thingymababs - 1 freq
thoonsans - 1 freq
thomson' - 1 freq
toonsman - 1 freq
tinkeen - 1 freq
tammasmas - 1 freq
thanksgien - 1 freq
twangin - 2 freq
th'auncient - 1 freq
thanksgiein - 1 freq
tonguing - 1 freq
thamson - 1 freq
thamsons - 1 freq
tensiouns - 1 freq
tinking - 1 freq
tanganyika - 1 freq
€˜twanging - 1 freq
twanging - 1 freq
townsend - 1 freq
tangental - 1 freq
thingummy - 1 freq
twinkin - 1 freq
tensin - 1 freq
thomasina - 5 freq
thomson's - 1 freq
thomasengst - 1 freq
thomasm - 5 freq
thingmajig - 1 freq
theoncoming - 1 freq
thmkn - 1 freq
thomsonnn - 1 freq
tomkins - 1 freq
tomjohn - 1 freq
thinkn - 1 freq
timeschanged - 1 freq
thingmie - 1 freq
thing-umy-jig - 1 freq
thinkin-bunnet - 1 freq
tmxoomw - 1 freq
tamsonÂ’s - 1 freq
tiomgsckn - 1 freq
tomcampbell - 1 freq
tengmalm's - 1 freq
tumshiem - 2 freq
thingumyjigg - 1 freq
tanzymc - 1 freq
thomsonx - 1 freq
tomasmbosch - 2 freq
tinkan - 1 freq
MetaPhone code - TMSN
tamson - 32 freq
tomsin - 2 freq
tamasin - 1 freq
tamason - 2 freq
demission - 2 freq
demissioun - 1 freq
demesne - 1 freq
damascene - 1 freq
damson - 1 freq
TAMSON
Time to execute Levenshtein function - 0.182483 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.330344 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.027502 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.036884 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.000856 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.