| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| refinery (0) - 1 freq finery (2) - 5 freq refined (2) - 7 freq refinet (2) - 1 freq refine (2) - 4 freq fiery (3) - 27 freq reminder (3) - 19 freq jinery (3) - 1 freq define (3) - 11 freq remine (3) - 2 freq refer (3) - 37 freq efiter (3) - 1 freq reivers (3) - 17 freq reined (3) - 2 freq reine' (3) - 1 freq refters (3) - 1 freq defined (3) - 21 freq finer (3) - 14 freq reine (3) - 2 freq reciters (3) - 1 freq greenery (3) - 7 freq finely (3) - 3 freq defines (3) - 7 freq delivery (3) - 49 freq joinery (3) - 5 freq |
refinery (0) - 1 freq finery (3) - 5 freq refine (3) - 4 freq refinet (3) - 1 freq refined (3) - 7 freq refer (4) - 37 freq refinin (4) - 2 freq hefner (4) - 1 freq finer (4) - 14 freq seminary (5) - 1 freq reiver (5) - 22 freq refers (5) - 27 freq dufner (5) - 1 freq recovery (5) - 13 freq meiner (5) - 2 freq refund (5) - 2 freq efier (5) - 1 freq reinen (5) - 1 freq grainery (5) - 1 freq earner (5) - 2 freq retenar (5) - 1 freq rouner (5) - 2 freq reniour (5) - 2 freq rafter (5) - 1 freq rinner (5) - 13 freq |
SoundEx code - R156 rabin-rin-tha-hedge - 1 freq rabin-rin-the-hedge - 1 freq refinery - 1 freq rowwfvimru - 1 freq robmarshall - 6 freq robohanrahan - 1 freq |
MetaPhone code - RFNR refinery - 1 freq |
REFINERY |
| Time to execute Levenshtein function - 0.194548 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.360123 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.029420 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.036835 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.000824 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. |