| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fnaar (0) - 2 freq snaar (1) - 1 freq faar (1) - 81 freq naar (1) - 7 freq knaa (2) - 1 freq friar (2) - 1 freq nanr (2) - 1 freq aar (2) - 5 freq faad (2) - 22 freq fng'r (2) - 1 freq floar (2) - 6 freq faer (2) - 59 freq xnair (2) - 1 freq ansar (2) - 1 freq haar (2) - 110 freq naa (2) - 31 freq fawr (2) - 1 freq flaaw (2) - 1 freq flair (2) - 398 freq caar (2) - 1 freq ncar (2) - 1 freq farar (2) - 1 freq fatr (2) - 1 freq snaay (2) - 1 freq far (2) - 1549 freq |
fnaar (0) - 2 freq snaar (2) - 1 freq naar (2) - 7 freq faar (2) - 81 freq gnar (3) - 1 freq nair (3) - 2 freq fair (3) - 1530 freq flaur (3) - 1 freq foar (3) - 1 freq naur (3) - 10 freq farr (3) - 1 freq fyndar (3) - 1 freq faur (3) - 728 freq fayr (3) - 1 freq near (3) - 1175 freq wnar (3) - 1 freq anar (3) - 1 freq fewar (3) - 1 freq faan (3) - 70 freq fuar (3) - 1 freq fear (3) - 429 freq 'near (3) - 1 freq fraa (3) - 2 freq nar (3) - 15 freq finer (3) - 14 freq |
SoundEx code - F560 finer - 14 freq finerie - 2 freq fooner - 4 freq finery - 5 freq funner - 1 freq faemier - 2 freq famour - 1 freq funnier - 7 freq fweohnor - 1 freq fnaar - 2 freq fwmre - 1 freq |
MetaPhone code - FNR finer - 14 freq vanir - 5 freq finerie - 2 freq fooner - 4 freq finery - 5 freq funner - 1 freq funnier - 7 freq venera - 2 freq veneer - 1 freq fnaar - 2 freq |
FNAAR |
| Time to execute Levenshtein function - 0.236039 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.414993 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.039245 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.038810 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.000867 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. |