| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unnerlined (0) - 2 freq unnerline (1) - 2 freq underlined (1) - 2 freq underlines (2) - 1 freq unnerlie (2) - 1 freq unnermines (2) - 1 freq underline (2) - 3 freq undermined (2) - 1 freq unnermine (2) - 3 freq unnerlinin (2) - 2 freq unnerpinned (2) - 4 freq unner-fed (3) - 1 freq underned (3) - 1 freq unmerited (3) - 1 freq unnerpeyed (3) - 1 freq unnerpins (3) - 2 freq unnertone (3) - 2 freq unnerminin (3) - 1 freq unreined (3) - 1 freq unmerried (3) - 1 freq undermine (3) - 1 freq unnerin (3) - 1 freq unnerved (3) - 2 freq undersized (3) - 2 freq unnergane (3) - 1 freq |
unnerlined (0) - 2 freq underlined (2) - 2 freq unnerline (2) - 2 freq unnerlinin (3) - 2 freq unnerpinned (4) - 4 freq unnerlie (4) - 1 freq unnerlyin (4) - 6 freq unnermine (4) - 3 freq underlines (4) - 1 freq unnermines (4) - 1 freq underline (4) - 3 freq undermined (4) - 1 freq unnergane (5) - 1 freq unnerved (5) - 2 freq unnerpin (5) - 1 freq unnervin (5) - 1 freq unnerin (5) - 1 freq unnersteed (5) - 3 freq unnerside (5) - 1 freq innerlie (5) - 7 freq unnertone (5) - 2 freq unnerpins (5) - 2 freq unnerpeyed (5) - 1 freq underned (5) - 1 freq unnerminin (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 - UNRLNT unnerlined - 2 freq |
UNNERLINED |
| Time to execute Levenshtein function - 0.200717 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.395752 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.027799 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.040186 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.000884 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. |