| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| roadsigns (0) - 2 freq roadsign (1) - 1 freq road-signs (1) - 1 freq roadsides (2) - 3 freq roadins (2) - 3 freq starsigns (3) - 1 freq roadies (3) - 4 freq reasins (3) - 1 freq consigns (3) - 1 freq roadside (3) - 14 freq readins (3) - 15 freq roadin's (3) - 7 freq resigns (3) - 1 freq raisins (3) - 10 freq roadin (3) - 87 freq reigns (4) - 6 freq roddin (4) - 8 freq reddins (4) - 1 freq reasin (4) - 2 freq croatians (4) - 2 freq reading (4) - 92 freq asians (4) - 4 freq passions (4) - 3 freq lordlins (4) - 1 freq lodgins (4) - 1 freq |
roadsigns (0) - 2 freq road-signs (2) - 1 freq roadsign (2) - 1 freq resigns (4) - 1 freq roadins (4) - 3 freq roadsides (4) - 3 freq raisins (5) - 10 freq readins (5) - 15 freq designs (5) - 9 freq redskins (5) - 2 freq consigns (5) - 1 freq reasins (5) - 1 freq reasons (6) - 80 freq russians (6) - 9 freq risins (6) - 2 freq roddens (6) - 4 freq roussianes (6) - 1 freq roadside (6) - 14 freq raiseens (6) - 1 freq raisons (6) - 20 freq rosines (6) - 1 freq starsigns (6) - 1 freq lodgins (6) - 1 freq resign (6) - 2 freq readings (6) - 4 freq |
SoundEx code - R322 ridges - 6 freq reid-checkit - 1 freq reid-cheeked - 3 freq ratches - 1 freq riddoch's - 1 freq radgest - 2 freq redesigned - 1 freq ridgeways - 1 freq retches - 1 freq roadsign - 1 freq roadsigns - 2 freq road-signs - 1 freq radges - 1 freq ritzys - 1 freq radge-check - 1 freq reduces - 1 freq rtxgqycobj - 1 freq radishes - 1 freq |
MetaPhone code - RTSKNS roadsigns - 2 freq road-signs - 1 freq redskins - 2 freq |
ROADSIGNS |
| Time to execute Levenshtein function - 0.220480 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.432627 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.027879 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.039655 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.000868 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. |