Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
naval (0) - 8 freq nasal (1) - 9 freq navel (1) - 1 freq natal (1) - 2 freq nava (1) - 30 freq yaval (1) - 1 freq nava's (2) - 2 freq rival (2) - 14 freq oval (2) - 7 freq savan (2) - 1 freq napa (2) - 3 freq novel (2) - 65 freq nave (2) - 1 freq ravan (2) - 2 freq naan (2) - 2 freq nalll (2) - 1 freq ava' (2) - 1 freq deval (2) - 4 freq naa (2) - 31 freq cava (2) - 1 freq navy (2) - 45 freq haaal (2) - 1 freq nasl (2) - 1 freq avaa (2) - 30 freq canal (2) - 27 freq |
naval (0) - 8 freq navel (1) - 1 freq novil (2) - 3 freq novel (2) - 65 freq yaval (2) - 1 freq natal (2) - 2 freq nasal (2) - 9 freq nava (2) - 30 freq gavel (3) - 6 freq nial (3) - 4 freq novak (3) - 4 freq nal (3) - 1 freq njal (3) - 8 freq navir (3) - 2 freq pavel (3) - 1 freq anvil (3) - 5 freq nail (3) - 46 freq nav (3) - 3 freq natale (3) - 1 freq neal (3) - 1 freq nevar (3) - 1 freq navajo (3) - 1 freq naver (3) - 3 freq navels (3) - 1 freq val (3) - 34 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 - NFL novel - 65 freq naval - 8 freq neville - 14 freq novelle - 4 freq novella - 4 freq naafil - 1 freq navel - 1 freq novil - 3 freq nfl - 2 freq |
NAVAL |
Time to execute Levenshtein function - 0.366362 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.375827 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.031811 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.043584 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.000866 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. |