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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
siblings (0) - 6 freq
sibling (1) - 1 freq
siblins (1) - 10 freq
fillings (2) - 2 freq
siblin (2) - 1 freq
aiblins (2) - 282 freq
jillings (2) - 10 freq
slings (2) - 2 freq
sidings (2) - 1 freq
yiblins (2) - 1 freq
killings (2) - 2 freq
shillings (2) - 4 freq
sidling (2) - 1 freq
signings (2) - 8 freq
stirlings (2) - 7 freq
skirling (3) - 1 freq
palings (3) - 1 freq
fillins (3) - 2 freq
winnings (3) - 1 freq
wittings (3) - 1 freq
spellings (3) - 29 freq
fittings (3) - 2 freq
airlines (3) - 1 freq
killing (3) - 7 freq
walings (3) - 2 freq
siblings (0) - 6 freq
siblins (2) - 10 freq
sibling (2) - 1 freq
slings (3) - 2 freq
sidling (4) - 1 freq
signings (4) - 8 freq
bilangs (4) - 6 freq
oblongs (4) - 1 freq
killings (4) - 2 freq
stirlings (4) - 7 freq
shillings (4) - 4 freq
aiblins (4) - 282 freq
siblin (4) - 1 freq
fillings (4) - 2 freq
jillings (4) - 10 freq
yiblins (4) - 1 freq
sidings (4) - 1 freq
sidelins (5) - 4 freq
dublin's (5) - 1 freq
starlings (5) - 2 freq
goslings (5) - 1 freq
sobbing (5) - 1 freq
belongs (5) - 14 freq
settings (5) - 6 freq
sidelines (5) - 2 freq
SoundEx code - S145
spellins - 71 freq
spellin - 193 freq
shuffling - 1 freq
splender-new - 1 freq
spulyien - 1 freq
splinter - 4 freq
shufflin - 6 freq
scufflin - 1 freq
splindert - 1 freq
siblin - 1 freq
sibilance - 1 freq
spellingly - 1 freq
shovelling - 1 freq
spillin - 10 freq
splayin - 1 freq
siblins - 10 freq
soupleness - 2 freq
splendent - 1 freq
sapling - 2 freq
sploiinnnngggagggggaggag - 1 freq
splang - 1 freq
splendour - 10 freq
sublime - 9 freq
'spellins - 1 freq
spellings - 29 freq
shovellin - 2 freq
spylin - 7 freq
splendiferous - 1 freq
supplyin - 3 freq
squabblin - 4 freq
sublimely - 1 freq
shovelin - 2 freq
spilin - 2 freq
spellin's - 7 freq
splinters - 2 freq
spullin - 2 freq
subliminal - 1 freq
sublimed - 1 freq
supplement - 6 freq
splendid - 25 freq
spelling - 72 freq
sablon - 1 freq
speelin - 5 freq
'speelin - 1 freq
spellan - 1 freq
sibleen - 1 freq
sibling - 1 freq
spaelleen - 2 freq
'spaelleen' - 1 freq
spaelleens - 1 freq
spaellan - 1 freq
siblings - 6 freq
spellin' - 1 freq
supplementary - 1 freq
supplements - 1 freq
sweevlin - 2 freq
splenterin - 2 freq
spellin-oot - 1 freq
spelleen - 5 freq
spellin-in-shaetlan - 1 freq
spelleens - 3 freq
speilin - 1 freq
shiffllin - 1 freq
shifflin - 1 freq
shivellin - 1 freq
splintery - 1 freq
supplementarie - 2 freq
spilling - 3 freq
saplins - 2 freq
spallins - 1 freq
splint - 1 freq
€œshuffling - 1 freq
soopleness - 1 freq
splintit - 1 freq
spleen - 1 freq
spoiling - 3 freq
€˜splendour - 1 freq
spielin - 1 freq
seeplin - 1 freq
spulyan - 1 freq
speleens - 3 freq
speleen - 3 freq
sophiaalmaria - 1 freq
soupelina - 2 freq
sublimate - 1 freq
siblingenvy - 1 freq
sabhalmorostaig - 1 freq
MetaPhone code - SBLNKS
siblings - 6 freq
SIBLINGS
Time to execute Levenshtein function - 0.207169 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.360595 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.029002 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.038746 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.000948 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.