Optimization of edit distance algorithm for sanctions screening risk score assessment

1Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

Evaluating Risk Score Assessment for sanctions screening is necessary to calculate and gauge the risk rate of data elements involved during screening. It includes string matching process in reviewing sanctions lists to check if any investor in a fund is involved in fraud by matching the investor information (as Stop Descriptor) with the Sanctions List which contains the names of individuals who are known to be involved in financial crime or terrorism. This paper will present the inherent capability of Edit Distance algorithm or the Damerau-Levenshtein (DL) Distance algorithm to address many common misspellings and typos in string matching through insertion, deletion, transposition and substitution which are considered as a significant component of fuzzy possible success rating used in Sanction Screening. The paper also aims to optimize the DL Distance Algorithm by applying the theories of phonetic algorithm which expected to provide big impact on speed performance problem of computing the edit distance of two longer strings.

Cite

CITATION STYLE

APA

Nino, R., Sison, A., & Medina, R. (2019). Optimization of edit distance algorithm for sanctions screening risk score assessment. International Journal of Advanced Trends in Computer Science and Engineering, 8(4), 1289–1295. https://doi.org/10.30534/ijatcse/2019/40842019

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free