Abstract

The present disclosure relates to providing techniques for verifying a given name string which may include plurality of substrings. It discloses a process of verifying transaction data which may comprise a plurality of strings based on an aggregated matching score by separately matching each string of the plurality of strings to stored strings in at least one database. It may then determine a matching score between each string and at least one stored string based on the determined matching score and consequently assign a weight to each string of the plurality of strings. Henceforth, the aggregated matching score based on the determined matching score and the weight of each string of the plurality of strings may be obtained thus enhancing the robustness and efficiency of the name matching techniques and providing more effective results.

Creative Commons License

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.

Share

COinS