| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| quivers (0) - 1 freq quavers (1) - 2 freq quiver (1) - 6 freq cuivers (1) - 2 freq quiver' (1) - 1 freq quires (2) - 1 freq haivers (2) - 31 freq divers (2) - 10 freq huives (2) - 1 freq veivers (2) - 1 freq chivers (2) - 1 freq luvers (2) - 12 freq quaters (2) - 1 freq cuiver (2) - 4 freq reivers (2) - 17 freq quiverin (2) - 6 freq rivers (2) - 30 freq quine's (2) - 18 freq livers (2) - 1 freq ruifers (2) - 1 freq quines (2) - 155 freq vivers (2) - 1 freq luvvers (2) - 1 freq quaver (2) - 2 freq givers (2) - 2 freq |
quivers (0) - 1 freq quavers (1) - 2 freq cuivers (2) - 2 freq quiver' (2) - 1 freq quiver (2) - 6 freq quaver (3) - 2 freq livers (3) - 1 freq rivers (3) - 30 freq givers (3) - 2 freq kivers (3) - 3 freq quiverin (3) - 6 freq fivers (3) - 3 freq taivers (3) - 3 freq quivered (3) - 2 freq vivers (3) - 1 freq veivers (3) - 1 freq reivers (3) - 17 freq divers (3) - 10 freq luvers (3) - 12 freq haivers (3) - 31 freq quires (3) - 1 freq quaters (3) - 1 freq quairs (4) - 3 freq rovers (4) - 23 freq rievers (4) - 1 freq |
SoundEx code - Q162 quavers - 2 freq quivers - 1 freq qporc - 1 freq |
MetaPhone code - KFRS covers - 50 freq kivers - 3 freq gaffer's - 2 freq kivvers - 5 freq cavers - 6 freq quavers - 2 freq gaffers - 2 freq quivers - 1 freq coffars - 1 freq cuivers - 2 freq coffers - 2 freq gowfers - 1 freq |
QUIVERS |
| Time to execute Levenshtein function - 0.210349 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.391370 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.027267 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.037593 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.000861 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. |