| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pre-ordained (0) - 1 freq pre-order (4) - 2 freq refrained (4) - 1 freq restrained (4) - 3 freq ordained (4) - 7 freq pre-opened (4) - 1 freq recordings (5) - 3 freq preined (5) - 1 freq pre-rolled (5) - 2 freq proclaimed (5) - 17 freq remained (5) - 17 freq rejoined (5) - 1 freq re-opened (5) - 1 freq proportioned (5) - 1 freq recordin (5) - 21 freq recordan (5) - 1 freq re-haimed (5) - 1 freq prescribed (5) - 3 freq rekordid (5) - 1 freq recorded (5) - 15 freq re-imagined (5) - 1 freq unrestrained (5) - 1 freq weel-trained (5) - 2 freq pre-drinks (5) - 1 freq pre-date (5) - 1 freq |
pre-ordained (0) - 1 freq pre-opened (6) - 1 freq pre-order (6) - 2 freq proportioned (7) - 1 freq pre-rolled (7) - 2 freq ordained (7) - 7 freq refrained (7) - 1 freq pre-orders (7) - 1 freq re-arranged (8) - 1 freq recordins (8) - 11 freq pre-weddin (8) - 1 freq pre-date (8) - 1 freq recordin' (8) - 1 freq pre-indy (8) - 1 freq re-readin (8) - 2 freq pardoned (8) - 4 freq re-imagined (8) - 1 freq prejudiced (8) - 1 freq recording (8) - 8 freq bye-ordinar (8) - 1 freq prioritised (8) - 2 freq recordan (8) - 1 freq pairdoned (8) - 1 freq preined (8) - 1 freq recordin (8) - 21 freq |
SoundEx code - P663 priority - 25 freq pre-ordained - 1 freq priorities - 19 freq prardigm - 1 freq prioritised - 2 freq prioritisin - 1 freq preeöritaisd - 1 freq prioritise - 1 freq pre-order - 2 freq pre-orders - 1 freq pierartscentre - 1 freq |
MetaPhone code - PRRTNT pre-ordained - 1 freq |
PRE-ORDAINED |
| Time to execute Levenshtein function - 0.301889 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.443660 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.030928 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.038617 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.000975 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. |