| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| literal (0) - 7 freq liberal (1) - 26 freq lateral (1) - 3 freq literar (1) - 3 freq literacy (2) - 34 freq neteral (2) - 1 freq liter (2) - 1 freq gineral (2) - 3 freq leeteral (2) - 2 freq literati (2) - 3 freq mineral (2) - 8 freq naiteral (2) - 6 freq liberals (2) - 5 freq literary (2) - 63 freq literally (2) - 42 freq literate (2) - 9 freq laters (3) - 12 freq litter (3) - 16 freq biter (3) - 1 freq fiter (3) - 1 freq leiteracy (3) - 3 freq liper (3) - 1 freq littered (3) - 9 freq lintel (3) - 6 freq leiterate (3) - 1 freq |
literal (0) - 7 freq lateral (1) - 3 freq leeteral (2) - 2 freq literar (2) - 3 freq liberal (2) - 26 freq literally (3) - 42 freq literary (3) - 63 freq litrle (3) - 1 freq naiteral (3) - 6 freq leetral (3) - 1 freq literate (3) - 9 freq literati (3) - 3 freq neteral (3) - 1 freq literacy (3) - 34 freq liter (3) - 1 freq loiter (4) - 1 freq leeterar (4) - 14 freq loiterin (4) - 3 freq naiterel (4) - 1 freq loiterer (4) - 1 freq natural (4) - 90 freq laiter (4) - 4 freq material (4) - 86 freq litre (4) - 11 freq littil (4) - 8 freq |
SoundEx code - L364 literal - 7 freq literally - 42 freq litrle - 1 freq leeteral - 2 freq lateral - 3 freq leeterally - 2 freq leiterallie - 2 freq litherlie - 1 freq leetral - 1 freq latterly - 4 freq latterlie - 2 freq leaderless - 1 freq |
MetaPhone code - LTRL literal - 7 freq literally - 42 freq litrle - 1 freq leeteral - 2 freq lateral - 3 freq leeterally - 2 freq leiterallie - 2 freq leetral - 1 freq latterly - 4 freq latterlie - 2 freq |
LITERAL |
| Time to execute Levenshtein function - 0.200026 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.334348 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.027671 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.038658 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.000884 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. |