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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
staved (0) - 2 freq
saved (1) - 83 freq
starved (1) - 2 freq
staged (1) - 3 freq
staves (1) - 2 freq
slaved (1) - 1 freq
stave (1) - 1 freq
stated (1) - 13 freq
stared (1) - 69 freq
stayed (1) - 50 freq
shaved (1) - 15 freq
stiven (2) - 4 freq
scawed (2) - 1 freq
stairved (2) - 3 freq
stawen (2) - 3 freq
stane (2) - 414 freq
stained (2) - 26 freq
maved (2) - 1 freq
stiyed (2) - 2 freq
steven (2) - 41 freq
shaves (2) - 15 freq
slawed (2) - 5 freq
seated (2) - 11 freq
seased (2) - 1 freq
stacked (2) - 6 freq
staved (0) - 2 freq
stated (2) - 13 freq
stared (2) - 69 freq
shaved (2) - 15 freq
stave (2) - 1 freq
stayed (2) - 50 freq
slaved (2) - 1 freq
saved (2) - 83 freq
starved (2) - 2 freq
staves (2) - 2 freq
staged (2) - 3 freq
styed (3) - 5 freq
sated (3) - 3 freq
steve (3) - 46 freq
staired (3) - 1 freq
salved (3) - 1 freq
skyved (3) - 1 freq
stoked (3) - 2 freq
shived (3) - 1 freq
toved (3) - 1 freq
stav (3) - 2 freq
served (3) - 73 freq
snuved (3) - 3 freq
staund (3) - 104 freq
stade (3) - 3 freq
SoundEx code - S313
stopped - 157 freq
stapped - 121 freq
stupit - 131 freq
stappit - 115 freq
stoapped - 18 freq
stoappt - 3 freq
stupitest - 2 freq
stupid - 57 freq
stepped - 65 freq
steppit - 41 freq
stabbed - 9 freq
stoppit - 100 freq
stuffed - 35 freq
stippit - 6 freq
stoppt - 11 freq
stoppd - 1 freq
stoaped - 15 freq
stoapit - 2 freq
sitivation - 1 freq
stepda - 7 freq
stepfaither - 1 freq
steepit - 8 freq
stept - 4 freq
steeped - 5 freq
stooped - 6 freq
steppt - 4 freq
stapt - 30 freq
stepfaither's - 1 freq
stoppet - 9 freq
stappet - 1 freq
stoapet - 3 freq
stupidly - 4 freq
'stepdad - 1 freq
stepdad - 1 freq
stepdas - 1 freq
stepdaughter - 1 freq
stoopit - 4 freq
stupidity - 6 freq
stuppit - 1 freq
stoppid - 1 freq
stoopeed - 1 freq
steppid - 3 freq
stoopid - 2 freq
staapt - 6 freq
stappt - 5 freq
stubbed - 3 freq
stufit-heidit - 1 freq
stop-waatch - 1 freq
stopt - 5 freq
stoupt - 1 freq
stupit-lookin - 1 freq
stupidest - 2 freq
sitivautioun - 6 freq
stoupit - 1 freq
settified - 1 freq
stabbit - 2 freq
stobbed - 1 freq
stappit-fu - 3 freq
stapp't - 1 freq
stap't - 1 freq
stoup't - 1 freq
setifeed - 1 freq
stipit - 7 freq
seetivation - 1 freq
stauppit - 4 freq
setified - 2 freq
scuddie-happit - 1 freq
staffed - 1 freq
staved - 2 freq
step-faither - 6 freq
'stupit-lookin' - 1 freq
stuffit - 1 freq
styoopit - 1 freq
stfdb - 1 freq
stipid - 3 freq
stpatrick - 1 freq
shitepatter - 1 freq
“switftkey - 1 freq
scot-baiting - 1 freq
satefeed - 11 freq
stfdbk - 1 freq
stephderm - 1 freq
scottfitzpatr - 7 freq
scotbot - 8 freq
stevedudley - 2 freq
stopitaggers - 1 freq
stevedickson - 1 freq
MetaPhone code - STFT
stuffed - 35 freq
staight - 1 freq
settified - 1 freq
setifeed - 1 freq
setified - 2 freq
staffed - 1 freq
staved - 2 freq
stuffit - 1 freq
steughed - 1 freq
satefeed - 11 freq
STAVED
Time to execute Levenshtein function - 0.259883 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.536411 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.028287 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.069113 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.000857 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.