| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| exorbitant (0) - 1 freq orbitan (3) - 2 freq extant (4) - 9 freq exorcist (4) - 1 freq orbital (4) - 3 freq exuberant (4) - 1 freq corbitt (4) - 1 freq exhibitit (4) - 2 freq exhibiting (4) - 3 freq exultant (4) - 1 freq orbitin (4) - 1 freq expectant (4) - 1 freq extract (5) - 14 freq exowstin (5) - 2 freq cormorant (5) - 1 freq exercising (5) - 3 freq protestant (5) - 28 freq excitin' (5) - 2 freq serbian (5) - 1 freq exerptit (5) - 1 freq exheebitin (5) - 1 freq exoplanet (5) - 1 freq exorcise (5) - 1 freq €œhabitat (5) - 1 freq inhabitants (5) - 8 freq |
exorbitant (0) - 1 freq orbitan (5) - 2 freq orbitin (6) - 1 freq exhibiting (6) - 3 freq expectant (6) - 1 freq exhibitit (6) - 2 freq exultant (6) - 1 freq extant (6) - 9 freq exuberant (6) - 1 freq corbitt (6) - 1 freq exertion (7) - 3 freq exhibitions (7) - 8 freq exheebitit (7) - 2 freq exertions (7) - 2 freq exibitien (7) - 3 freq extent (7) - 48 freq corbett (7) - 7 freq exertin (7) - 1 freq exertit (7) - 2 freq exhibition (7) - 25 freq extint (7) - 1 freq exorcist (7) - 1 freq exerptit (7) - 1 freq orbital (7) - 3 freq exheebitin (7) - 1 freq |
SoundEx code - E261 ecarfuffle - 1 freq excerpt - 5 freq exerptit - 1 freq escarpment - 2 freq escribir - 2 freq e-screive - 13 freq e-scrieve - 1 freq excerptin - 1 freq exorbitant - 1 freq eacrobertburns - 1 freq |
MetaPhone code - EKSRBTNT exorbitant - 1 freq |
EXORBITANT |
| Time to execute Levenshtein function - 0.209582 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.489112 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.032547 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.048492 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.000937 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. |