| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| navefu (0) - 1 freq naffu (2) - 1 freq carefu (2) - 23 freq naefun (2) - 1 freq nave (2) - 1 freq navel (2) - 1 freq facefu (2) - 2 freq awefu (2) - 1 freq naver (2) - 3 freq fatefu (2) - 5 freq pacefu (2) - 1 freq hatefu (2) - 5 freq waefu (2) - 25 freq navels (2) - 1 freq balefu (2) - 2 freq neivefu (2) - 1 freq haunfu (3) - 8 freq naked (3) - 22 freq nove (3) - 1 freq naein (3) - 1 freq raef (3) - 2 freq lawfu (3) - 4 freq havera (3) - 2 freq naafi (3) - 1 freq rave (3) - 10 freq |
navefu (0) - 1 freq neivefu (2) - 1 freq naver (3) - 3 freq navel (3) - 1 freq nave (3) - 1 freq envyfu (3) - 1 freq naffu (3) - 1 freq naive (4) - 11 freq nouveau (4) - 3 freq nav (4) - 3 freq novel (4) - 65 freq niven (4) - 3 freq naff (4) - 2 freq neave (4) - 3 freq neive-fu (4) - 1 freq navy (4) - 45 freq navies (4) - 1 freq nevet (4) - 1 freq nievefus (4) - 1 freq nfu (4) - 1 freq navir (4) - 2 freq niver (4) - 851 freq naval (4) - 8 freq navvy (4) - 1 freq needfu (4) - 12 freq |
SoundEx code - N110 nippy-yappy - 1 freq navefu - 1 freq neive-fu - 1 freq neivefu - 1 freq nabob - 1 freq nefife - 1 freq |
MetaPhone code - NFF navefu - 1 freq neive-fu - 1 freq neivefu - 1 freq nev-foo - 1 freq nefife - 1 freq |
NAVEFU |
| Time to execute Levenshtein function - 0.231701 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.396654 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.028132 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.038275 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.000897 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. |