Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
nivvers (0) - 1 freq nivver's (1) - 1 freq kivvers (1) - 5 freq nivver (1) - 977 freq kivver (2) - 6 freq fivers (2) - 3 freq nives (2) - 2 freq nhivver (2) - 1 freq niwver (2) - 6 freq nippers (2) - 2 freq rievers (2) - 1 freq kivers (2) - 3 freq nickers (2) - 1 freq divvels (2) - 2 freq nivwer (2) - 6 freq fivver (2) - 4 freq niviews (2) - 1 freq yivvery (2) - 1 freq nivwver (2) - 5 freq nithers (2) - 1 freq livers (2) - 1 freq rivers (2) - 30 freq kivvert (2) - 5 freq hivvens (2) - 14 freq givers (2) - 2 freq |
nivvers (0) - 1 freq nivver (2) - 977 freq kivvers (2) - 5 freq nivver's (2) - 1 freq nivvir (3) - 27 freq luvvers (3) - 1 freq vivers (3) - 1 freq niffers (4) - 1 freq divers (4) - 10 freq ivvery (4) - 74 freq 'nivver' (4) - 1 freq niver (4) - 851 freq yivver (4) - 4 freq fivers (4) - 3 freq pivver (4) - 1 freq ivver (4) - 276 freq universe (4) - 42 freq nevvir (4) - 32 freq kivver (4) - 6 freq nhivver (4) - 1 freq veivers (4) - 1 freq slivvers (4) - 3 freq 'nivver (4) - 3 freq nives (4) - 2 freq nieves (4) - 15 freq |
SoundEx code - N162 neebors - 79 freq neibors - 7 freq neeburs - 7 freq niebuhrs - 2 freq niebuhr's - 2 freq novercal - 1 freq neebours - 33 freq neep-perk - 2 freq neibours - 19 freq neibour's - 1 freq neibours' - 1 freq nappers - 6 freq neebor's - 5 freq neebour's - 5 freq neebours' - 1 freq never-stap - 2 freq 'never-stap - 1 freq neebur's - 4 freq neepers - 5 freq nivvers - 1 freq nippers - 2 freq nibors - 2 freq neipours - 8 freq nivver's - 1 freq napier's - 1 freq neebirs - 9 freq neebors' - 2 freq neeborhoose - 1 freq neipers - 2 freq nefariously - 1 freq niffers - 1 freq neep-park - 3 freq nbhorizons - 1 freq newburgh - 1 freq newburghfc - 1 freq nayburs - 1 freq |
MetaPhone code - NFRS nivvers - 1 freq nivver's - 1 freq niffers - 1 freq |
NIVVERS |
Time to execute Levenshtein function - 0.583563 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 - 1.227926 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.093010 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.104154 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.000922 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. |