| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unnér (0) - 5 freq hunnér (1) - 3 freq wunnér (1) - 2 freq unnèr (1) - 27 freq unnder (2) - 1 freq wunnèr (2) - 1 freq hunnérs (2) - 2 freq wunnérs (2) - 1 freq dannér (2) - 1 freq unner (2) - 461 freq plunnér (2) - 1 freq wuntér (2) - 1 freq unnser (2) - 8 freq hunnèr (2) - 24 freq flér (3) - 1 freq onner (3) - 3 freq under (3) - 447 freq wannért (3) - 1 freq onié (3) - 1 freq dunner (3) - 6 freq unnerx (3) - 1 freq ulstér (3) - 2 freq wunnèrt (3) - 2 freq cunnar (3) - 1 freq eftér (3) - 16 freq |
unnér (0) - 5 freq hunnér (2) - 3 freq unnèr (2) - 27 freq wunnér (2) - 2 freq dannér (3) - 1 freq wuntér (4) - 1 freq plunnér (4) - 1 freq hunnèr (4) - 24 freq niné (4) - 1 freq unnser (4) - 8 freq unner (4) - 461 freq wunnèr (4) - 1 freq hunnérs (4) - 2 freq unnder (4) - 1 freq wunnérs (4) - 1 freq ném (5) - 1 freq hinnèr (5) - 1 freq wunnérin (5) - 1 freq onnher (5) - 1 freq ciné (5) - 2 freq onnir (5) - 1 freq né (5) - 2 freq inner (5) - 46 freq naé (5) - 1 freq dennèr (5) - 4 freq |
SoundEx code - U560 unner - 461 freq unaware - 6 freq unnér - 5 freq unnèr - 27 freq unweir - 1 freq unnerwye - 1 freq unawaar - 3 freq uimor - 1 freq unnerway - 1 freq uimour - 3 freq uner - 2 freq umour - 1 freq unnerwey - 1 freq €˜unner - 1 freq un-hear - 1 freq |
MetaPhone code - UNR unner - 461 freq unnér - 5 freq unnèr - 27 freq uner - 2 freq €˜unner - 1 freq |
UNNÉR |
| Time to execute Levenshtein function - 0.180773 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.333049 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.028429 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.043999 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.000920 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. |