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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
acquirt (0) - 1 freq
acquire (1) - 3 freq
lacquert (2) - 1 freq
acquired (2) - 10 freq
acquirin (2) - 3 freq
enquirt (2) - 1 freq
acquent (2) - 15 freq
acquaint (2) - 3 freq
acquant (2) - 8 freq
requirt (2) - 1 freq
squirt (2) - 4 freq
ackwart (3) - 6 freq
scaurt (3) - 2 freq
'quit (3) - 1 freq
'quiet (3) - 2 freq
ackwird (3) - 2 freq
daiquiri (3) - 1 freq
require (3) - 10 freq
occurrt (3) - 1 freq
airt (3) - 294 freq
quiri (3) - 1 freq
jacqui (3) - 1 freq
accur (3) - 1 freq
jacquie (3) - 1 freq
cuit (3) - 2 freq
acquirt (0) - 1 freq
acquire (2) - 3 freq
acquaint (3) - 3 freq
acquant (3) - 8 freq
squirt (3) - 4 freq
acquent (3) - 15 freq
requirt (3) - 1 freq
enquirt (3) - 1 freq
lacquert (3) - 1 freq
acquired (3) - 10 freq
acquirin (3) - 3 freq
clairt (4) - 5 freq
chairt (4) - 17 freq
curt (4) - 1 freq
inquirit (4) - 1 freq
quart (4) - 3 freq
cairt (4) - 92 freq
occurt (4) - 1 freq
court (4) - 153 freq
requirit (4) - 1 freq
couart (4) - 1 freq
inquire (5) - 4 freq
scirt (5) - 1 freq
cuirs (5) - 1 freq
cuivert (5) - 2 freq
SoundEx code - A263
assuired - 1 freq
agreed - 106 freq
ackwart - 6 freq
accordinly - 3 freq
aakward - 6 freq
assured - 30 freq
assert - 7 freq
aseert - 1 freq
aess-cairt - 1 freq
asserting - 1 freq
awkwardly - 8 freq
awkward - 30 freq
awkwart - 1 freq
acrid - 1 freq
accordin - 85 freq
accordion - 24 freq
ascertainin - 1 freq
asserted - 1 freq
ackwartness - 1 freq
asgairth - 17 freq
assertin - 2 freq
accordin' - 3 freq
ackwartly - 1 freq
accured - 1 freq
accord - 7 freq
akward - 3 freq
accordingly - 2 freq
asserts - 1 freq
assuredly - 1 freq
awkwardness - 4 freq
assortit - 3 freq
accoard - 2 freq
agreet - 17 freq
acquired - 10 freq
agreeit - 2 freq
aukward - 1 freq
accordionists - 1 freq
a-grade - 1 freq
accoardin - 13 freq
accordance - 3 freq
ackward - 3 freq
accoordinly - 1 freq
ackwird - 2 freq
accurate - 9 freq
accordit - 4 freq
accreditit - 1 freq
accurately - 5 freq
akwardness - 1 freq
aakwardly - 1 freq
accordian - 4 freq
akwird - 2 freq
accredited - 2 freq
accordain - 2 freq
awkart - 2 freq
acquirt - 1 freq
aakwirt - 2 freq
according - 26 freq
assertioun - 2 freq
akwirt - 1 freq
asseert - 1 freq
accurate-like - 1 freq
accreditation - 2 freq
asseirt - 1 freq
asseired - 1 freq
aujord - 1 freq
assortment - 2 freq
assuret - 4 freq
awkartly - 1 freq
assertit - 2 freq
assurt - 1 freq
acrood - 1 freq
agreed-upo - 1 freq
assertive - 2 freq
assertion - 1 freq
accorded - 1 freq
aujourd'hui - 1 freq
€˜accordingly - 1 freq
asjrdjr - 1 freq
ascertained - 1 freq
akrtywscoj - 1 freq
MetaPhone code - AKKRT
accured - 1 freq
accord - 7 freq
accoard - 2 freq
acquired - 10 freq
accurate - 9 freq
acquirt - 1 freq
ACQUIRT
Time to execute Levenshtein function - 0.218928 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.377482 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.028094 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.037821 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.000867 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.