| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| retributioun (0) - 1 freq retribution (1) - 9 freq retribution's (3) - 1 freq attribution (3) - 1 freq contributioun (3) - 2 freq distribution (4) - 5 freq relocautioun (4) - 1 freq refutautioun (4) - 2 freq contributiouns (4) - 1 freq contreibutioun (4) - 1 freq redistribution (4) - 3 freq contribution (4) - 38 freq destitution (5) - 2 freq contibution (5) - 1 freq resolution (5) - 19 freq derivation (5) - 2 freq replication (5) - 2 freq eddicautioun (5) - 3 freq recitation (5) - 2 freq restrictions (5) - 19 freq contributin (5) - 3 freq deprivation (5) - 11 freq reactioun (5) - 1 freq exhibition (5) - 25 freq religioun (5) - 5 freq |
retributioun (0) - 1 freq retribution (1) - 9 freq attribution (4) - 1 freq contributioun (5) - 2 freq retribution's (5) - 1 freq contribution (6) - 38 freq retreatin (6) - 1 freq retractin (6) - 1 freq redistribution (6) - 3 freq contreibutioun (6) - 1 freq distribution (6) - 5 freq attributive (7) - 2 freq contributin (7) - 3 freq distreibution (7) - 1 freq recreation (7) - 5 freq reformatioun (7) - 3 freq restrictin (7) - 2 freq nutrition (7) - 4 freq retrievin (7) - 1 freq restaurautioun (7) - 2 freq attributit (7) - 7 freq perturbation (7) - 1 freq contributiouns (7) - 1 freq refutautioun (7) - 2 freq relocautioun (7) - 1 freq |
SoundEx code - R361 retribution - 9 freq retrieve - 7 freq rutherford - 4 freq redrafted - 1 freq retrieves - 1 freq retribution's - 1 freq retributioun - 1 freq redrob - 1 freq retro-font - 1 freq retrieved - 3 freq reid-robed - 1 freq retrievin - 1 freq roadtrip - 1 freq retriever - 2 freq raithrovers - 2 freq retrofootballnw - 1 freq |
MetaPhone code - RTRBXN retribution - 9 freq retributioun - 1 freq |
RETRIBUTIOUN |
| Time to execute Levenshtein function - 0.244595 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.400088 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.036884 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.038529 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.001038 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. |