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 place-names in Corpus

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
place-names (0) - 10 freq
place-name (1) - 2 freq
placenames (1) - 4 freq
placenaimes (2) - 2 freq
place-nemmes (2) - 2 freq
placename (2) - 1 freq
placenaime (3) - 1 freq
dgplacenames (3) - 38 freq
placenamesni (3) - 4 freq
place-mats (3) - 1 freq
plane-trees (4) - 1 freq
hoose-names (4) - 1 freq
pleinyies (5) - 1 freq
placards (5) - 2 freq
pale-pale (5) - 1 freq
placies (5) - 4 freq
piece-time (5) - 3 freq
slack-jawed (5) - 2 freq
space-time (5) - 1 freq
places-aal (5) - 1 freq
plaens (5) - 1 freq
lacerated (5) - 1 freq
play-sangs (5) - 1 freq
brand-name (5) - 1 freq
nick-name (5) - 1 freq
place-names (0) - 10 freq
placenames (2) - 4 freq
place-name (2) - 2 freq
place-nemmes (3) - 2 freq
placenaimes (3) - 2 freq
placename (4) - 1 freq
place-mats (5) - 1 freq
placenamesni (5) - 4 freq
placenaime (5) - 1 freq
dgplacenames (6) - 38 freq
placements (7) - 5 freq
hoose-names (7) - 1 freq
plane-trees (7) - 1 freq
plaeces (8) - 3 freq
places (8) - 246 freq
eik-names (8) - 1 freq
lace-ups (8) - 1 freq
placement (8) - 6 freq
play-time (8) - 1 freq
pince-nez (8) - 1 freq
nicknames (8) - 1 freq
licences (8) - 2 freq
planes (8) - 19 freq
placeys (8) - 3 freq
bird-names (8) - 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 - 19 freq
pulsin - 9 freq
polishin - 10 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 - PLSNMS
place-names - 10 freq
placenames - 4 freq
placenaimes - 2 freq
place-nemmes - 2 freq
PLACE-NAMES
Time to execute Levenshtein function - 0.230336 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.416270 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.029484 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.039949 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.001063 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.