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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
parliamentary (0) - 4 freq
pairliamentary (1) - 8 freq
parliamentarie (2) - 1 freq
pairlamentary (2) - 3 freq
parliaments (3) - 10 freq
parliament's (3) - 3 freq
parliamentin (3) - 1 freq
parliament' (3) - 1 freq
parliament- (3) - 1 freq
parliament (3) - 76 freq
pairliament (4) - 68 freq
pairliaments' (4) - 1 freq
pairlementar (4) - 5 freq
paliament (4) - 1 freq
parliamint (4) - 1 freq
pairliament's (4) - 1 freq
pairliaments (4) - 7 freq
pairlementars (4) - 6 freq
planetary (5) - 4 freq
rudimentary (5) - 2 freq
perliement (5) - 1 freq
€˜parliament (5) - 2 freq
elementary (5) - 4 freq
parlimint (5) - 1 freq
pairliamentarians (5) - 1 freq
parliamentary (0) - 4 freq
pairliamentary (1) - 8 freq
pairlamentary (2) - 3 freq
parliamentarie (2) - 1 freq
parliament (4) - 76 freq
pairlementar (4) - 5 freq
parliament- (4) - 1 freq
parliamentin (4) - 1 freq
parliament' (4) - 1 freq
parliaments (4) - 10 freq
pairliaments (5) - 7 freq
pairlementars (5) - 6 freq
pairlementer (5) - 1 freq
parliamint (5) - 1 freq
pairliament (5) - 68 freq
parliament's (5) - 3 freq
parlimint (6) - 1 freq
preliminary (6) - 1 freq
pairlamentarian (6) - 1 freq
perlament (6) - 8 freq
pairliaments' (6) - 1 freq
paliament (6) - 1 freq
pairliament's (6) - 1 freq
pairlament (6) - 180 freq
pairlaments (6) - 5 freq
SoundEx code - P645
pirlin - 8 freq
pairliament - 68 freq
parliament - 76 freq
pairlament - 180 freq
pairlaments - 5 freq
parliaments - 10 freq
pairliamentary - 8 freq
pairliaments' - 1 freq
pairliaments - 7 freq
parliamentary - 4 freq
parlance - 2 freq
prelims - 2 freq
prelim - 7 freq
parliament's - 3 freq
pairlaments' - 1 freq
'preliminar - 1 freq
'preliminars' - 1 freq
'parlamentarium' - 1 freq
perlament - 8 freq
preliminarie - 1 freq
prowlin - 3 freq
parliamentarie - 1 freq
preliminary - 1 freq
pairliament's - 1 freq
purlin - 1 freq
perlins - 3 freq
pairlementar - 5 freq
pairlementars - 6 freq
pairlementer - 1 freq
pairlamentary - 3 freq
pairlament's - 4 freq
preliminaries - 1 freq
parliamint - 1 freq
perliement - 1 freq
parliament- - 1 freq
preliminar - 1 freq
pairlamentarian - 1 freq
€˜parliament - 2 freq
€˜pairlament - 2 freq
parliamo - 4 freq
pairliamentarians - 1 freq
prlngydpif - 1 freq
parlimint - 1 freq
prolonged - 1 freq
parliamentin - 1 freq
parlm - 2 freq
parlmt - 1 freq
parliament' - 1 freq
paralympics - 1 freq
prowlandson - 1 freq
MetaPhone code - PRLMNTR
pairliamentary - 8 freq
parliamentary - 4 freq
parliamentarie - 1 freq
pairlementar - 5 freq
pairlementer - 1 freq
pairlamentary - 3 freq
PARLIAMENTARY
Time to execute Levenshtein function - 0.205490 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.387751 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.028846 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.044670 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.000858 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.