Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
nepal (0) - 1 freq neal (1) - 1 freq lepan (2) - 1 freq papal (2) - 5 freq nevar (2) - 1 freq heal (2) - 27 freq metal (2) - 92 freq medal (2) - 23 freq nept (2) - 1 freq nea (2) - 1 freq teal (2) - 2 freq nell (2) - 13 freq nial (2) - 4 freq seal (2) - 31 freq repay (2) - 1 freq neale (2) - 1 freq leal (2) - 43 freq neill (2) - 17 freq meal (2) - 130 freq near (2) - 1175 freq neat (2) - 44 freq pal (2) - 508 freq napa (2) - 3 freq repas (2) - 1 freq beal (2) - 3 freq |
nepal (0) - 1 freq neal (2) - 1 freq nal (3) - 1 freq natal (3) - 2 freq peal (3) - 3 freq epl (3) - 9 freq napa (3) - 3 freq pepil (3) - 2 freq nasal (3) - 9 freq neap (3) - 1 freq repel (3) - 2 freq napalm (3) - 3 freq naval (3) - 8 freq neill (3) - 17 freq njal (3) - 8 freq neil (3) - 87 freq pal (3) - 508 freq nell (3) - 13 freq nept (3) - 1 freq papal (3) - 5 freq neale (3) - 1 freq nial (3) - 4 freq nil (4) - 7 freq anal (4) - 1 freq neepur (4) - 1 freq |
SoundEx code - N140 noble - 32 freq nibble - 8 freq nipple - 3 freq novel - 65 freq naval - 8 freq neville - 14 freq nippily - 2 freq 'noble - 1 freq 'nobel - 1 freq nobel - 9 freq novelle - 4 freq noabil - 1 freq novella - 4 freq nobil - 1 freq nobill - 1 freq naafil - 1 freq navel - 1 freq €˜noble - 1 freq nepal - 1 freq novil - 3 freq nfl - 2 freq nebbiolo - 1 freq |
MetaPhone code - NPL nipple - 3 freq nippily - 2 freq nepal - 1 freq |
NEPAL |
Time to execute Levenshtein function - 0.204039 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.359851 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.027476 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.037770 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.000895 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. |