| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| earlie (0) - 7 freq parlie (1) - 7 freq warlie (1) - 2 freq harlie (1) - 6 freq earlier (1) - 109 freq pearlie (1) - 1 freq carlie (1) - 2 freq eare (2) - 1 freq warie (2) - 1 freq tarrie (2) - 2 freq tailie (2) - 7 freq yeirlie (2) - 1 freq carline (2) - 33 freq garlic (2) - 13 freq dallie (2) - 13 freq darkie (2) - 2 freq cartie (2) - 1 freq pirlie (2) - 1 freq aerlie (2) - 10 freq harlin (2) - 3 freq erle (2) - 4 freq marlit (2) - 1 freq halie (2) - 83 freq earliest (2) - 19 freq lallie (2) - 1 freq |
earlie (0) - 7 freq airlie (2) - 47 freq yeirlie (2) - 1 freq earl (2) - 31 freq raelie (2) - 3 freq aerlie (2) - 10 freq parlie (2) - 7 freq early (2) - 366 freq earlier (2) - 109 freq harlie (2) - 6 freq warlie (2) - 2 freq pearlie (2) - 1 freq carlie (2) - 2 freq erle (2) - 4 freq alie (3) - 1 freq fairlie (3) - 19 freq warle (3) - 1 freq mirlie (3) - 1 freq eordie (3) - 1 freq haulie (3) - 1 freq ailie (3) - 1 freq rlia (3) - 1 freq wearilie (3) - 1 freq ariel (3) - 5 freq pairlie (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 |
EARLIE |
| Time to execute Levenshtein function - 0.261100 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.509474 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.032790 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.075557 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.000964 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. |