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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
polisman (0) - 22 freq
pollisman (1) - 2 freq
polissman (1) - 2 freq
polismen (1) - 2 freq
polisman's (2) - 1 freq
policeman (2) - 3 freq
polishin (2) - 10 freq
polish (3) - 69 freq
foirsman (3) - 6 freq
plumman (3) - 1 freq
talismans (3) - 1 freq
pieman (3) - 4 freq
sportsman (3) - 2 freq
collman (3) - 1 freq
polishin' (3) - 2 freq
plipan (3) - 1 freq
plooman (3) - 8 freq
toonsman (3) - 1 freq
polyshen (3) - 1 freq
prodistan (3) - 2 freq
yoleman (3) - 1 freq
woodsman (3) - 1 freq
klinsman (3) - 1 freq
inglisman (3) - 3 freq
soleman (3) - 2 freq
polisman (0) - 22 freq
polismen (1) - 2 freq
polissman (2) - 2 freq
pollisman (2) - 2 freq
policeman (3) - 3 freq
polishin (3) - 10 freq
plooman (4) - 8 freq
polyshen (4) - 1 freq
salesman (4) - 16 freq
plasma (4) - 5 freq
plumman (4) - 1 freq
polisman's (4) - 1 freq
polishing (5) - 3 freq
postman (5) - 5 freq
pitman (5) - 1 freq
polis (5) - 261 freq
pakistan (5) - 3 freq
oilman (5) - 1 freq
pooshan (5) - 1 freq
polished (5) - 39 freq
pollutan (5) - 1 freq
pulsin (5) - 8 freq
plumin (5) - 1 freq
plaisin (5) - 1 freq
pleumen (5) - 1 freq
SoundEx code - P425
plashin - 3 freq
pleasin - 11 freq
pleisance - 1 freq
placename - 1 freq
placin - 17 freq
pluggin - 3 freq
plasma - 5 freq
pleisantly - 1 freq
pluckin - 4 freq
pleisant - 2 freq
pleughman - 2 freq
pleesant - 2 freq
plaisant - 5 freq
polisman's - 1 freq
polisman - 22 freq
place-mats - 1 freq
pilgim - 1 freq
polishin' - 2 freq
pluckin' - 1 freq
polyshen - 1 freq
pleughing - 1 freq
pleughman's - 1 freq
pleasant - 18 freq
polishin - 10 freq
pulsin - 8 freq
ploughman - 9 freq
poliswummin - 1 freq
pleasanter - 1 freq
pollisman - 2 freq
pelicans - 2 freq
pulsing - 3 freq
plaisin - 1 freq
polkemmet - 2 freq
polisnut - 2 freq
place-names - 10 freq
placenames - 4 freq
place-name - 2 freq
ploughin - 2 freq
polismen - 2 freq
polygamists - 3 freq
polygamist - 1 freq
placement - 6 freq
policeman - 3 freq
pleasing - 6 freq
pluckan - 1 freq
placements - 5 freq
placenaimes - 2 freq
policyan' - 1 freq
placenaime - 1 freq
placin' - 1 freq
pillagin - 3 freq
pleasan - 1 freq
plaessment - 1 freq
'placement' - 1 freq
plaessments - 2 freq
plesaunce - 1 freq
pleasance - 3 freq
polishing - 3 freq
pleesantries - 1 freq
play-sangs - 1 freq
policy-makkars - 1 freq
pliss-nem - 1 freq
plaesant - 3 freq
polissman - 2 freq
pleisand - 1 freq
policymakkin - 1 freq
pleasantries - 1 freq
pilsner - 1 freq
placing - 2 freq
pillaging - 1 freq
plaisent - 1 freq
pleasantly - 1 freq
€œpolishin - 1 freq
plesant - 2 freq
place-nemmes - 2 freq
policeman's - 1 freq
plaguin - 1 freq
pljmxstz - 1 freq
plusnethelp - 1 freq
plusnet - 1 freq
pleasence - 1 freq
paulajmossie - 1 freq
polygonbooks - 1 freq
placenamesni - 4 freq
policing - 1 freq
MetaPhone code - PLSMN
polisman - 22 freq
pollisman - 2 freq
polismen - 2 freq
policeman - 3 freq
polissman - 2 freq
POLISMAN
Time to execute Levenshtein function - 0.206717 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.373973 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.027877 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.036818 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.000829 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.