I need one. I have a source string of generaly unknown (although known to be less than 100 characters) content, and I need to match it against a 5mb file of likewise-arranged strings (all less than ...

On Friday the 19th of February 2021, M.Sc. Pengfei Xu will defend his doctoral thesis on Efficient Approximate String Matching with Synonyms and Taxonomies. The thesis is related to research done in ...

Approximate matching is a promising technology designed to identify similarities between two digital artifacts. This can be very useful for filtering data for security monitoring and digital forensics ...

On Friday, 19th of February 2021, M.Sc. Pengfei Xu defended his doctoral thesis Efficient Approximate String Matching with Synonyms and Taxonomies. The event has invited Professor Jiaheng Lu ...