| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| non-creative (0) - 2 freq non-native (3) - 2 freq conservative (4) - 36 freq creative (4) - 102 freq normative (4) - 1 freq 'creative (4) - 4 freq eaccreative (4) - 2 freq recreative (4) - 1 freq konservative (4) - 1 freq re-creatin (5) - 1 freq vocative (5) - 1 freq concrete (5) - 60 freq low-prestige (5) - 2 freq conservatives (5) - 16 freq nairrative (5) - 3 freq consultative (5) - 3 freq comparative (5) - 2 freq co-operative (5) - 3 freq hortative (5) - 1 freq informative (5) - 1 freq formative (5) - 2 freq narrative (5) - 41 freq contrastive (5) - 4 freq incentive (5) - 6 freq lucrative (5) - 2 freq |
non-creative (0) - 2 freq non-native (5) - 2 freq recreative (7) - 1 freq 'creative (7) - 4 freq eaccreative (7) - 2 freq creative (7) - 102 freq incentive (8) - 6 freq narrative (8) - 41 freq lucrative (8) - 2 freq co-operative (8) - 3 freq non-nation (8) - 1 freq nairrative (8) - 3 freq nairative (8) - 3 freq 'narrative (8) - 1 freq secretive (8) - 1 freq concrete (8) - 60 freq konservative (8) - 1 freq re-creatin (8) - 1 freq conservative (8) - 36 freq normative (8) - 1 freq non-pairty (9) - 1 freq non-herdin (9) - 1 freq concertina (9) - 3 freq oncertane (9) - 1 freq concertit (9) - 1 freq |
SoundEx code - N526 non-grafter - 1 freq non-creative - 2 freq newins-rife - 2 freq non-accredited - 1 freq ninjarabbi - 1 freq |
MetaPhone code - NNKRTF non-creative - 2 freq |
NON-CREATIVE |
| Time to execute Levenshtein function - 0.199642 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.414173 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.028344 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.038753 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.000945 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. |