| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ndgear (0) - 1 freq near (2) - 1175 freq dear (2) - 425 freq edgar (2) - 10 freq gear (2) - 237 freq endear (2) - 1 freq nucear (2) - 1 freq drear (2) - 10 freq 'dear (2) - 4 freq niger (2) - 1 freq neat (3) - 44 freq codger (3) - 2 freq dar (3) - 86 freq d'eau (3) - 1 freq 'bear (3) - 1 freq gaar (3) - 1 freq admeir (3) - 2 freq aegean (3) - 4 freq sear (3) - 2 freq nbgan (3) - 1 freq nudges (3) - 4 freq niver (3) - 851 freq gear' (3) - 1 freq fear (3) - 429 freq neal (3) - 1 freq |
ndgear (0) - 1 freq endear (3) - 1 freq niger (3) - 1 freq edgar (3) - 10 freq endager (3) - 1 freq neiger (4) - 1 freq under (4) - 447 freq ndr (4) - 1 freq nidge (4) - 2 freq heidgear (4) - 1 freq wadger (4) - 5 freq andrea (4) - 1 freq heedgear (4) - 1 freq cadger (4) - 5 freq dodger (4) - 5 freq sodger (4) - 114 freq tadger (4) - 3 freq ledger (4) - 1 freq anger (4) - 73 freq gadger (4) - 1 freq lodger (4) - 3 freq nidged (4) - 1 freq nedder (4) - 18 freq ludger (4) - 4 freq nidder (4) - 6 freq |
SoundEx code - N326 nut-gairden - 1 freq net-curteen - 1 freq nutcracker - 2 freq ndgear - 1 freq notthegramma - 2 freq |
MetaPhone code - NJR nigeria - 5 freq niger - 1 freq neiger - 1 freq €œneiger - 1 freq njr - 1 freq ndgear - 1 freq |
NDGEAR |
| Time to execute Levenshtein function - 0.282386 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.438192 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.031601 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.039407 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.001008 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. |