Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
adore (0) - 12 freq adorn (1) - 6 freq atore (1) - 2 freq afore (1) - 3467 freq dore (1) - 3 freq adobe (1) - 2 freq amore (1) - 1 freq adored (1) - 5 freq adores (1) - 2 freq 'fore (2) - 1 freq whore (2) - 1 freq arose (2) - 15 freq apone (2) - 3 freq tagore (2) - 2 freq adopt (2) - 11 freq acre (2) - 17 freq pore (2) - 2 freq vore (2) - 2 freq dome (2) - 24 freq atone (2) - 2 freq dorie (2) - 1 freq fore (2) - 155 freq adom (2) - 1 freq dowe (2) - 1 freq dorr (2) - 43 freq |
adore (0) - 12 freq dore (1) - 3 freq doire (2) - 1 freq dory (2) - 1 freq dire (2) - 9 freq dare (2) - 61 freq dure (2) - 64 freq dor (2) - 5 freq dere (2) - 207 freq dorie (2) - 1 freq adobe (2) - 2 freq atore (2) - 2 freq afore (2) - 3467 freq adorn (2) - 6 freq amore (2) - 1 freq adores (2) - 2 freq adored (2) - 5 freq afiore (3) - 1 freq are (3) - 5107 freq eader (3) - 1 freq ado (3) - 4 freq audrey (3) - 13 freq dors (3) - 1 freq afor (3) - 25 freq azor (3) - 4 freq |
SoundEx code - A360 aither - 140 freq author - 37 freq atour - 11 freq atore - 2 freq adhere - 7 freq atray - 2 freq aidder - 1 freq adore - 12 freq attire - 12 freq aeter - 1 freq ather - 3 freq at'r - 1 freq aether - 1 freq audrey - 13 freq attour - 5 freq atterie - 4 freq aider - 2 freq atoore - 3 freq €˜author - 1 freq aiterie - 1 freq atoure - 1 freq atower - 1 freq ayther - 3 freq adder - 4 freq attery - 1 freq attar - 1 freq athraw - 1 freq atter - 1 freq aidter - 1 freq atari - 1 freq adair - 1 freq atr - 1 freq |
MetaPhone code - ATR atour - 11 freq atore - 2 freq atray - 2 freq aidder - 1 freq adore - 12 freq attire - 12 freq at'r - 1 freq audrey - 13 freq attour - 5 freq atterie - 4 freq aider - 2 freq atoore - 3 freq aiterie - 1 freq atoure - 1 freq adder - 4 freq attery - 1 freq attar - 1 freq atter - 1 freq atari - 1 freq adair - 1 freq atr - 1 freq |
ADORE |
Time to execute Levenshtein function - 0.191810 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.375780 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.028582 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.038022 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.000993 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. |