Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
equals (0) - 10 freq equal (1) - 71 freq aqual (2) - 3 freq squads (2) - 1 freq squalls (2) - 1 freq aquas (2) - 2 freq qualms (2) - 3 freq qualm (2) - 2 freq equalise (2) - 4 freq squeals (2) - 12 freq squars (2) - 1 freq equates (2) - 1 freq 'equal (2) - 1 freq equate (2) - 5 freq qual (2) - 2 freq quats (2) - 1 freq squall (2) - 1 freq equally (2) - 35 freq sequels (2) - 2 freq quips (3) - 2 freq finals (3) - 7 freq murals (3) - 8 freq quilse (3) - 1 freq sequel (3) - 8 freq equity (3) - 7 freq |
equals (0) - 10 freq equalise (2) - 4 freq equal (2) - 71 freq equates (3) - 1 freq qual (3) - 2 freq equally (3) - 35 freq quilse (3) - 1 freq squeals (3) - 12 freq quats (3) - 1 freq sequels (3) - 2 freq aqual (3) - 3 freq aquas (3) - 2 freq qualms (3) - 3 freq qualm (3) - 2 freq quill (4) - 15 freq quail's (4) - 2 freq quins (4) - 1 freq eedols (4) - 1 freq coals (4) - 18 freq quilts (4) - 2 freq equality (4) - 34 freq puils (4) - 9 freq quilt (4) - 23 freq eidols (4) - 1 freq quasi (4) - 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 |
EQUALS |
Time to execute Levenshtein function - 0.185799 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.313788 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.027318 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.036842 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.000817 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. |