| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| earl (1) - 31 freq faras (2) - 1 freq earn (2) - 41 freq fara (2) - 1 freq sarah (2) - 40 freq genral (2) - 4 freq haaal (2) - 1 freq ental (2) - 1 freq cara (2) - 3 freq oral (2) - 23 freq wearan (2) - 9 freq karam (2) - 1 freq haal (2) - 42 freq ear's (2) - 1 freq ara (2) - 1 freq zarah (2) - 1 freq eraly (2) - 1 freq eal (2) - 1 freq canal (2) - 27 freq ecrml (2) - 2 freq bar-l (2) - 1 freq yarl (2) - 18 freq sara (2) - 16 freq orral (2) - 6 freq eard (2) - 1 freq |
earl (1) - 31 freq yarl (2) - 18 freq oral (2) - 23 freq early (2) - 366 freq eraly (2) - 1 freq aural (2) - 1 freq eeran (3) - 2 freq enrol (3) - 1 freq ariel (3) - 5 freq agal (3) - 1 freq karl (3) - 6 freq mural (3) - 1 freq darl (3) - 1 freq feral (3) - 6 freq yearly (3) - 10 freq pearl (3) - 8 freq viral (3) - 3 freq baal (3) - 14 freq moral (3) - 88 freq farl (3) - 5 freq yerl (3) - 1 freq varl (3) - 1 freq warl (3) - 164 freq erra (3) - 3 freq anal (3) - 1 freq |
SoundEx code - E640 early - 366 freq earl - 31 freq eerily - 1 freq earlie - 7 freq errol - 2 freq erll - 1 freq eraly - 1 freq erroll - 1 freq erly - 3 freq erle - 4 freq |
MetaPhone code - ERL early - 366 freq aerlie - 10 freq earl - 31 freq eerily - 1 freq earlie - 7 freq aerly - 19 freq errol - 2 freq aeriel - 1 freq erll - 1 freq eraly - 1 freq aerial - 5 freq erroll - 1 freq erly - 3 freq erle - 4 freq |
EARAL |
| Time to execute Levenshtein function - 0.264603 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.389765 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.030457 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.040005 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.000896 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. |