Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
explore (0) - 28 freq explode (1) - 28 freq explores (1) - 1 freq explored (1) - 4 freq explorer (1) - 1 freq explod (2) - 1 freq deplore (2) - 1 freq explodes (2) - 4 freq export (2) - 10 freq explorers (2) - 2 freq explene (2) - 4 freq expire (2) - 2 freq expone (2) - 2 freq expload (2) - 1 freq explorin (2) - 19 freq exploded (2) - 7 freq implore (2) - 1 freq exploit (2) - 2 freq expose (2) - 7 freq splore (2) - 25 freq explain (3) - 166 freq exploits (3) - 13 freq epple (3) - 13 freq explodit (3) - 8 freq eeyore (3) - 1 freq |
explore (0) - 28 freq explored (2) - 4 freq explorer (2) - 1 freq explores (2) - 1 freq explode (2) - 28 freq exploit (3) - 2 freq expire (3) - 2 freq expload (3) - 1 freq explene (3) - 4 freq explorin (3) - 19 freq splore (3) - 25 freq explod (3) - 1 freq deplore (3) - 1 freq implore (3) - 1 freq explaen (4) - 2 freq employer (4) - 10 freq expleit (4) - 1 freq exposure (4) - 17 freq xklor (4) - 1 freq expleen (4) - 4 freq expose (4) - 7 freq explorers (4) - 2 freq export (4) - 10 freq explodes (4) - 4 freq exploded (4) - 7 freq |
SoundEx code - E214 explained - 97 freq equivalents - 6 freq explain - 166 freq explanation - 37 freq explanations - 12 freq explainin - 22 freq explains - 26 freq expletives - 7 freq explode - 28 freq explodes - 4 freq expulsion - 3 freq expelled - 4 freq explosions - 4 freq expleen - 4 freq exploitation - 9 freq 'exploration - 1 freq exploits - 13 freq equivalent - 25 freq explorin - 19 freq explaint - 14 freq explodin' - 1 freq explosive's - 1 freq expload - 1 freq explosion - 22 freq explainen - 1 freq explayned - 1 freq expel - 1 freq explodit - 8 freq exfoliation - 1 freq exfoli-fit - 1 freq exploded - 7 freq explore - 28 freq explorations - 3 freq explicitly - 7 freq exploration - 9 freq expelt - 3 freq explodin - 6 freq explored - 4 freq explores - 1 freq explenn - 11 freq explenned - 3 freq explicit - 7 freq explanator - 11 freq explorator - 1 freq explosive - 3 freq explodan - 1 freq explenes - 1 freq explened - 14 freq explaen - 2 freq explaened - 1 freq explaens - 1 freq exploring - 5 freq equivelant - 2 freq exploited - 1 freq equivelent - 1 freq explorin' - 1 freq exploads - 1 freq easy-fleggit - 1 freq exploitit - 2 freq expleitit - 1 freq expleit - 1 freq explore-highland-perthshire - 1 freq explainable - 1 freq expleits - 1 freq equeevalent - 3 freq explod - 1 freq esplanade - 9 freq explanatory - 2 freq explosives - 4 freq explorers - 2 freq explene - 4 freq esplanad - 1 freq explication - 1 freq exoplanet - 1 freq expleecitly - 1 freq explaineen - 1 freq exploit - 2 freq expellin - 1 freq exploitative - 1 freq explorable - 1 freq expleinin - 1 freq explaned - 1 freq expleened - 1 freq expletive - 1 freq eksplaen - 1 freq eksplisitlee - 1 freq eksplorirs - 1 freq equivilint - 1 freq explainin' - 1 freq explaining - 2 freq exploiting - 1 freq explainit - 1 freq explicable - 1 freq explorer - 1 freq explicity - 1 freq eqbl - 1 freq eosfl - 1 freq |
MetaPhone code - EKSPLR explore - 28 freq |
EXPLORE |
Time to execute Levenshtein function - 0.216290 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.337949 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.027730 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.037096 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.000860 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. |