| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| document (0) - 63 freq documents (1) - 44 freq documented (2) - 1 freq documentit (2) - 4 freq documentar (2) - 1 freq monument (2) - 16 freq dockens (3) - 5 freq incumbent (3) - 2 freq argument (3) - 80 freq rolment (3) - 1 freq documentary (3) - 14 freq paument (3) - 1 freq daumert (3) - 1 freq torment (3) - 15 freq documark (3) - 3 freq docket (3) - 4 freq moutent (3) - 3 freq maument (3) - 9 freq dozent (3) - 6 freq dourest (3) - 3 freq dacent (3) - 14 freq dechmont (3) - 2 freq documenttak (3) - 1 freq wycement (3) - 1 freq dockiments (3) - 1 freq |
document (0) - 63 freq documents (2) - 44 freq documentit (3) - 4 freq documentar (3) - 1 freq documented (3) - 1 freq documentary (4) - 14 freq dormant (4) - 6 freq wycement (4) - 1 freq dechmont (4) - 2 freq cement (4) - 27 freq monument (4) - 16 freq decent (4) - 112 freq dacent (4) - 14 freq docquet (5) - 2 freq foment (5) - 2 freq movement (5) - 67 freq docken (5) - 30 freq doormen (5) - 2 freq recumbent (5) - 2 freq diacent (5) - 1 freq declint (5) - 1 freq diamant (5) - 2 freq daecent (5) - 8 freq daicent (5) - 60 freq medicament (5) - 1 freq |
SoundEx code - D255 disnaewant - 1 freq dockiments - 1 freq documents - 44 freq dismounted - 1 freq dismountin - 1 freq documentary - 14 freq dismantle - 1 freq document - 63 freq documentit - 4 freq dismemberment - 2 freq dismemberit - 1 freq documentation - 7 freq documenttak - 1 freq desmond - 3 freq disseminate - 2 freq dissemination - 1 freq disseminatioun - 1 freq dismuntit - 1 freq documented - 1 freq disseminated - 1 freq documentaries - 5 freq documentar - 1 freq dechmont - 2 freq dismoontit - 1 freq dismantled - 2 freq discenin - 1 freq dug-wumman - 7 freq dug-men - 4 freq dugmen - 2 freq dog-wumman - 2 freq dug-man - 2 freq dugwumman - 1 freq €˜disseminatit - 1 freq dismount - 1 freq |
MetaPhone code - TKMNT document - 63 freq |
DOCUMENT |
| Time to execute Levenshtein function - 0.192873 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.324337 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.027089 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.036575 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.000811 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. |