| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| netherwarl (0) - 1 freq netherwarld (1) - 8 freq netherwood (3) - 7 freq nethermill (3) - 1 freq ethereal (3) - 2 freq itherwarld (3) - 3 freq nethergate (3) - 13 freq netherdale (3) - 1 freq neteral (3) - 1 freq ethernan (4) - 5 freq etherwaves (4) - 4 freq netherbow (4) - 6 freq efterward (4) - 9 freq nevermar (4) - 1 freq efterwart (4) - 1 freq motherwell (4) - 30 freq netwark (4) - 2 freq thermal (4) - 12 freq peterhart (4) - 1 freq nethertoon (4) - 2 freq nether (4) - 26 freq itherworld (4) - 1 freq afterward (4) - 4 freq funetheral (4) - 1 freq nethersaxon (4) - 2 freq |
netherwarl (0) - 1 freq netherwarld (2) - 8 freq itherwarld (5) - 3 freq netherdale (5) - 1 freq netherwood (5) - 7 freq nethermill (5) - 1 freq ethereal (6) - 2 freq mitherweel (6) - 1 freq itherworld (6) - 1 freq nethergate (6) - 13 freq neteral (6) - 1 freq motherwell (6) - 30 freq afterward (7) - 4 freq nethersaxon (7) - 2 freq funetheral (7) - 1 freq enthral (7) - 2 freq nether (7) - 26 freq networkrail (7) - 1 freq thrawart (7) - 4 freq netherthird (7) - 1 freq itherwardlie (7) - 1 freq efterwart (7) - 1 freq etherwaves (7) - 4 freq efterward (7) - 9 freq netherbow (7) - 6 freq |
SoundEx code - N366 netherwarl - 1 freq netherwarld - 8 freq |
MetaPhone code - N0RWRL netherwarl - 1 freq |
NETHERWARL |
| Time to execute Levenshtein function - 0.218459 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.393621 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.027524 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.041394 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.000918 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. |