Asapp, Inc.

Kyle Swanson

Tao Lei

Lili Yu

The present disclosure describes a system, method, and computer program for matching an input file to one of a plurality of datastore files and displaying the rationale for the match. Neural networks are trained to create vector representations of objects in the input file and the datastore files. The cost of each possible pairing of vector representations between the input file and a datastore file is computed, and an optimal transport algorithm is used to identify the vector pairings that result in the lowest total cost of alignment. The datastore file with the lowest total cost of alignment to the input file is identified as the best matching file. The alignment results are used to display the rationale for the match. To constrain the alignment results of the optimal transport algorithm, one or more dummy points and, in certain embodiments, duplicate points are added to one or both of the vector sets to achieve alignments with the desired sparsity patterns.

Growing community of inventors

Bronxville, NY, United States of America

Kyle Swanson