| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uranus (0) - 22 freq uranos (1) - 1 freq rants (2) - 6 freq gran's (2) - 11 freq granes (2) - 1 freq granut (2) - 1 freq ranks (2) - 27 freq francs (2) - 12 freq trans (2) - 5 freq uranium (2) - 2 freq grants (2) - 30 freq cronus (2) - 1 freq cranns (2) - 1 freq rans (2) - 1 freq cranes (2) - 7 freq transs (2) - 2 freq jranks (2) - 1 freq wrans (2) - 1 freq cranks (2) - 4 freq rangs (2) - 2 freq crans (2) - 1 freq brands (2) - 7 freq branks (2) - 6 freq urns (2) - 2 freq wrangs (2) - 12 freq |
uranus (0) - 22 freq uranos (1) - 1 freq rans (2) - 1 freq urns (2) - 2 freq runes (3) - 6 freq arins (3) - 1 freq rynes (3) - 3 freq janus (3) - 1 freq aranese (3) - 1 freq vrans (3) - 1 freq raens (3) - 2 freq grans (3) - 2 freq ronis (3) - 1 freq ernes (3) - 1 freq erns (3) - 1 freq ronas (3) - 3 freq rones (3) - 3 freq rins (3) - 101 freq raans (3) - 2 freq runs (3) - 72 freq irons (3) - 3 freq rns (3) - 5 freq canus (3) - 1 freq rains (3) - 27 freq ranks (3) - 27 freq |
SoundEx code - U652 urns - 2 freq uranus - 22 freq ur-ancient - 1 freq urumqi - 1 freq uranos - 1 freq |
MetaPhone code - URNS urns - 2 freq uranus - 22 freq uranos - 1 freq |
URANUS |
| Time to execute Levenshtein function - 0.263669 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.533345 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.056439 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.039009 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.000883 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. |