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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
poot-poot (0) - 2 freq
ootpost (3) - 1 freq
woot-woo (3) - 2 freq
pit-oot (3) - 5 freq
pent-pot (3) - 1 freq
look-oot (3) - 5 freq
oot-aboot (3) - 1 freq
portaloos (4) - 1 freq
airt-oot (4) - 2 freq
pathfoot (4) - 1 freq
tooteroo (4) - 2 freq
mort-kloot (4) - 1 freq
ootpit (4) - 28 freq
oot-hoose (4) - 1 freq
poothert (4) - 1 freq
set-oot (4) - 5 freq
snoot-cloot (4) - 1 freq
lood-mooth (4) - 1 freq
nott-book (4) - 1 freq
oot-an-oot (4) - 3 freq
ootnaboot (4) - 1 freq
pit-pat (4) - 2 freq
soo-oop (4) - 29 freq
cast-oot (4) - 1 freq
froo-oot (4) - 1 freq
poot-poot (0) - 2 freq
pit-oot (4) - 5 freq
pent-pot (4) - 1 freq
pit-pat (4) - 2 freq
pit-pony (5) - 1 freq
oot-aboot (5) - 1 freq
poopit (6) - 4 freq
put-upon (6) - 1 freq
potshot (6) - 1 freq
hotspot (6) - 1 freq
hotpot (6) - 1 freq
poolpit (6) - 1 freq
soot-aest (6) - 1 freq
pit-poetry (6) - 1 freq
post-it (6) - 2 freq
ootput (6) - 2 freq
hot-spot (6) - 1 freq
pathfoot (6) - 1 freq
ootpit (6) - 28 freq
look-oot (6) - 5 freq
woot-woo (6) - 2 freq
ootpost (6) - 1 freq
poothert (6) - 1 freq
airt-oot (6) - 2 freq
set-oot (6) - 5 freq
SoundEx code - P313
poot-poot-pootin - 1 freq
poot-poot - 2 freq
phut-phut-phut-phut-phut - 1 freq
pit-poetry - 1 freq
pathfoot - 1 freq
pee-the-bed - 1 freq
pit-pat - 2 freq
pit-a-pat - 1 freq
putbodypartsinfilms - 1 freq
ptbt - 1 freq
MetaPhone code - PTPT
poot-poot - 2 freq
pit-pat - 2 freq
pit-a-pat - 1 freq
POOT-POOT
Time to execute Levenshtein function - 0.221877 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.401631 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.028125 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.042874 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.000936 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.