| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nivwver (0) - 5 freq nivver (1) - 977 freq nivwer (1) - 6 freq niwver (1) - 6 freq niwer (2) - 28 freq niver (2) - 851 freq niver (2) - 1 freq kivvver (2) - 1 freq ivver (2) - 276 freq nevwvir (2) - 1 freq kivver (2) - 6 freq 'nivver (2) - 3 freq iwver (2) - 1 freq pivver (2) - 1 freq yivver (2) - 4 freq clivwver (2) - 1 freq nivvir (2) - 27 freq nhivver (2) - 1 freq savwver (2) - 1 freq 'niwver (2) - 1 freq fivver (2) - 4 freq nivvers (2) - 1 freq ivve (3) - 1 freq niger (3) - 1 freq hivvier (3) - 2 freq |
nivwver (0) - 5 freq nevwvir (2) - 1 freq niwver (2) - 6 freq nivwer (2) - 6 freq nivver (2) - 977 freq nivvir (3) - 27 freq savwver (3) - 1 freq fivver (4) - 4 freq 'niwver (4) - 1 freq newvir (4) - 6 freq fooivwver (4) - 1 freq nevvir (4) - 32 freq clivwver (4) - 1 freq nivvers (4) - 1 freq nhivver (4) - 1 freq yivver (4) - 4 freq niver (4) - 1 freq niwer (4) - 28 freq niver (4) - 851 freq kivvver (4) - 1 freq ivver (4) - 276 freq pivver (4) - 1 freq iwver (4) - 1 freq 'nivver (4) - 3 freq kivver (4) - 6 freq |
SoundEx code - N116 nivwver - 5 freq nevwvir - 1 freq naeafifermasel - 1 freq |
MetaPhone code - NFFR nivwver - 5 freq nevwvir - 1 freq |
NIVWVER |
| Time to execute Levenshtein function - 0.200087 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.381688 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.027999 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.038519 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.000921 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. |