Patent ID: 9697301
Date: 2017-07-04
CPC Classifications: G06F

Claim:
1. A method comprising: utilizing one or more processors to execute a program of instructions configured to: create a stored taxonomy representing addresses, the taxonomy comprising a plurality of nodes, wherein the plurality of nodes comprise an element of an address, the plurality of nodes including a plurality of leaf nodes representing an element of an address unique to a predetermined address and at least one root node representing an element of an address shared by the addresses of the taxonomy; determine an n-gram representation of one or more paths of the taxonomy, each n-gram representation comprising at least one n-gram for each node in the path from a leaf node to a root node; receive one or more address entries as input; compute a signature for the one or more address entries, the signature for the one or more address entries comprising an n-gram representation; access the stored taxonomy; match, using a similarity computation, the signature from the one or more address entries with at least one n-gram representation, wherein the matching comprises: trace a path in the taxonomy from the leaf node having the highest similarity level to the root node, wherein the path is based upon the matched n-gram representation corresponding to a path of leaf nodes having the highest similarity to each of the elements in the one or more address entries, and identify, based upon the traced path, the elements of the address corresponding to the one or more address entries; and standardize the one or more address entries based on the traced path in the taxonomy.