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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
temp- (0) - 7 freq
temp (1) - 734 freq
templ (1) - 2 freq
tempt (1) - 8 freq
temps (1) - 1 freq
tempo (1) - 4 freq
tea- (2) - 5 freq
hemp (2) - 3 freq
kemps (2) - 4 freq
empy (2) - 6 freq
temptt (2) - 1 freq
kempe (2) - 3 freq
tempit (2) - 11 freq
teip (2) - 2 freq
dempz (2) - 2 freq
tempus (2) - 1 freq
kemp (2) - 46 freq
dem- (2) - 1 freq
temper (2) - 50 freq
kempy (2) - 2 freq
timpo (2) - 1 freq
terp (2) - 2 freq
tempin (2) - 4 freq
time- (2) - 2 freq
yep- (2) - 1 freq
temp- (0) - 7 freq
temps (2) - 1 freq
tempt (2) - 8 freq
tempo (2) - 4 freq
templ (2) - 2 freq
temp (2) - 734 freq
timpo (3) - 1 freq
temper (3) - 50 freq
tempin (3) - 4 freq
temple (3) - 86 freq
tempus (3) - 1 freq
time- (3) - 2 freq
tup- (3) - 1 freq
tempit (3) - 11 freq
temid (4) - 1 freq
tampan (4) - 1 freq
teips (4) - 1 freq
them- (4) - 2 freq
tems (4) - 1 freq
tumips (4) - 1 freq
tamper (4) - 1 freq
tea- (4) - 5 freq
tamped (4) - 1 freq
hemp (4) - 3 freq
teip (4) - 2 freq
SoundEx code - T510
thump - 32 freq
thumb - 24 freq
tomb - 31 freq
tomboy - 1 freq
tempo - 4 freq
temp - 734 freq
twa-an-a-hauf - 2 freq
thomp - 1 freq
thoomb - 6 freq
tumb - 1 freq
timpo - 1 freq
temp- - 7 freq
tmv - 1 freq
tnv - 1 freq
tomb” - 1 freq
tmmf - 1 freq
timehop - 1 freq
tenv - 1 freq
tywanb - 1 freq
tonyip - 1 freq
MetaPhone code - TMP
dump - 30 freq
damp - 83 freq
dumpie - 1 freq
tempo - 4 freq
temp - 734 freq
dump' - 1 freq
timpo - 1 freq
temp- - 7 freq
TEMP-
Time to execute Levenshtein function - 0.313446 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.520151 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.063617 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.041549 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.000923 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.