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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
zagph (0) - 1 freq
jamph (2) - 1 freq
zeph (2) - 1 freq
zap (2) - 1 freq
zarah (2) - 1 freq
ralph (2) - 5 freq
agh (2) - 11 freq
zag (2) - 7 freq
raiph (2) - 25 freq
'agh (2) - 2 freq
daph (2) - 1 freq
alph (2) - 1 freq
aph (2) - 1 freq
agp (2) - 1 freq
iagp (2) - 1 freq
aagh (2) - 1 freq
katsh (3) - 1 freq
fauch (3) - 3 freq
waggy (3) - 1 freq
agal (3) - 1 freq
haeps (3) - 4 freq
hap (3) - 55 freq
hahhh (3) - 1 freq
wgh (3) - 1 freq
cath (3) - 4 freq
zagph (0) - 1 freq
zeph (3) - 1 freq
alph (4) - 1 freq
daph (4) - 1 freq
agp (4) - 1 freq
aagh (4) - 1 freq
jamph (4) - 1 freq
'agh (4) - 2 freq
iagp (4) - 1 freq
aph (4) - 1 freq
zap (4) - 1 freq
raiph (4) - 25 freq
zarah (4) - 1 freq
ralph (4) - 5 freq
zag (4) - 7 freq
agh (4) - 11 freq
zp (5) - 6 freq
zgnd (5) - 1 freq
camphe (5) - 1 freq
zmpw (5) - 1 freq
gbh (5) - 3 freq
urgh (5) - 2 freq
gkh (5) - 1 freq
gnh (5) - 1 freq
ugh (5) - 12 freq
SoundEx code - Z210
zoyozqb - 1 freq
zaaicb - 1 freq
zagph - 1 freq
MetaPhone code - SKF
scuff - 4 freq
skivvy - 7 freq
scaffie - 9 freq
skiff - 13 freq
skeigh - 7 freq
skive - 5 freq
scuffy - 1 freq
skiffie - 7 freq
skough - 1 freq
squeef - 1 freq
scuffie - 4 freq
scoof - 1 freq
scoff - 12 freq
scowff - 2 freq
'skivvy - 1 freq
skoof - 2 freq
scaff - 2 freq
skouf - 1 freq
scuf - 1 freq
skiffy - 3 freq
skaffie - 1 freq
skaffy - 1 freq
skave - 4 freq
xcf - 1 freq
'scoff' - 1 freq
xwkf - 1 freq
zagph - 1 freq
sekf - 1 freq
ZAGPH
Time to execute Levenshtein function - 0.250466 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.377734 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.036398 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.049856 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.001215 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.