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 ablow

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

Similar words to ootrun in Corpus

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
ootrun (0) - 3 freq
ootrin (1) - 1 freq
outrun (1) - 1 freq
ootgaun (2) - 2 freq
yotun (2) - 9 freq
ootrel (2) - 3 freq
ootin (2) - 5 freq
ootcum (2) - 20 freq
ootlyn (2) - 1 freq
ootlan (2) - 1 freq
ootben (2) - 1 freq
ooteen (2) - 1 freq
sorun (2) - 1 freq
orun (2) - 1 freq
ootput (2) - 2 freq
ootlin (2) - 12 freq
ooten (2) - 9 freq
retrun (2) - 1 freq
oor (3) - 3996 freq
stran (3) - 2 freq
stun (3) - 2 freq
ootae (3) - 90 freq
owerrun (3) - 1 freq
oot- (3) - 1 freq
busrun (3) - 1 freq
ootrun (0) - 3 freq
ootrin (1) - 1 freq
outrun (1) - 1 freq
toarn (3) - 1 freq
ootlin (3) - 12 freq
orun (3) - 1 freq
retrun (3) - 1 freq
tourin (3) - 5 freq
tooerin (3) - 1 freq
sorun (3) - 1 freq
torn (3) - 51 freq
ooten (3) - 9 freq
ootin (3) - 5 freq
ooteen (3) - 1 freq
yotun (3) - 9 freq
ootgaun (3) - 2 freq
tron (3) - 11 freq
ootrel (3) - 3 freq
ootlan (3) - 1 freq
ootben (3) - 1 freq
ootlyn (3) - 1 freq
teirin (4) - 6 freq
tootin (4) - 2 freq
tarin (4) - 1 freq
traan (4) - 1 freq
SoundEx code - O365
ootrun - 3 freq
ootermaist - 2 freq
outrings - 1 freq
ootrin - 1 freq
outrun - 1 freq
o'drink - 1 freq
MetaPhone code - OTRN
ootrun - 3 freq
ootrin - 1 freq
outrun - 1 freq
OOTRUN
Time to execute Levenshtein function - 0.314754 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.468531 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.029463 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.074811 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.000871 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.