| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| reliquary (0) - 2 freq reliques (3) - 1 freq liquidy (4) - 1 freq enquiry (4) - 7 freq reinhard (4) - 4 freq libary (4) - 1 freq cliquey (4) - 1 freq secintary (4) - 1 freq estuary (4) - 3 freq preliminary (4) - 1 freq ruary (4) - 1 freq regiar (4) - 1 freq february (4) - 42 freq relivant (4) - 1 freq residual (4) - 1 freq emissary (4) - 2 freq leibrary (4) - 1 freq breviary (4) - 1 freq delivery (4) - 49 freq reliably (4) - 1 freq military (4) - 43 freq feberuary (4) - 1 freq library (4) - 175 freq regilar (4) - 1 freq refinery (4) - 1 freq |
reliquary (0) - 2 freq reliques (4) - 1 freq require (5) - 10 freq liquor (5) - 7 freq reliably (6) - 1 freq refinery (6) - 1 freq regilar (6) - 1 freq military (6) - 43 freq salivary (6) - 1 freq reliant (6) - 3 freq reniour (6) - 2 freq reidware (6) - 1 freq requirt (6) - 1 freq delivery (6) - 49 freq relay (6) - 4 freq solitary (6) - 15 freq liquidy (6) - 1 freq liqueur (6) - 2 freq ruary (6) - 1 freq enquiry (6) - 7 freq libary (6) - 1 freq cliquey (6) - 1 freq regiar (6) - 1 freq velar (7) - 7 freq reality (7) - 115 freq |
SoundEx code - R426 reliquary - 2 freq rolls-royce - 1 freq railcard - 1 freq realchrispowell - 6 freq realscarletpimp - 1 freq rlscrbb - 1 freq realgreatbrit - 1 freq |
MetaPhone code - RLKR reliquary - 2 freq |
RELIQUARY |
| Time to execute Levenshtein function - 0.257571 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.401422 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.031099 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.041337 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.001009 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. |