| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| earls (0) - 12 freq barls (1) - 1 freq farls (1) - 5 freq earns (1) - 3 freq ears (1) - 112 freq ear's (1) - 1 freq early (1) - 366 freq earl (1) - 31 freq pearls (1) - 17 freq jarls (1) - 11 freq warls (1) - 4 freq earl's (1) - 1 freq eares (1) - 1 freq harly (2) - 13 freq farl (2) - 5 freq peals (2) - 2 freq wards (2) - 30 freq mares (2) - 2 freq arcs (2) - 1 freq war's (2) - 3 freq wails (2) - 6 freq fares (2) - 5 freq carla (2) - 5 freq erns (2) - 1 freq girls (2) - 59 freq |
earls (0) - 12 freq arles (2) - 5 freq warls (2) - 4 freq eares (2) - 1 freq erles (2) - 1 freq rls (2) - 7 freq rails (2) - 16 freq jarls (2) - 11 freq earl's (2) - 1 freq pearls (2) - 17 freq farls (2) - 5 freq barls (2) - 1 freq ears (2) - 112 freq earns (2) - 3 freq ear's (2) - 1 freq earl (2) - 31 freq early (2) - 366 freq wals (3) - 1 freq sails (3) - 39 freq arks (3) - 1 freq paerls (3) - 1 freq erle (3) - 4 freq taels (3) - 2 freq euros (3) - 7 freq rouls (3) - 2 freq |
SoundEx code - E642 earls - 12 freq earlshall - 3 freq earlshall's - 1 freq earlshaa - 1 freq earal's - 1 freq earl's - 1 freq earliest - 19 freq eerie-like - 2 freq erliest - 1 freq erles - 1 freq earls-hall - 1 freq earlyish - 1 freq earlstonloon - 2 freq |
MetaPhone code - ERLS earls - 12 freq earal's - 1 freq earl's - 1 freq erles - 1 freq |
EARLS |
| Time to execute Levenshtein function - 0.192757 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.345292 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.027799 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.037502 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.000909 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. |