Sanctioned party list screening in SAP GTS can use two search algorithms:
Algorithm inherent to SAP GTS ("SAP GTS search")
Algorithm provided on the SAP HANA Platform ("SAP HANA search")
Logic and configuration of the SAP GTS search are described in the Configuration Guide and in KBA 2198337. This section deals with sanctioned party list screening based on SAP HANA search.
Whenever the SAP HANA search engine is utilized in an SAP application, users can search tables and views much like they would when searching for information on the Internet. SAP HANA search uses a fuzzy search mode. Fuzzy search is fault-tolerant: The search is not confined to identical strings but includes strings that are similar to the string entered in the search.
In sanctioned party list screening SAP HANA search might, for example, present "Adem"" as a result of the search for "Adam", or "Ali" as a result for "Aly". In contrast, SAP GTS search would eliminate all four terms from address comparison because the strings are not identical, neither fully, nor in part.
SAP HANA search uses the Levenshtein algorithm for determining the similarity of strings. This algorithm is used to calculate the so-called minimum edit distance between two strings (source and target). The minimum edit distance is the minimum number of operations such as insertion, deletion, and substitution needed to convert the source string into the target string. Based on the minimum edit distance, a percentage of similarity between source and target is calculated.
Note
The utilization of the Levenshtein algorithm in SAP HANA search is explained in a blog post in the SAP Community:https://answers.sap.com/questions/11711411/algorithm-behind-duplicate-check-rule.htmlOn the SAP Community platform, you can also find a blog post on SAP HANA search for sanctioned party list screening: https://community.sap.com/t5/financial-management-blogs-by-sap/how-does-sap-hana-search-work-in-sap-global-trade-services-sanctioned-party/ba-p/13557945
