| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| urnae (0) - 31 freq arnae (1) - 18 freq irnae (1) - 23 freq wurnae (1) - 73 freq arna (2) - 23 freq wurna (2) - 2 freq darnae (2) - 5 freq ornge (2) - 1 freq gonae (2) - 38 freq jurnal (2) - 1 freq 'nae (2) - 94 freq une (2) - 4 freq waurnae (2) - 1 freq turnie (2) - 2 freq unce (2) - 7 freq furnace (2) - 12 freq trae (2) - 1 freq uptae (2) - 19 freq urny (2) - 4 freq s'nae (2) - 1 freq wernae (2) - 13 freq nae (2) - 3 freq brae (2) - 283 freq daurnae (2) - 4 freq surname (2) - 12 freq |
urnae (0) - 31 freq irnae (1) - 23 freq arnae (1) - 18 freq ernie (2) - 50 freq arenae (2) - 83 freq erne (2) - 4 freq arne (2) - 1 freq irna (2) - 22 freq urine (2) - 2 freq arnie (2) - 5 freq urn (2) - 6 freq urny (2) - 4 freq wurnae (2) - 73 freq arna (2) - 23 freq anae (3) - 1 freq urns (3) - 2 freq renay (3) - 1 freq turne (3) - 1 freq erae (3) - 1 freq uriah (3) - 2 freq aran (3) - 5 freq ern (3) - 14 freq irae (3) - 1 freq amnae (3) - 2 freq rae (3) - 13 freq |
SoundEx code - U650 urnae - 31 freq urn - 6 freq urine - 2 freq urny - 4 freq |
MetaPhone code - URN urnae - 31 freq urn - 6 freq urine - 2 freq urny - 4 freq |
URNAE |
| Time to execute Levenshtein function - 0.479763 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.701743 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.084904 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.044060 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.001115 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. |