| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| netbaw (0) - 1 freq meatbaw (2) - 4 freq nethan (2) - 3 freq netta (2) - 6 freq fotbaw (2) - 1 freq fitbaw (2) - 217 freq hetbed (3) - 1 freq neebur (3) - 11 freq elbow (3) - 20 freq getan (3) - 1 freq taw (3) - 10 freq nebdy (3) - 1 freq yellaw (3) - 1 freq snowbaw (3) - 1 freq ee-aw (3) - 1 freq reiban (3) - 2 freq petal (3) - 11 freq ratbag (3) - 2 freq nets (3) - 46 freq fitbaa (3) - 10 freq baw (3) - 132 freq bethan (3) - 1 freq neabdy (3) - 1 freq needan (3) - 14 freq ebban (3) - 1 freq |
netbaw (0) - 1 freq fitbaw (3) - 217 freq fotbaw (3) - 1 freq meatbaw (3) - 4 freq nitb (4) - 1 freq netta (4) - 6 freq tbw (4) - 1 freq nethan (4) - 3 freq futba (5) - 1 freq naw (5) - 1 freq nettle (5) - 8 freq new (5) - 2325 freq fitba (5) - 315 freq fatbaws (5) - 1 freq neebra (5) - 3 freq netter (5) - 6 freq nesbit (5) - 1 freq nebby (5) - 2 freq fitabw (5) - 1 freq netten (5) - 1 freq nathan (5) - 4 freq naetral (5) - 1 freq ataw (5) - 8 freq neibit (5) - 3 freq yitba (5) - 1 freq |
SoundEx code - N310 native - 94 freq needfu - 12 freq netbaw - 1 freq nyatf - 1 freq needfu' - 43 freq nitb - 1 freq ntbppp - 1 freq nthf - 1 freq |
MetaPhone code - NTB netbaw - 1 freq nitb - 1 freq |
NETBAW |
| Time to execute Levenshtein function - 0.203726 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.359295 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.028159 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.037902 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.000923 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. |