| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unnerlyin (0) - 6 freq underlyin (1) - 2 freq underlying (2) - 1 freq unnerpin (2) - 1 freq unnerlinin (2) - 2 freq unnerline (2) - 2 freq unnervin (2) - 1 freq unnerlie (2) - 1 freq unnerin (2) - 1 freq underline (3) - 2 freq unveilin (3) - 1 freq uncurlin (3) - 1 freq innerly (3) - 2 freq unnerpins (3) - 2 freq undergoin (3) - 1 freq unnertaen (3) - 3 freq underpin (3) - 1 freq uncertain (3) - 8 freq unnergrun (3) - 3 freq unnerwye (3) - 1 freq wunnerin (3) - 82 freq unner-sie (3) - 2 freq unnerfit (3) - 4 freq dunnerin (3) - 8 freq unnerlined (3) - 2 freq |
unnerlyin (0) - 6 freq underlyin (2) - 2 freq unnerline (2) - 2 freq unnervin (3) - 1 freq unnerin (3) - 1 freq unnerlie (3) - 1 freq unnerlinin (3) - 2 freq unnerpin (3) - 1 freq unnerlined (4) - 2 freq unnerlay (4) - 1 freq underleein (4) - 3 freq innerlie (4) - 6 freq unnertaen (4) - 3 freq wunnerlaun (4) - 4 freq wunnerlan (4) - 4 freq unnermine (4) - 3 freq innerly (4) - 2 freq underlying (4) - 1 freq underline (4) - 2 freq uncurlin (4) - 1 freq unnerstan (5) - 49 freq unfeelin (5) - 2 freq unnerminin (5) - 1 freq unnertone (5) - 2 freq unnergane (5) - 1 freq |
SoundEx code - U564 unrolled - 7 freq unrael - 1 freq unreal - 10 freq unnerline - 2 freq unworldly - 1 freq unrelentin - 3 freq unroult - 2 freq unnerlined - 2 freq unnerlinin - 2 freq unrelated - 2 freq unrealistic - 2 freq unnerlay - 1 freq unroyalle - 1 freq unreliable - 2 freq unrulie - 1 freq unrelatit - 2 freq unnaural - 1 freq unnerlyin - 6 freq unnerlie - 1 freq €œunrelated - 1 freq unrelentless - 1 freq unrelenting - 1 freq |
MetaPhone code - UNRLYN unnerlyin - 6 freq |
UNNERLYIN |
| Time to execute Levenshtein function - 0.210603 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.389812 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.028473 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.045281 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.000921 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. |