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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
wowzers (0) - 1 freq
powers (2) - 16 freq
mowsers (2) - 1 freq
wonders (2) - 5 freq
owners (2) - 19 freq
powkers (2) - 1 freq
wonners (2) - 1 freq
dowters (2) - 1 freq
cowsers (2) - 1 freq
gowfers (2) - 1 freq
workers (2) - 34 freq
boozers (2) - 4 freq
cowzer (2) - 1 freq
mowers (2) - 1 freq
rowers (2) - 3 freq
howlers (2) - 1 freq
owers (2) - 2 freq
howkers (2) - 1 freq
rozzers (2) - 1 freq
howders (2) - 2 freq
dowers (2) - 1 freq
lowers (2) - 7 freq
bowers (2) - 1 freq
fowers (2) - 7 freq
rowlers (2) - 3 freq
wowzers (0) - 1 freq
rozzers (4) - 1 freq
howders (4) - 2 freq
howkers (4) - 1 freq
owers (4) - 2 freq
howlers (4) - 1 freq
dowers (4) - 1 freq
bowers (4) - 1 freq
towers (4) - 19 freq
tweezers (4) - 3 freq
rowlers (4) - 3 freq
fowers (4) - 7 freq
rowers (4) - 3 freq
lowers (4) - 7 freq
gowpers (4) - 2 freq
wonders (4) - 5 freq
powkers (4) - 1 freq
mowsers (4) - 1 freq
powers (4) - 16 freq
mowers (4) - 1 freq
wonners (4) - 1 freq
owners (4) - 19 freq
dowters (4) - 1 freq
workers (4) - 34 freq
boozers (4) - 4 freq
SoundEx code - W262
whiskers - 22 freq
whuskers - 12 freq
washer's - 1 freq
washers - 1 freq
wagers - 1 freq
waxwarks - 2 freq
wikkers - 1 freq
wieghorst - 1 freq
waukers - 1 freq
wiskers - 1 freq
wuqrqlodfj - 1 freq
wheekers - 1 freq
wgjgrecg - 1 freq
wowzers - 1 freq
wickers - 1 freq
weekirstyw - 1 freq
wzroqhl - 1 freq
wzrz - 1 freq
wyqrwcrfw - 1 freq
MetaPhone code - WSRS
wowzers - 1 freq
WOWZERS
Time to execute Levenshtein function - 0.221394 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.397099 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.029347 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.041411 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.