| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| equalise (0) - 4 freq equaliser (1) - 4 freq equalitie (2) - 4 freq equallie (2) - 1 freq equals (2) - 10 freq equality (2) - 34 freq reealise (3) - 1 freq squalid (3) - 1 freq eneaise (3) - 1 freq equipoise (3) - 2 freq squalls (3) - 1 freq equates (3) - 1 freq realise (3) - 107 freq eulalie (3) - 1 freq elise (3) - 1 freq qualifee (3) - 2 freq serialise (3) - 1 freq equal (3) - 71 freq eequalee (3) - 1 freq finalise (3) - 2 freq equation (3) - 5 freq qualify (3) - 4 freq encaise (3) - 1 freq equality' (3) - 1 freq equally (3) - 35 freq |
equalise (0) - 4 freq equals (2) - 10 freq equaliser (2) - 4 freq quilse (3) - 1 freq equalitie (3) - 4 freq equality (3) - 34 freq equallie (3) - 1 freq qualify (4) - 4 freq eequalee (4) - 1 freq equal (4) - 71 freq qualms (4) - 3 freq qualifee (4) - 2 freq qualitie (4) - 12 freq equally (4) - 35 freq quality (4) - 134 freq elise (4) - 1 freq equipoise (4) - 2 freq realise (4) - 107 freq equates (4) - 1 freq reealise (4) - 1 freq tequilas (5) - 1 freq qualities (5) - 9 freq quares (5) - 1 freq alse (5) - 8 freq malaise (5) - 1 freq |
SoundEx code - E242 exclusive - 10 freq exclusivelie - 1 freq equals - 10 freq equaliser - 4 freq eagles - 11 freq eaglesfield - 1 freq exiles - 4 freq eaglesham - 4 freq ecclesiastes - 2 freq ecclesiastics - 1 freq exclusively - 3 freq eggshells - 3 freq eclectic - 1 freq eagle's - 4 freq ecological - 6 freq eaglais - 1 freq eeseless - 6 freq ecclesiastic - 1 freq escalace - 1 freq easles - 2 freq exclusion - 3 freq ecology - 3 freq eagles' - 1 freq equal-aqual - 3 freq equals-aquals - 1 freq ex-lecturer - 1 freq easylyke - 1 freq equalise - 4 freq eyeglesses - 1 freq eccles - 1 freq ex-colleagues - 1 freq |
MetaPhone code - EKLS equals - 10 freq eagles - 11 freq eagle's - 4 freq eaglais - 1 freq eagles' - 1 freq equalise - 4 freq |
EQUALISE |
| Time to execute Levenshtein function - 0.185503 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.349165 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.027535 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.039384 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.001103 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. |