| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unner (0) - 454 freq dunner (1) - 6 freq funner (1) - 1 freq runner (1) - 19 freq unter (1) - 1 freq unser (1) - 3 freq inner (1) - 44 freq onner (1) - 3 freq hunner (1) - 434 freq unnerx (1) - 1 freq under (1) - 429 freq unnser (1) - 8 freq unker (1) - 4 freq gunner (1) - 2 freq unnder (1) - 1 freq wunner (1) - 281 freq uner (1) - 2 freq neer (2) - 51 freq duncer (2) - 6 freq ueber (2) - 1 freq undr (2) - 1 freq liner (2) - 4 freq dunder (2) - 5 freq hunnert (2) - 14 freq ungert (2) - 1 freq |
unner (0) - 454 freq onner (1) - 3 freq inner (1) - 44 freq unnder (2) - 1 freq unker (2) - 4 freq gunner (2) - 2 freq wunner (2) - 281 freq yonner (2) - 67 freq aonner (2) - 1 freq onnir (2) - 1 freq unnser (2) - 8 freq uner (2) - 2 freq runner (2) - 19 freq under (2) - 429 freq dunner (2) - 6 freq unter (2) - 1 freq funner (2) - 1 freq hunner (2) - 434 freq unser (2) - 3 freq unnerx (2) - 1 freq sinner (3) - 10 freq cinner (3) - 1 freq aner (3) - 2 freq enter (3) - 70 freq siner (3) - 1 freq |
SoundEx code - U560 unner - 454 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 - 454 freq unnér - 5 freq unnèr - 27 freq uner - 2 freq €˜unner - 1 freq |
UNNER under - 429 freq unner - 454 freq unders - freq |
| Time to execute Levenshtein function - 0.182993 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.323631 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.027292 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.037008 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.000974 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. |