Finding the Longest Common Substring and Gestalt Pattern Matching

preview_player
Показать описание
In this session Stew Ashton joins Chris Saxon to discuss a recent question on Ask TOM: implementing the Ratcliff-Obershelp similarity algorithm to rank how similar two strings are.

This works by recursively finding common substrings in the source words. Stew and Chris discuss how to do this using SQL and PL/SQL, comparing the performance of various solutions to find the fastest method.

The winner may surprise you (hint: it's not SQL).
Рекомендации по теме
visit shbcf.ru