| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| newheiven (0) - 1 freq eleiven (3) - 15 freq heiven (3) - 109 freq perceivin (4) - 3 freq cheisen (4) - 1 freq beleive (4) - 1 freq nowhere (4) - 9 freq leeven (4) - 2 freq theivin (4) - 3 freq deceive (4) - 7 freq deceivin (4) - 1 freq deceiver (4) - 2 freq sereived (4) - 1 freq nitheen (4) - 1 freq receive (4) - 21 freq newsin (4) - 29 freq wheniver (4) - 3 freq weimen (4) - 12 freq whein (4) - 50 freq wiven (4) - 1 freq seiven (4) - 113 freq needen (4) - 3 freq newbie (4) - 3 freq newin (4) - 1 freq receives (4) - 3 freq |
newheiven (0) - 1 freq heiven (5) - 109 freq heivin (6) - 12 freq newsmen (6) - 2 freq heivan (6) - 1 freq whiten (6) - 1 freq belhaven (6) - 2 freq naewhere (6) - 49 freq nutheen (6) - 9 freq 'wheen (6) - 1 freq niven (6) - 3 freq heaven (6) - 69 freq wyiven (6) - 1 freq wuiven (6) - 3 freq wheen (6) - 829 freq notheen (6) - 41 freq haiven (6) - 34 freq naetheen (6) - 3 freq newhouse (6) - 1 freq heven (6) - 1 freq neythein (6) - 1 freq wheaten (6) - 4 freq 'heaven (6) - 1 freq whaiver (6) - 30 freq heeven (6) - 12 freq |
SoundEx code - N150 nippin - 31 freq nebbin - 2 freq nippin' - 3 freq nippen - 1 freq nappin - 1 freq novena - 1 freq neibin - 3 freq neebin - 2 freq navyne - 3 freq nippan - 1 freq nuppin - 1 freq nibon - 1 freq nyow-funn - 1 freq nabbin - 2 freq niven - 3 freq n'ben - 1 freq newheiven - 1 freq nfum - 2 freq nvm - 1 freq nevin - 1 freq naefun - 1 freq npn - 1 freq nvmm - 1 freq |
MetaPhone code - NHFN newheiven - 1 freq |
NEWHEIVEN |
| Time to execute Levenshtein function - 0.223104 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.649089 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.027647 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.086046 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.001540 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. |