Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
neepers (0) - 5 freq keepers (1) - 16 freq neipers (1) - 2 freq peepers (1) - 6 freq neeper (1) - 5 freq sleepers (2) - 4 freq helpers (2) - 12 freq peypers (2) - 5 freq deeners (2) - 1 freq creepers (2) - 1 freq peelers (2) - 7 freq ee-ers (2) - 1 freq tempers (2) - 2 freq neeber (2) - 2 freq leipers (2) - 2 freq heefers (2) - 1 freq neebors (2) - 79 freq reapers (2) - 2 freq meelers (2) - 1 freq feeders (2) - 1 freq paepers (2) - 2 freq keppers (2) - 1 freq deeper (2) - 51 freq peevers (2) - 1 freq nappers (2) - 6 freq |
neepers (0) - 5 freq neipers (1) - 2 freq neeper (2) - 5 freq peepers (2) - 6 freq keepers (2) - 16 freq neeperin (3) - 1 freq neeps (3) - 148 freq neiper (3) - 6 freq paepers (3) - 2 freq lepers (3) - 4 freq nappers (3) - 6 freq neebirs (3) - 9 freq nippers (3) - 2 freq neepur (3) - 1 freq reapers (3) - 2 freq neep's (3) - 3 freq neeburs (3) - 7 freq neipours (3) - 8 freq peypers (3) - 5 freq neebors (3) - 79 freq leipers (3) - 2 freq paupers (4) - 3 freq pipers (4) - 10 freq japers (4) - 15 freq wipers (4) - 4 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 - NPRS nappers - 6 freq neepers - 5 freq nippers - 2 freq neipours - 8 freq napier's - 1 freq neipers - 2 freq |
NEEPERS |
Time to execute Levenshtein function - 0.252433 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.447568 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.031532 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.051327 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.001374 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. |