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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
seqways (0) - 1 freq
eyways (2) - 1 freq
sways (2) - 5 freq
segway (2) - 1 freq
aeways (2) - 3 freq
aeyways (2) - 1 freq
seawart (3) - 4 freq
seals (3) - 22 freq
sewage (3) - 2 freq
swaws (3) - 14 freq
seamaws (3) - 2 freq
olways (3) - 1 freq
airways (3) - 3 freq
sequins (3) - 2 freq
sea's (3) - 15 freq
squars (3) - 1 freq
subway (3) - 5 freq
iways (3) - 17 freq
solway (3) - 11 freq
seward (3) - 2 freq
onyways (3) - 5 freq
seawifs (3) - 1 freq
sideways (3) - 1 freq
seggans (3) - 3 freq
eyeways (3) - 1 freq
seqways (0) - 1 freq
sways (3) - 5 freq
sequels (4) - 2 freq
sideways (4) - 1 freq
squars (4) - 1 freq
sidwaes (4) - 1 freq
sqa's (4) - 2 freq
squads (4) - 1 freq
swaes (4) - 1 freq
sicweys (4) - 7 freq
sequins (4) - 2 freq
sews (4) - 1 freq
sqwar (4) - 1 freq
swaws (4) - 14 freq
aeyways (4) - 1 freq
sideyways (4) - 1 freq
sweys (4) - 1 freq
segway (4) - 1 freq
aeways (4) - 3 freq
safeways (4) - 1 freq
seamaws (4) - 2 freq
eyways (4) - 1 freq
squibs (5) - 6 freq
squeals (5) - 12 freq
sewers (5) - 5 freq
SoundEx code - S220
sixes - 2 freq
sizes - 41 freq
sauchs - 9 freq
sausage - 45 freq
sakes - 22 freq
shakes - 24 freq
souchs - 25 freq
success - 97 freq
sassage - 5 freq
sachs - 4 freq
squeezes - 4 freq
sickies - 2 freq
swishes - 1 freq
sheughs - 9 freq
susie's - 4 freq
sagas - 3 freq
sicweys - 7 freq
syze's - 1 freq
suzukee - 1 freq
sighs - 20 freq
saasage - 8 freq
sqqqaqquaaaawwwk - 1 freq
seqways - 1 freq
scozzessi - 1 freq
scozzessi' - 1 freq
sheugh's - 1 freq
seechs - 1 freq
suze's - 1 freq
sages - 1 freq
sheuchs - 13 freq
sikhs - 3 freq
sashes - 3 freq
sheuch's - 1 freq
sheikhs - 2 freq
siouxsie's - 1 freq
suki's - 1 freq
sucesso' - 1 freq
sichs - 5 freq
seaseek - 1 freq
shuggie's - 3 freq
suzie's - 1 freq
shewcaase - 2 freq
seggies - 1 freq
swæjies - 1 freq
sexes - 5 freq
souchikie - 1 freq
sykes - 1 freq
sikkis - 1 freq
sauchiehauch - 1 freq
sucess - 1 freq
sekes - 2 freq
shawcase - 1 freq
shuggy-shoo - 1 freq
seagows - 1 freq
sussex - 1 freq
siggies - 1 freq
saaces - 1 freq
soasij - 2 freq
swichis - 5 freq
sweechis - 2 freq
sweeches - 1 freq
sicweis - 1 freq
skuggis - 1 freq
saughs - 1 freq
sasuge - 1 freq
segas - 1 freq
sazcaz - 3 freq
sicwyes - 4 freq
sausage' - 1 freq
suxswgowu - 1 freq
suzieq - 3 freq
seahooses - 1 freq
MetaPhone code - SKWS
scowes - 1 freq
sicweys - 7 freq
seqways - 1 freq
sicweis - 1 freq
SEQWAYS
Time to execute Levenshtein function - 0.191670 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.339613 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.028005 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.036959 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.000940 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.