| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| necessear (0) - 1 freq necessar (1) - 89 freq necessary (2) - 26 freq 'necessar (2) - 1 freq necessair (2) - 2 freq unnecessar (3) - 5 freq neccesar (3) - 1 freq necessitat (3) - 2 freq necessarly (3) - 1 freq necessity (3) - 7 freq recesses (3) - 4 freq deester (4) - 2 freq veesonar (4) - 1 freq teressa (4) - 1 freq needsna (4) - 2 freq leicester (4) - 2 freq secession (4) - 1 freq dresser (4) - 23 freq recessive (4) - 1 freq excesses (4) - 2 freq receever (4) - 1 freq newess (4) - 1 freq accessed (4) - 2 freq neesteran (4) - 1 freq deceiver (4) - 2 freq |
necessear (0) - 1 freq necessar (1) - 89 freq necessair (2) - 2 freq necessary (2) - 26 freq 'necessar (3) - 1 freq necessity (4) - 7 freq necessarly (4) - 1 freq neccesar (4) - 1 freq unnecessar (4) - 5 freq necessarily (5) - 15 freq nasser (5) - 1 freq unnecessary (5) - 1 freq necessitie (5) - 1 freq naeyisser (5) - 1 freq recesses (5) - 4 freq necessitat (5) - 2 freq accessory (6) - 2 freq nucear (6) - 1 freq necessitate (6) - 1 freq cesar (6) - 2 freq ecosse (6) - 6 freq elosser (6) - 1 freq ancestor (6) - 16 freq yesser (6) - 1 freq nuclear (6) - 32 freq |
SoundEx code - N226 necessary - 26 freq necessar - 89 freq necessair - 2 freq necessarly - 1 freq necessarilie - 1 freq necessarily - 15 freq neccesar - 1 freq necessear - 1 freq necessairily - 2 freq 'necessar - 1 freq nezijuiyir - 1 freq |
MetaPhone code - NSSR necessary - 26 freq necessar - 89 freq necessair - 2 freq necessear - 1 freq 'necessar - 1 freq |
NECESSEAR |
| Time to execute Levenshtein function - 0.209616 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.361907 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.027598 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.037078 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.000920 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. |