| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| amorra (0) - 2 freq emorra (1) - 1 freq morra (1) - 79 freq ramorra (1) - 1 freq anurra (2) - 3 freq morga (2) - 1 freq torra (2) - 2 freq morra- (2) - 1 freq moarra (2) - 1 freq smora (2) - 1 freq moira (2) - 88 freq amor (2) - 1 freq morra' (2) - 1 freq amour (2) - 1 freq amoral (2) - 1 freq morro (2) - 18 freq mora (2) - 8 freq sorra (2) - 43 freq orra (2) - 172 freq arra (2) - 32 freq amoeba (2) - 1 freq morrae (2) - 2 freq amoffa (2) - 1 freq morna (2) - 12 freq amara (2) - 1 freq |
amorra (0) - 2 freq morra (1) - 79 freq emorra (1) - 1 freq marra (2) - 19 freq moarra (2) - 1 freq morro (2) - 18 freq morrae (2) - 2 freq ramorra (2) - 1 freq mirra (2) - 3 freq morna (3) - 12 freq amore (3) - 1 freq amara (3) - 1 freq borra (3) - 2 freq marrae (3) - 8 freq mirrae (3) - 1 freq mirr (3) - 3 freq mirry (3) - 8 freq murr (3) - 1 freq merro (3) - 1 freq marr (3) - 5 freq morear (3) - 3 freq merry (3) - 69 freq marry (3) - 11 freq murray (3) - 128 freq amor (3) - 1 freq |
SoundEx code - A560 ah'mur - 3 freq anywhere - 33 freq ahunner - 1 freq anhere - 1 freq aonner - 1 freq any-whar - 1 freq awner - 4 freq anywhar - 2 freq aumry - 1 freq amor - 1 freq amara - 1 freq aaner - 1 freq amore - 1 freq aumrie - 3 freq ainer - 2 freq anar - 1 freq anywherr - 1 freq anywhaur - 2 freq anurr - 4 freq anurra - 3 freq amour - 1 freq amyire - 1 freq annmari - 2 freq anr - 1 freq anywhur - 2 freq amorra - 2 freq aner - 2 freq |
MetaPhone code - AMR ah'mur - 3 freq amber - 13 freq aumry - 1 freq amor - 1 freq amara - 1 freq amore - 1 freq aumrie - 3 freq amour - 1 freq €˜amber - 1 freq amorra - 2 freq |
AMORRA |
| Time to execute Levenshtein function - 0.220549 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.441700 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.035465 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.046457 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.001140 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. |