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 sonsie

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

Similar words to thamesmooth in Corpus

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
thamesmooth (0) - 1 freq
heymooth (4) - 1 freq
hameaboot (4) - 1 freq
thareaboots (4) - 1 freq
three-month (4) - 1 freq
€œsmooth (5) - 1 freq
twal-month (5) - 2 freq
thereaboot (5) - 5 freq
twalmonth (5) - 8 freq
eyemooth (5) - 1 freq
time-oot (5) - 2 freq
hametoon (5) - 5 freq
tholemoody (5) - 1 freq
thereaboots (5) - 15 freq
traceysmith (5) - 1 freq
hame-aboot (5) - 3 freq
mammoth (5) - 8 freq
hamewirth (5) - 1 freq
hamewith (5) - 9 freq
smooth (5) - 30 freq
yermooth (5) - 1 freq
thames (5) - 14 freq
hameschool (5) - 1 freq
thamsons (5) - 1 freq
thamson (5) - 1 freq
thamesmooth (0) - 1 freq
traceysmith (7) - 1 freq
three-month (7) - 1 freq
heymooth (7) - 1 freq
ethylsmith (7) - 2 freq
mammoth (8) - 8 freq
hamewith (8) - 9 freq
thamsons (8) - 1 freq
thamson (8) - 1 freq
jimsmith (8) - 1 freq
thames (8) - 14 freq
smooth (8) - 30 freq
hamewirth (8) - 1 freq
thareaboots (8) - 1 freq
hameaboot (8) - 1 freq
thumpeth (8) - 1 freq
€œsmooth (8) - 1 freq
thomasm (8) - 5 freq
teammate (9) - 1 freq
chazsmiths (9) - 1 freq
shamsatoo (9) - 1 freq
thomson (9) - 26 freq
stuartsmith (9) - 1 freq
lossiemooth (9) - 1 freq
threesh (9) - 2 freq
SoundEx code - T525
thinkin - 579 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
think'n - 2 freq
thanksgien - 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
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 - 0MSM0
thamesmooth - 1 freq
THAMESMOOTH
Time to execute Levenshtein function - 0.408120 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.542124 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.029897 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.038251 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.000948 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.