# US 10,482,035 B1 · Standard address key system and method > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 10,482,035 B1 - Document ID: US10482035B1 - Status: Granted - Kind: B1 - Application number: 15/614,806 - Filed: 2017-06-06 - Granted: 2019-11-19 - Earliest claimed: 2016-06-07 - Assignees: JPMorgan Chase Bank, N.A. - Applicants: JPMorgan Chase Bank, N.A. - Inventors: Swapna Bondalapati; Richard Lusk; Steven Simecek; Rachel Dean - Web page: https://patentgrep.com/patent/US10482035B1 ## CPC - G06F 12/1408: {by using cryptography (for digital transmission H04L9/00)} - G06F 21/602: {Providing cryptographic facilities or services} - G06F 21/78: to assure secure storage of data (address-based protection against unauthorised use of memory G06F12/14; record carriers for use with machines and with at least a part designed to carry digital markings G06K19/00) - G06F 12/14: Protection against unauthorised use of memory {or access to memory} - G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N) ## Abstract A technique is provided for standardizing addresses. The technique includes implementing a standardization algorithm utilizing at least one computer processor to arrive at a standard address key for each address. The standardization algorithm performs multiple steps. The standardization algorithm pre-processes each input. The algorithm further performs cleaning and preparing each address by removing unnecessary portions of each address and parsing the address by searching the components of the address. The algorithm also concatenates all parts of each parsed address into a standard address key. ## Claims ### Claim 1 A computer-implemented method for creating a standard address key, the method comprising: storing rules for standardization in a memory; receiving addresses at an input interface from multiple data sources, each address including multiple components; and implementing a standardization algorithm utilizing at least one computer processor to arrive at a standard address key for each address, the standardization algorithm performing steps including: pre-processing each address, cleaning and preparing each address by removing unnecessary portions of each address, parsing each address by searching the components of each address, and concatenating all parts of each parsed address into a standard address key that includes a minimum number of necessary characters, wherein when an address includes a zip code and at least one of a city and a state, the removing unnecessary portions includes removing each of the at least one of the city and the state. ### Claim 2 (depends on 1) The method of claim 1, wherein the pre-processing includes removing incorrect characters and punctuation to identify a necessary portion. ### Claim 3 (depends on 2) The method of claim 2, wherein the parsing includes operating on the necessary portion to identify parts of each address. ### Claim 4 (depends on 3) The method of claim 3, further including replacing identified parts of each address with standardized expressions. ### Claim 5 (depends on 4) The method of claim 4, wherein concatenating the parts of each address include concatenating the standardized expressions. ### Claim 6 (depends on 1) The method of claim 1, wherein the standard address key includes necessary numbers delimited from necessary characters. ### Claim 7 (depends on 1) The method of claim 1, further comprising accepting address lists from databases. ### Claim 8 (depends on 7) The method of claim 7, wherein one of the address lists is a non-solicitation address list. ### Claim 9 (depends on 8) The method of claim 8, further comprising comparing, using a duplicate identification engine, standardized addresses on the non-solicitation list with standardized addresses on a mailing list to enable suppression of the addresses contained on the mailing list that are contained on the non-solicitation list. ### Claim 10 A system for address standardization, the system comprising: at least one computer memory storing rules for standardization; at least one input interface for receiving addresses from multiple data sources, each address including multiple components; and at least one computer processor implementing a standardization algorithm to arrive at a standard address key for each address, the standardization algorithm performing steps including: pre-processing each address, cleaning and preparing each address by removing unnecessary portions of each address, parsing each address by searching the components of each address, and concatenating all parts of each parsed address into a standard address key that includes a minimum number of necessary characters, wherein when an address includes a zip code and at least one of a city and a state, the removing unnecessary portions includes removing each of the at least one of the city and the state. ### Claim 11 (depends on 10) The system of claim 10, wherein the pre-processing includes removing incorrect characters and punctuation to identify a necessary portion. ### Claim 12 (depends on 11) The system of claim 11, wherein the parsing includes operating on the necessary portion to identify parts of each address. ### Claim 13 (depends on 12) The system of claim 12, further including replacing identified parts of each address with standardized expressions. ### Claim 14 (depends on 13) The system of claim 13, wherein concatenating the parts of each address includes concatenating the standardized expressions. ### Claim 15 (depends on 10) The system of claim 10, wherein the standard address key includes necessary numbers delimited from necessary characters. ### Claim 16 (depends on 10) The system of claim 10, wherein the parsing, is performed by an SAS® macro program. ### Claim 17 (depends on 10) The system of claim 10, wherein the input interface accepts address lists from databases. ### Claim 18 (depends on 17) The system of claim 17, wherein one of the address lists is a non-solicitation address list. ### Claim 19 (depends on 18) The system of claim 18, further comprising a duplicate identification engine configured to compare standardized addresses on the non-solicitation list with standardized addresses on a mailing list to enable suppression of the addresses contained on the mailing list that are contained on the non-solicitation list. ### Claim 20 A non-transitory computer readable medium for storing executable instructions, wherein the instructions, executed on a computing device perform the following steps: retrieving rules for standardization from a computer memory; receiving addresses at an input interface from multiple data sources, each address including multiple components; and implementing a standardization algorithm utilizing at least one computer processor to arrive at a standard address key for each address, the standardization algorithm performing steps including; pre-processing each address, cleaning and preparing each address by removing unnecessary portions of each address, parsing each address by searching the components of each address, and concatenating all parts of each parsed address into a standard address key that includes a minimum number of necessary characters, wherein when an address includes a zip code and at least one of a city and a state, the removing unnecessary portions includes removing each of the at least one of the city and the state.