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 paes-eggs in Corpus

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
paes-eggs (0) - 1 freq
daesters (4) - 1 freq
presents (4) - 50 freq
pauses (4) - 11 freq
plaesses (4) - 15 freq
peesies (4) - 2 freq
paisley's (4) - 2 freq
pea-riggs (4) - 1 freq
passes (4) - 70 freq
paepers (4) - 2 freq
taesets (4) - 1 freq
pansies (4) - 4 freq
nest-egg (4) - 1 freq
pastes (4) - 1 freq
presets (4) - 1 freq
peesweeps (4) - 2 freq
pee-bags (4) - 1 freq
hens'eggs (4) - 1 freq
presses (4) - 23 freq
poesies (4) - 2 freq
preses (4) - 15 freq
peegs (4) - 1 freq
pansers (4) - 2 freq
caesses (4) - 2 freq
seggs (4) - 1 freq
paes-eggs (0) - 1 freq
pee-bags (6) - 1 freq
passages (6) - 8 freq
pea-riggs (6) - 1 freq
seggs (6) - 1 freq
peesweeps (7) - 2 freq
goosegogs (7) - 1 freq
pauses (7) - 11 freq
hens'eggs (7) - 1 freq
poesies (7) - 2 freq
peegs (7) - 1 freq
pastes (7) - 1 freq
nest-egg (7) - 1 freq
passes (7) - 70 freq
paisley's (7) - 2 freq
peesies (7) - 2 freq
peat-hags (7) - 4 freq
peat-bogs (7) - 1 freq
pan-haggis (7) - 1 freq
physogs (8) - 1 freq
pselbs (8) - 10 freq
pushes (8) - 8 freq
passage (8) - 60 freq
poosies (8) - 9 freq
maggs (8) - 1 freq
SoundEx code - P220
pushes - 8 freq
pages - 132 freq
puggies - 25 freq
paces - 14 freq
passage - 60 freq
pooches - 44 freq
'puggies - 1 freq
pokes - 22 freq
pieces - 152 freq
posies - 6 freq
passes - 70 freq
pusses - 6 freq
peggies - 1 freq
package - 28 freq
paco's - 2 freq
pheesic - 4 freq
pauses - 11 freq
paycock - 5 freq
physog - 13 freq
phases - 3 freq
picasso - 6 freq
peacock - 22 freq
phizog - 1 freq
pechs - 6 freq
'pok'e's - 1 freq
pyokes - 2 freq
pikes - 8 freq
pouches - 5 freq
peesies - 2 freq
possess - 11 freq
paissage - 2 freq
pcik - 1 freq
pooche's - 1 freq
peckesh - 1 freq
peece's - 1 freq
piazzas - 1 freq
psycho - 9 freq
psyche - 9 freq
physics - 3 freq
pick-aix - 1 freq
piggies - 5 freq
physique - 1 freq
pickwick - 1 freq
piggie's - 1 freq
phizzog - 1 freq
pisces - 3 freq
pisses - 4 freq
poxies - 1 freq
pishes - 2 freq
phisogs - 1 freq
pig-hoose - 1 freq
poses - 2 freq
pizzas - 6 freq
peces - 3 freq
pey-es-ye-go - 1 freq
pokkies - 2 freq
puggie's - 2 freq
peaches - 2 freq
peckage - 2 freq
puses - 1 freq
pish-hoose - 1 freq
paackies - 2 freq
paes-eggs - 1 freq
poke's - 2 freq
peacock's - 2 freq
peggy's - 1 freq
passes' - 1 freq
pockies - 1 freq
piecies - 1 freq
physogs - 1 freq
peges - 1 freq
pheisik - 3 freq
pack-ice - 1 freq
peacocks - 1 freq
pawkies - 2 freq
paiy-as-ye-go - 1 freq
pay-as-you-go - 1 freq
paycocks - 2 freq
passageway - 1 freq
pickaxe - 1 freq
puchowski - 1 freq
physic - 1 freq
poosack - 3 freq
pussy's - 1 freq
peeces - 1 freq
pkus - 1 freq
pakis - 1 freq
pkyz - 1 freq
psych - 1 freq
physicsj - 1 freq
poesies - 2 freq
pixies - 2 freq
pykoswu - 1 freq
pozij - 1 freq
pvxos - 1 freq
pzaz - 1 freq
paceys - 1 freq
poosies - 9 freq
MetaPhone code - PSKS
paes-eggs - 1 freq
PAES-EGGS
Time to execute Levenshtein function - 0.201259 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.394629 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.028357 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.038084 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.000921 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.