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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
unloddan (0) - 1 freq
loddan (2) - 1 freq
noddan (2) - 1 freq
unlockan (2) - 1 freq
unloadin (2) - 6 freq
unbiddan (2) - 1 freq
unfoldin (3) - 3 freq
unbidden (3) - 6 freq
floddin (3) - 1 freq
nahddan (3) - 1 freq
ploddin (3) - 3 freq
nlonday (3) - 1 freq
noddin (3) - 39 freq
cloddin (3) - 8 freq
unload (3) - 3 freq
unloaded (3) - 1 freq
unladin (3) - 1 freq
soddan (3) - 1 freq
flodden (3) - 9 freq
melodian (3) - 1 freq
undoan (3) - 2 freq
unloakin (3) - 1 freq
uncoilan (3) - 1 freq
unlockin (3) - 2 freq
uploadin (3) - 1 freq
unloddan (0) - 1 freq
unbiddan (3) - 1 freq
unloadin (3) - 6 freq
noddan (3) - 1 freq
loddan (3) - 1 freq
cloddin (4) - 8 freq
unloaded (4) - 1 freq
unladin (4) - 1 freq
flodden (4) - 9 freq
noddin (4) - 39 freq
ploddin (4) - 3 freq
unlockan (4) - 1 freq
floddin (4) - 1 freq
unbidden (4) - 6 freq
nahddan (4) - 1 freq
unloadit (5) - 1 freq
uploadin (5) - 1 freq
bliddin (5) - 2 freq
gledden (5) - 1 freq
noaddin (5) - 5 freq
aladdin (5) - 1 freq
unlockin (5) - 2 freq
claddin (5) - 1 freq
nlonday (5) - 1 freq
soddan (5) - 1 freq
SoundEx code - U543
unload - 3 freq
unloadin - 6 freq
unhealthy - 9 freq
unilateral - 1 freq
unloadit - 1 freq
unwieldy - 1 freq
umlaut - 3 freq
unloddan - 1 freq
unyauld - 1 freq
unlatch - 1 freq
unloaded - 1 freq
unladin - 1 freq
unilaterally - 5 freq
umlauts - 2 freq
unliterally - 1 freq
MetaPhone code - UNLTN
unloadin - 6 freq
unloddan - 1 freq
unladin - 1 freq
UNLODDAN
Time to execute Levenshtein function - 0.225106 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.935966 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.093568 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.105844 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.001223 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.