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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
sneef (0) - 1 freq
seef (1) - 5 freq
sneer (1) - 9 freq
sneeff (1) - 1 freq
anee (2) - 1 freq
neer (2) - 51 freq
sniff (2) - 28 freq
knee' (2) - 1 freq
anee' (2) - 1 freq
self (2) - 83 freq
aseef (2) - 1 freq
deef (2) - 43 freq
knee (2) - 125 freq
steen (2) - 114 freq
sheed (2) - 19 freq
sheen (2) - 115 freq
sweep (2) - 31 freq
neeb (2) - 2 freq
steel (2) - 102 freq
smeeg (2) - 5 freq
neen (2) - 130 freq
sneak (2) - 23 freq
steff (2) - 1 freq
sneug (2) - 1 freq
sheer (2) - 54 freq
sneef (0) - 1 freq
seef (2) - 5 freq
sneeff (2) - 1 freq
sneer (2) - 9 freq
sned (3) - 27 freq
snuff (3) - 9 freq
sef (3) - 1 freq
sneeky (3) - 1 freq
seaf (3) - 1 freq
sneug (3) - 1 freq
sneeze (3) - 24 freq
squeef (3) - 1 freq
shef (3) - 1 freq
snaed (3) - 1 freq
sneg (3) - 1 freq
seen (3) - 2010 freq
sneak (3) - 23 freq
snek (3) - 11 freq
shaef (3) - 5 freq
gnef (3) - 1 freq
sheaf (3) - 4 freq
aseef (3) - 1 freq
sniff (3) - 28 freq
eneuf (3) - 1 freq
sekf (3) - 1 freq
SoundEx code - S510
snaaba - 1 freq
sniff - 28 freq
snype - 2 freq
snp - 276 freq
snap - 38 freq
snuff - 9 freq
snappy - 7 freq
sumph - 21 freq
sneef - 1 freq
sumf - 3 freq
snawbaw - 20 freq
snaba - 2 freq
sump - 3 freq
shampoo - 11 freq
snip - 4 freq
'snap' - 2 freq
snipe - 10 freq
snob - 10 freq
'snp - 2 freq
snobby - 8 freq
snoop - 4 freq
symbo - 1 freq
simba - 1 freq
sïnfu - 5 freq
sinfu - 3 freq
swamp - 6 freq
snub - 2 freq
skyimp - 2 freq
'snip' - 1 freq
snoove - 4 freq
samba - 1 freq
snipie - 4 freq
skinfae - 1 freq
sunfaa - 1 freq
shamefu - 8 freq
skimpy - 1 freq
swampy - 1 freq
snyaav - 5 freq
snib - 5 freq
sunup - 1 freq
somb - 1 freq
sneeff - 1 freq
snawbaa - 2 freq
snabaa - 1 freq
snaabaa - 4 freq
snuve - 2 freq
snuffy - 14 freq
€œsnuffy - 1 freq
swampfu - 1 freq
swamp' - 1 freq
snap- - 2 freq
snawba - 25 freq
sumphie - 1 freq
€œskyumpie - 1 freq
sconeof - 7 freq
snab - 1 freq
scampi - 1 freq
suimope - 1 freq
snb - 2 freq
snowboy - 1 freq
snape - 1 freq
sammevo - 1 freq
smebe - 1 freq
snp' - 1 freq
'snuff' - 1 freq
MetaPhone code - SNF
sniff - 28 freq
snuff - 9 freq
sneef - 1 freq
singh - 6 freq
sïnfu - 5 freq
sinfu - 3 freq
snoove - 4 freq
sunfaa - 1 freq
sneeff - 1 freq
snuve - 2 freq
snuffy - 14 freq
€œsnuffy - 1 freq
sign-aff - 1 freq
singhia - 1 freq
znv - 1 freq
xnvah - 1 freq
znaif - 1 freq
'snuff' - 1 freq
SNEEF
Time to execute Levenshtein function - 0.234580 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.420428 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.038098 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.046438 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.000885 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.