| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| quivered (0) - 2 freq quavered (1) - 2 freq kivered (2) - 1 freq quieted (2) - 1 freq shivered (2) - 6 freq ivered (2) - 4 freq quiver (2) - 6 freq quiver' (2) - 1 freq quivers (2) - 1 freq haivered (2) - 2 freq quiverin (2) - 6 freq buggered (3) - 13 freq silvered (3) - 1 freq rivened (3) - 1 freq slavered (3) - 3 freq kivvered (3) - 2 freq murdered (3) - 12 freq uttered (3) - 10 freq buttered (3) - 19 freq quited (3) - 1 freq revered (3) - 3 freq hoovered (3) - 4 freq surveyed (3) - 5 freq hubbered (3) - 1 freq dovered (3) - 6 freq |
quivered (0) - 2 freq quavered (1) - 2 freq quiver' (3) - 1 freq quivers (3) - 1 freq quiverin (3) - 6 freq quiver (3) - 6 freq haivered (3) - 2 freq ivered (3) - 4 freq kivered (3) - 1 freq davered (4) - 1 freq queried (4) - 4 freq queeried (4) - 3 freq hoovered (4) - 4 freq havered (4) - 7 freq severed (4) - 6 freq fevered (4) - 1 freq quavers (4) - 2 freq hovered (4) - 11 freq revered (4) - 3 freq dovered (4) - 6 freq shivered (4) - 6 freq levered (4) - 3 freq quieted (4) - 1 freq covered (4) - 119 freq quaver (4) - 2 freq |
SoundEx code - Q163 quivered - 2 freq quavered - 2 freq qwfrt - 2 freq |
MetaPhone code - KFRT covert - 38 freq covered - 119 freq cuivert - 2 freq cover't - 3 freq kivert - 4 freq quivered - 2 freq kivvered - 2 freq cuver'd - 2 freq cuvert - 1 freq coverit - 6 freq kivered - 1 freq coiffured - 1 freq quavered - 2 freq kivvert - 5 freq coveret - 2 freq gaffered - 1 freq €˜covert - 3 freq “covered - 1 freq qwfrt - 2 freq |
QUIVERED |
| Time to execute Levenshtein function - 0.203299 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.359814 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.027714 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.037703 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.000832 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. |