Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
argive (0) - 1 freq argie (1) - 17 freq arrive (1) - 51 freq archive (2) - 26 freq arvie (2) - 1 freq reive (2) - 5 freq trive (2) - 1 freq argue (2) - 49 freq drive (2) - 167 freq orive (2) - 1 freq argyre (2) - 1 freq firgive (2) - 2 freq pruive (2) - 22 freq aggie (2) - 49 freq cruive (2) - 1 freq arise (2) - 10 freq amgove (2) - 1 freq dreive (2) - 4 freq argyle (2) - 5 freq agivey (2) - 2 freq angie (2) - 36 freq furgive (2) - 4 freq agile (2) - 2 freq alive (2) - 160 freq arite (2) - 7 freq |
argive (0) - 1 freq argie (2) - 17 freq arrive (2) - 51 freq argied (3) - 22 freq furgive (3) - 4 freq agivey (3) - 2 freq argyle (3) - 5 freq rive (3) - 18 freq airgie (3) - 1 freq argie' (3) - 1 freq forgive (3) - 16 freq argies (3) - 9 freq give (3) - 161 freq 'give (3) - 2 freq amgove (3) - 1 freq orive (3) - 1 freq argue (3) - 49 freq reive (3) - 5 freq arvie (3) - 1 freq firgive (3) - 2 freq argyre (3) - 1 freq rave (4) - 9 freq geve (4) - 1 freq arguin (4) - 16 freq gove (4) - 14 freq |
SoundEx code - A621 archive - 26 freq airchbishop - 8 freq argy-bargy - 12 freq argy-bargyin - 2 freq argie-bargie - 14 freq archbishop - 11 freq argie-bargiein - 2 freq archibald - 4 freq air-space - 1 freq airchbshop - 1 freq argybargyin - 1 freq archipelago - 3 freq airgie-bargied - 1 freq argie-bargied - 1 freq argufied - 1 freq arguably - 10 freq argiefiein - 1 freq archives - 8 freq aerospace - 1 freq argiebargie - 1 freq argyfeers - 1 freq argie-bargies - 1 freq airguably - 3 freq airspace - 1 freq archbischop - 2 freq €˜airships - 1 freq airships - 3 freq airchibald - 1 freq argy-bargies - 1 freq archiepelago - 1 freq argive - 1 freq arcofprosperity - 2 freq aworkafullday - 1 freq arsvsmufc - 2 freq archivetvmus - 2 freq archbishopstua - 1 freq ahrcpress - 1 freq arkbound - 1 freq arkbounduk - 3 freq |
MetaPhone code - ARJF argive - 1 freq |
ARGIVE |
Time to execute Levenshtein function - 0.193174 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.500396 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.047452 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.037362 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.000992 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. |