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 scot-noble in Corpus

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
scot-noble (0) - 1 freq
scott-noble (1) - 1 freq
scoot-hole (3) - 3 freq
scoobie (4) - 5 freq
scotpol (4) - 14 freq
scrannable (4) - 2 freq
scotshoose (4) - 1 freq
slow-mobile (4) - 1 freq
scot-free (4) - 4 freq
cotoole (4) - 1 freq
scotnorma (4) - 2 freq
scotorum (5) - 2 freq
pothole (5) - 5 freq
scotscores (5) - 3 freq
dooble (5) - 26 freq
scramble (5) - 6 freq
soople (5) - 11 freq
standable (5) - 1 freq
scooby (5) - 19 freq
scotbot (5) - 8 freq
scribble (5) - 5 freq
scotsoun (5) - 18 freq
'noble (5) - 1 freq
hornble (5) - 1 freq
shitehole (5) - 10 freq
scot-noble (0) - 1 freq
scott-noble (2) - 1 freq
scoot-hole (5) - 3 freq
scrannable (6) - 2 freq
scot-free (7) - 4 freq
slow-mobile (7) - 1 freq
scotpol (7) - 14 freq
scotnorma (7) - 2 freq
sustainable (7) - 11 freq
tenable (8) - 1 freq
scuttle (8) - 2 freq
scotand (8) - 2 freq
scots'll (8) - 3 freq
scotweb (8) - 1 freq
stubble (8) - 13 freq
scorninly (8) - 1 freq
scotrail (8) - 5 freq
scathinly (8) - 1 freq
scrabble (8) - 12 freq
scot-ads (8) - 1 freq
stanle (8) - 1 freq
sitable (8) - 2 freq
scot-eesh (8) - 1 freq
scotsness (8) - 1 freq
sconnelly (8) - 7 freq
SoundEx code - S351
stump - 19 freq
stumpin - 4 freq
stampin - 17 freq
stampit - 12 freq
stampt - 4 freq
stumps - 9 freq
stumble - 9 freq
stumblin - 9 freq
stumbles - 3 freq
stampede - 2 freq
staunpint - 1 freq
stampedin - 1 freq
stanefauld - 2 freq
stamp - 18 freq
stumpy - 4 freq
stumblit - 1 freq
stumpit - 2 freq
stomped - 2 freq
stomp - 6 freq
steamboat - 1 freq
stumbled - 10 freq
schottenburg - 3 freq
stamps - 14 freq
steinbeck - 3 freq
schadenfreude - 3 freq
stompin - 4 freq
sweet-tempert - 1 freq
stamped - 11 freq
steen-faced - 1 freq
stumbling - 1 freq
stumped - 3 freq
steenhaven - 1 freq
stomps - 1 freq
stimp - 1 freq
stumpie - 1 freq
'stonie-picko' - 1 freq
stumbas - 2 freq
stampan - 2 freq
sweettempered - 1 freq
stymphalian - 4 freq
stymphalus - 2 freq
sittinback - 1 freq
stanpipe - 2 freq
staun-aff - 2 freq
steenhive - 4 freq
stanby - 1 freq
stumpt - 1 freq
staump-airn - 1 freq
scot-noble - 1 freq
scott-noble - 1 freq
stumpies - 1 freq
stumblet - 1 freq
€˜schadenfreude - 1 freq
stonehaven - 11 freq
stumpet - 1 freq
scotambservice - 1 freq
stonehavengc - 1 freq
stonefish - 24 freq
shitmabreeks - 1 freq
sodinbf - 1 freq
swedenvsengland - 2 freq
stanhive - 1 freq
stanehive - 4 freq
sidnfnm - 1 freq
stmvru - 1 freq
‘stump’ - 1 freq
scotamfa - 19 freq
southampton - 1 freq
MetaPhone code - SKTNBL
scot-noble - 1 freq
scott-noble - 1 freq
SCOT-NOBLE
Time to execute Levenshtein function - 0.265249 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.479539 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.038288 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.045017 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.000898 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.