| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| exertin (0) - 1 freq exertit (1) - 2 freq exertion (1) - 3 freq gertin (2) - 1 freq desertin (2) - 2 freq excitin (2) - 33 freq certin (2) - 1 freq avertin (2) - 1 freq exportin (2) - 6 freq eerin (2) - 2 freq excerptin (2) - 1 freq revertin (2) - 2 freq exeistin (2) - 1 freq erectin (2) - 1 freq exerptit (2) - 1 freq exert (2) - 1 freq emergin (2) - 6 freq everhin (2) - 1 freq everton (2) - 3 freq dertin (2) - 1 freq everthin (2) - 2 freq mertin (2) - 2 freq eetin (2) - 3 freq exactin (2) - 2 freq exertions (2) - 2 freq |
exertin (0) - 1 freq exertion (1) - 3 freq exertit (2) - 2 freq mertin (3) - 2 freq dertin (3) - 1 freq exactin (3) - 2 freq everton (3) - 3 freq fertin (3) - 1 freq exerted (3) - 1 freq exert (3) - 1 freq existin (3) - 24 freq exertions (3) - 2 freq extortin (3) - 1 freq certin (3) - 1 freq excitin (3) - 33 freq gertin (3) - 1 freq exportin (3) - 6 freq avertin (3) - 1 freq exeistin (3) - 1 freq airtin (4) - 36 freq execration (4) - 1 freq coortin (4) - 18 freq wirtin (4) - 2 freq kertan (4) - 1 freq greitin (4) - 26 freq |
SoundEx code - E263 exertin - 1 freq ecairt-wheels - 1 freq ecairrit - 1 freq escort - 3 freq esartshall - 1 freq exertion - 3 freq ecairt-cuddy - 1 freq ecairted - 1 freq exert - 1 freq ekurt - 1 freq exerted - 1 freq escortit - 2 freq ex-scorrie-ation - 1 freq esquierdo - 1 freq exertit - 2 freq ecairriet - 1 freq eco-riots - 2 freq exertions - 2 freq escorts - 1 freq escorted - 1 freq eaccreative - 2 freq |
MetaPhone code - EKSRTN exertin - 1 freq |
EXERTIN |
| Time to execute Levenshtein function - 0.222876 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.424264 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.032239 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.049732 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.001049 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. |