| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| neep-perk (0) - 2 freq neep-park (1) - 3 freq neep-heid (3) - 2 freq neeper (3) - 5 freq neepers (3) - 5 freq neep-muck (3) - 1 freq lea-perk (3) - 2 freq keepers (4) - 16 freq peepers (4) - 6 freq peppert (4) - 1 freq nappers (4) - 6 freq grey-derk (4) - 1 freq neipers (4) - 2 freq tee-sark (4) - 1 freq nippers (4) - 2 freq neeperin (4) - 1 freq neeber (4) - 2 freq keppers (4) - 1 freq deeper (4) - 51 freq chepper (4) - 1 freq ee-ers (4) - 1 freq deep-sea (4) - 4 freq ker-park (4) - 1 freq nedspeak (4) - 5 freq nae-pea (4) - 1 freq |
neep-perk (0) - 2 freq neep-park (1) - 3 freq lea-perk (5) - 2 freq neep-muck (5) - 1 freq nippers (6) - 2 freq ker-park (6) - 1 freq nipper (6) - 1 freq nappers (6) - 6 freq napper (6) - 36 freq neepers (6) - 5 freq neep-heid (6) - 2 freq neeper (6) - 5 freq pepper (7) - 83 freq non-work (7) - 1 freq lee-wark (7) - 1 freq neiper (7) - 6 freq neep-shed (7) - 1 freq reepepr (7) - 1 freq neepur (7) - 1 freq peppers (7) - 7 freq peppert (7) - 1 freq nippier (7) - 1 freq nae-pea (7) - 1 freq ken-merk (7) - 1 freq keppers (7) - 1 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 - NPPRK neep-perk - 2 freq neep-park - 3 freq |
NEEP-PERK |
| Time to execute Levenshtein function - 0.226639 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.398945 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.027159 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.037120 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.000931 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. |