| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cerbuird (0) - 1 freq owerbuird (2) - 1 freq keybuird (2) - 4 freq cerried (3) - 3 freq buird (3) - 52 freq keyburd (3) - 1 freq on-buird (3) - 1 freq re-build (3) - 1 freq rebuild (3) - 1 freq everbuild (3) - 1 freq seabird (3) - 8 freq abuird (3) - 12 freq cerdboard (3) - 1 freq 'abuird (3) - 1 freq couid (4) - 1 freq 'build (4) - 1 freq cardboard (4) - 31 freq starburd (4) - 1 freq overboard (4) - 2 freq caird (4) - 96 freq cricd (4) - 1 freq carberry (4) - 2 freq neebirs (4) - 9 freq keyboord (4) - 1 freq cultuir (4) - 1 freq |
cerbuird (0) - 1 freq owerbuird (3) - 1 freq cerdboard (4) - 1 freq keybuird (4) - 4 freq cerried (4) - 3 freq corbled (5) - 1 freq carberry (5) - 2 freq cerberus (5) - 15 freq cupboard (5) - 50 freq cuboard (5) - 2 freq cupboord (5) - 2 freq cubberd (5) - 1 freq curried (5) - 2 freq carried (5) - 35 freq craturd (5) - 1 freq firebird (5) - 1 freq overboard (5) - 2 freq carbrini (5) - 1 freq cornyard (5) - 2 freq everbuild (5) - 1 freq seabird (5) - 8 freq rebuild (5) - 1 freq on-buird (5) - 1 freq buird (5) - 52 freq keyburd (5) - 1 freq |
SoundEx code - C616 carefree - 6 freq carbrini - 1 freq cerebrum - 1 freq carberry - 2 freq caur-parks - 1 freq cerberus - 15 freq car-pairk - 3 freq corporate - 26 freq corporation - 5 freq corporations - 4 freq care-free - 1 freq crawford - 5 freq cerebral - 1 freq crapper - 1 freq cropper - 3 freq carpairk - 1 freq corporal - 22 freq cerbuird - 1 freq crafurds - 1 freq crawfurd - 1 freq creepers - 1 freq crawford's - 2 freq cerberus's - 1 freq chair-frame - 1 freq carpark - 5 freq currieboram - 1 freq carver - 14 freq corporately - 1 freq crobertsonuk - 15 freq corfuarts - 1 freq crawfor - 1 freq crowberries - 1 freq |
MetaPhone code - SRBRT cerbuird - 1 freq |
CERBUIRD |
| Time to execute Levenshtein function - 0.321722 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.685658 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.078913 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.041627 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.000854 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. |