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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
homophobic (0) - 3 freq
homophobe (2) - 1 freq
xenophobic (3) - 5 freq
homophones (3) - 2 freq
homophons (3) - 1 freq
homoerotic (3) - 2 freq
fatphobic (4) - 1 freq
polyphonic (4) - 2 freq
ergophobics (4) - 1 freq
acrophobia (4) - 1 freq
xenophobia (4) - 7 freq
hoopin (5) - 5 freq
euphoric (5) - 3 freq
hoochin (5) - 2 freq
humphin (5) - 17 freq
atmospheric (5) - 6 freq
cacophonie (5) - 1 freq
phobia (5) - 3 freq
hooshin (5) - 1 freq
hohoho (5) - 2 freq
phonic (5) - 2 freq
emphatic (5) - 4 freq
fatphobia (5) - 2 freq
anglophobia (5) - 1 freq
componit (5) - 1 freq
homophobic (0) - 3 freq
homophobe (3) - 1 freq
homophons (5) - 1 freq
homophones (5) - 2 freq
xenophobic (5) - 5 freq
fatphobic (6) - 1 freq
homoerotic (6) - 2 freq
xenophobia (7) - 7 freq
humphin (7) - 17 freq
emphatic (7) - 4 freq
acrophobia (7) - 1 freq
polyphonic (7) - 2 freq
humphit (7) - 1 freq
ergophobics (7) - 1 freq
atmosheric (8) - 1 freq
haemophilus (8) - 1 freq
humphed (8) - 9 freq
prophetic (8) - 2 freq
humphers (8) - 1 freq
hypnotic (8) - 4 freq
humph (8) - 14 freq
humphd (8) - 1 freq
humphrey (8) - 1 freq
amphibian (8) - 1 freq
humphy (8) - 52 freq
SoundEx code - H511
humphie-back - 1 freq
humfy-backit - 1 freq
humphy-backit - 6 freq
humpie-backit - 1 freq
haunbuffed - 1 freq
humphie-backit - 1 freq
humpybackit - 1 freq
homophobic - 3 freq
homophobe - 1 freq
MetaPhone code - HMFBK
humphie-back - 1 freq
homophobic - 3 freq
HOMOPHOBIC
Time to execute Levenshtein function - 0.187854 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.343736 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.026942 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.037033 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.000856 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.