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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
unloadin (0) - 6 freq
unloadit (1) - 1 freq
uploadin (1) - 1 freq
unladin (1) - 1 freq
unloakin (1) - 1 freq
reloadin (2) - 1 freq
loadin (2) - 5 freq
unloaded (2) - 1 freq
unload (2) - 3 freq
unfoldin (2) - 2 freq
unloddan (2) - 1 freq
unlockin (2) - 2 freq
€œleadin (3) - 1 freq
plowdin (3) - 1 freq
ladin (3) - 1 freq
invadin (3) - 4 freq
unwindin (3) - 2 freq
noddin (3) - 38 freq
unfoldit (3) - 3 freq
onlookin (3) - 2 freq
floddin (3) - 1 freq
unloack (3) - 1 freq
hoadin (3) - 3 freq
unlockit (3) - 2 freq
floatin (3) - 41 freq
unloadin (0) - 6 freq
unladin (1) - 1 freq
unloadit (2) - 1 freq
uploadin (2) - 1 freq
unloakin (2) - 1 freq
unfoldin (3) - 2 freq
unload (3) - 3 freq
unloddan (3) - 1 freq
unloaded (3) - 1 freq
loadin (3) - 5 freq
reloadin (3) - 1 freq
doonloadin (4) - 1 freq
floodin (4) - 8 freq
undoin (4) - 1 freq
undain (4) - 1 freq
leadin (4) - 66 freq
unlearn (4) - 2 freq
unendin (4) - 2 freq
unlairn (4) - 1 freq
cloodin (4) - 3 freq
bladin (4) - 1 freq
undoan (4) - 2 freq
invadin (4) - 4 freq
ladin (4) - 1 freq
pleadin (4) - 12 freq
SoundEx code - U543
unload - 3 freq
unloadin - 6 freq
unilateral - 1 freq
unloadit - 1 freq
unwieldy - 1 freq
unhealthy - 8 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
UNLOADIN
Time to execute Levenshtein function - 0.182992 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.369599 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.028536 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.036779 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.000882 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.