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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
sniff (0) - 28 freq
stiff (1) - 55 freq
skiff (1) - 13 freq
sniffs (1) - 5 freq
snuff (1) - 9 freq
niff (1) - 1 freq
scifi (2) - 1 freq
snigs (2) - 1 freq
shaiff (2) - 3 freq
enoff (2) - 1 freq
sniffle (2) - 1 freq
snufft (2) - 2 freq
snibs (2) - 1 freq
knife (2) - 104 freq
staff (2) - 109 freq
scoff (2) - 12 freq
sowff (2) - 3 freq
scliff (2) - 7 freq
sniffan (2) - 1 freq
fiff (2) - 1 freq
saif (2) - 4 freq
skyiff (2) - 1 freq
sniffed (2) - 16 freq
snip (2) - 4 freq
inuff (2) - 1 freq
sniff (0) - 28 freq
snuff (1) - 9 freq
snuffy (2) - 14 freq
sneeff (2) - 1 freq
stiff (2) - 55 freq
niff (2) - 1 freq
skiff (2) - 13 freq
sniffs (2) - 5 freq
stuff (3) - 624 freq
enuff (3) - 12 freq
steff (3) - 1 freq
stiffy (3) - 1 freq
inuff (3) - 1 freq
sniffit (3) - 9 freq
anoff (3) - 6 freq
anuff (3) - 28 freq
scuff (3) - 4 freq
sniffin (3) - 12 freq
sneef (3) - 1 freq
skiffy (3) - 3 freq
scaff (3) - 2 freq
snuffs (3) - 1 freq
naff (3) - 2 freq
staff (3) - 109 freq
sniffed (3) - 16 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
snob - 11 freq
snowbaw - 1 freq
snobby - 9 freq
shamefu - 9 freq
'snap' - 2 freq
snipe - 10 freq
'snp - 2 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
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
someb - 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
SNIFF
Time to execute Levenshtein function - 0.183878 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.352499 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.030673 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.037077 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.000913 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.