Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
quiver (0) - 6 freq quivers (1) - 1 freq quaver (1) - 2 freq quiver' (1) - 1 freq cuiver (1) - 4 freq taiver (2) - 2 freq suiner (2) - 27 freq cliver (2) - 12 freq cuivers (2) - 2 freq quaiter (2) - 4 freq faiver (2) - 3 freq cuvver (2) - 1 freq muive (2) - 26 freq haiver (2) - 6 freq queer (2) - 146 freq muived (2) - 22 freq quieter (2) - 11 freq shiver (2) - 35 freq furiver (2) - 1 freq quicker (2) - 57 freq cuuver (2) - 1 freq quines (2) - 156 freq sliver (2) - 8 freq wulver (2) - 1 freq quine (2) - 588 freq |
quiver (0) - 6 freq quaver (1) - 2 freq quiver' (2) - 1 freq cuiver (2) - 4 freq quivers (2) - 1 freq siver (3) - 2 freq fiver (3) - 46 freq daiver (3) - 4 freq quativer (3) - 4 freq liver (3) - 34 freq luver (3) - 8 freq caiver (3) - 1 freq houiver (3) - 17 freq wiver (3) - 1 freq a-quiver (3) - 1 freq quavers (3) - 2 freq oliver (3) - 10 freq iver (3) - 312 freq reiver (3) - 22 freq queirer (3) - 1 freq uvver (3) - 10 freq kiver (3) - 5 freq quivered (3) - 3 freq neiver (3) - 1 freq quiverin (3) - 7 freq |
SoundEx code - Q160 quiver - 6 freq quaver - 2 freq quiver' - 1 freq qubare - 1 freq qxypr - 1 freq qgphr - 1 freq |
MetaPhone code - KFR cover - 147 freq quiver - 6 freq quaver - 2 freq gaffer - 35 freq kiver - 5 freq cuuver - 1 freq quiver' - 1 freq caviar - 11 freq cuiver - 4 freq 'cover - 1 freq kivver - 6 freq gfur - 1 freq caviaar - 1 freq gowfer - 1 freq caviare - 1 freq kivvver - 1 freq kaffir - 2 freq caiver - 1 freq cfar - 1 freq cuvver - 1 freq |
QUIVER |
Time to execute Levenshtein function - 0.256860 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.575093 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.037274 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.044338 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.001118 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. |