| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| atray (0) - 2 freq astray (1) - 3 freq tray (1) - 48 freq array (1) - 16 freq stray (1) - 30 freq strag (2) - 1 freq ashtray (2) - 7 freq arraw (2) - 1 freq arry (2) - 1 freq trap (2) - 62 freq airy (2) - 4 freq stran (2) - 2 freq trax (2) - 10 freq ay-ay (2) - 1 freq strak (2) - 15 freq arab (2) - 4 freq trays (2) - 12 freq stay (2) - 159 freq fray (2) - 10 freq dray (2) - 4 freq aeway (2) - 1 freq ayday (2) - 1 freq aay (2) - 1 freq ata' (2) - 6 freq aglay (2) - 1 freq |
atray (0) - 2 freq tray (1) - 48 freq atr (2) - 1 freq try (2) - 802 freq triy (2) - 2 freq astray (2) - 3 freq troy (2) - 8 freq array (2) - 16 freq stray (2) - 30 freq tra (2) - 1 freq trae (2) - 1 freq foray (3) - 1 freq arra (3) - 32 freq tar (3) - 26 freq ytr (3) - 1 freq atour (3) - 11 freq tr (3) - 8 freq tay (3) - 186 freq treu (3) - 1 freq tras (3) - 1 freq trak (3) - 3 freq teary (3) - 3 freq tear (3) - 103 freq awry (3) - 1 freq bray (3) - 1 freq |
SoundEx code - A360 aither - 141 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 |
ATRAY |
| Time to execute Levenshtein function - 0.232907 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.356572 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.028373 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.045112 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.000923 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. |