| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| necessarily (0) - 15 freq necessarly (1) - 1 freq necessairily (1) - 2 freq necessarilie (2) - 1 freq necessary (2) - 26 freq unnecessarily (2) - 3 freq necessar (3) - 88 freq necessair (3) - 2 freq necessity (3) - 7 freq necessitie (4) - 1 freq incessantly (4) - 5 freq necessities (4) - 2 freq 'necessar (4) - 1 freq necessear (4) - 1 freq unnecessary (4) - 1 freq eheswally (5) - 1 freq necessitats (5) - 1 freq recessive (5) - 1 freq eeswally (5) - 4 freq leesurely (5) - 1 freq eerily (5) - 1 freq emissary (5) - 2 freq necessitat (5) - 2 freq temporarily (5) - 6 freq ecossaise (5) - 1 freq |
necessarily (0) - 15 freq necessairily (1) - 2 freq necessarly (1) - 1 freq necessarilie (2) - 1 freq necessary (3) - 26 freq unnecessarily (3) - 3 freq necessair (4) - 2 freq necessar (4) - 88 freq necessear (5) - 1 freq necessity (5) - 7 freq necessitie (6) - 1 freq incessantly (6) - 5 freq unnecessary (6) - 1 freq necessities (6) - 2 freq 'necessar (6) - 1 freq ancestral (7) - 14 freq necessitate (7) - 1 freq casserole (7) - 3 freq necessitat (7) - 2 freq neccesar (7) - 1 freq ancestrial (7) - 1 freq unnecessar (7) - 5 freq accessory (7) - 2 freq accessories (7) - 1 freq neeborly (8) - 2 freq |
SoundEx code - N226 necessary - 26 freq necessar - 88 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 - NSSRL necessarly - 1 freq necessarilie - 1 freq necessarily - 15 freq necessairily - 2 freq |
NECESSARILY |
| Time to execute Levenshtein function - 0.199895 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.383972 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.027587 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.037283 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.000808 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. |