| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| accur (0) - 1 freq occur (1) - 7 freq amour (2) - 1 freq acher (2) - 1 freq aur (2) - 1 freq acud (2) - 1 freq accord (2) - 8 freq acaus (2) - 2 freq aftur (2) - 1 freq ancus (2) - 2 freq armur (2) - 1 freq atour (2) - 11 freq occurt (2) - 1 freq awaur (2) - 43 freq scur (2) - 1 freq artur (2) - 1 freq vaccum (2) - 1 freq cur (2) - 6 freq acer (2) - 1 freq cour (2) - 1 freq scour (2) - 4 freq augur (2) - 1 freq mccr (2) - 1 freq acum (2) - 1 freq incur (2) - 2 freq |
accur (0) - 1 freq occur (1) - 7 freq scaur (3) - 14 freq incur (3) - 2 freq actor (3) - 19 freq scour (3) - 4 freq cour (3) - 1 freq accuse (3) - 6 freq mccr (3) - 1 freq caur (3) - 125 freq acce (3) - 1 freq accured (3) - 1 freq ackir (3) - 1 freq occurs (3) - 7 freq acer (3) - 1 freq acair (3) - 1 freq accep (3) - 12 freq recur (3) - 1 freq scur (3) - 1 freq occurt (3) - 1 freq accord (3) - 8 freq cur (3) - 6 freq acher (3) - 1 freq hcr (4) - 2 freq acroo (4) - 1 freq |
SoundEx code - A260 agree - 159 freq assure - 21 freq assuir - 2 freq aisier - 12 freq azr - 1 freq ashore - 35 freq augury - 1 freq aggro - 3 freq aesir - 4 freq aiger - 2 freq ashaor - 1 freq ashoar - 3 freq accur - 1 freq acroo - 1 freq acre - 20 freq ajar - 4 freq azor - 4 freq asher - 1 freq azariah - 2 freq aser - 1 freq aesier - 13 freq acquire - 3 freq azure - 3 freq acer - 1 freq aikeray - 2 freq a'haacro - 1 freq auskerry - 1 freq akker - 1 freq asseer - 1 freq ackir - 1 freq acair - 1 freq asseir - 1 freq augur - 1 freq €™azur - 1 freq aesyir - 1 freq acher - 1 freq agr - 1 freq augher - 1 freq agri - 1 freq ajr - 1 freq ajer - 2 freq asure - 1 freq |
MetaPhone code - AKKR accur - 1 freq acquire - 3 freq |
ACCUR |
| Time to execute Levenshtein function - 0.237944 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.427523 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.027805 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.038137 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.000937 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. |