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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
aniline (0) - 9 freq
ailins (2) - 1 freq
abilene (2) - 2 freq
asinine (2) - 2 freq
abiine (2) - 3 freq
anlie (2) - 15 freq
on-line (2) - 9 freq
ailie (2) - 1 freq
landline (2) - 1 freq
ailice (2) - 295 freq
affline (2) - 2 freq
ajilice (2) - 1 freq
angeline (2) - 7 freq
adeline (2) - 2 freq
ailin (2) - 2 freq
oanline (2) - 36 freq
incline (2) - 6 freq
anglice (2) - 1 freq
online (2) - 142 freq
anelie (2) - 25 freq
anglin (2) - 2 freq
airline (2) - 1 freq
airing (3) - 1 freq
aalie (3) - 1 freq
eilins (3) - 4 freq
aniline (0) - 9 freq
oanline (2) - 36 freq
online (2) - 142 freq
incline (3) - 6 freq
adeline (3) - 2 freq
ailin (3) - 2 freq
anelie (3) - 25 freq
nailin (3) - 1 freq
unalane (3) - 1 freq
anglin (3) - 2 freq
angeline (3) - 7 freq
airline (3) - 1 freq
on-line (3) - 9 freq
anlie (3) - 15 freq
abilene (3) - 2 freq
cuilin (4) - 1 freq
outline (4) - 2 freq
leilane (4) - 1 freq
hailin (4) - 7 freq
failin (4) - 26 freq
roilin (4) - 1 freq
beeline (4) - 3 freq
alane (4) - 267 freq
ainin (4) - 1 freq
tailin (4) - 1 freq
SoundEx code - A545
aniline - 9 freq
annielennox - 1 freq
MetaPhone code - ANLN
aniline - 9 freq
ANILINE
Time to execute Levenshtein function - 0.182696 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.341216 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.027108 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.037008 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.000857 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.