6. A computer-implemented method of scoring and maintaining address data for any of a plurality of records in an address database, comprising: maintaining a package-level detail database of active shipment records in associated memory, each active shipment record comprising an active tracking number, an active ship-to address, and an active delivery pattern code; maintaining an electronic archive of delivery records in said memory, each delivery record comprising a past tracking number, a past ship-to address, a past delivery pattern code, and a stop identifier; gathering address data from said detail database and said archive into a queue for a period of days; scoring said address data in said queue; building a consignee staging queue for storing those data in said queue related to a select consignee location; assigning a mining key to a current parcel selected from said consignee staging queue, said mining key comprising a parcel tracking number and a current delivery pattern code; comparing said mining key to said package-level detail database and said archive by having one or more computer components execute logic for: (a) retrieving from said archive those select delivery records having a past delivery pattern code that matches said current delivery pattern code, each of said select delivery records having a select past ship-to address; and (b) retrieving from said package-level detail database those select active shipment records having an active ship-to address that matches any said select past ship-to address in said select delivery records; building a set of mined data comprising said select delivery records and said select active shipment records; prioritizing said set of mined data in order of the records most closely associated with said mining key, such that a preferred address related to said mining key occurs first, wherein said step of prioritizing said set of mined data comprises having at least one of said one or more computer components execute logic for: (a) replacing one or more sequence values in a plurality of ship-to address records stored in said set of mined data with a representative symbol; (b) clustering together those said ship-to address records having the same stop identifier; (c) clustering together those said ship-to address records having the same delivery pattern code; building a delivery pattern similarity matrix by counting the coincidence of each delivery pattern code and each ship-to address within said set of mined data; (d) summing the overlapping delivery pattern occurrences within said delivery pattern similarity matrix for each pair of ship-to addresses; (e) building a stop identifier similarity matrix by counting the coincidence of each stop identifier and each ship-to address within said set of mined data; (f) summing the overlapping stop occurrences within said stop identifier similarity matrix for each pair of ship-to addresses; and (g) sorting said set of mined data in order of the highest number of overlapping delivery pattern occurrences and the highest number of overlapping stop occurrences; and assigning said preferred address to said current parcel and updating said address database.
6. A computer-implemented method of scoring and maintaining address data for any of a plurality of records in an address database, comprising: maintaining a package-level detail database of active shipment records in associated memory, each active shipment record comprising an active tracking number, an active ship-to address, and an active delivery pattern code; maintaining an electronic archive of delivery records in said memory, each delivery record comprising a past tracking number, a past ship-to address, a past delivery pattern code, and a stop identifier; gathering address data from said detail database and said archive into a queue for a period of days; scoring said address data in said queue; building a consignee staging queue for storing those data in said queue related to a select consignee location; assigning a mining key to a current parcel selected from said consignee staging queue, said mining key comprising a parcel tracking number and a current delivery pattern code; comparing said mining key to said package-level detail database and said archive by having one or more computer components execute logic for: (a) retrieving from said archive those select delivery records having a past delivery pattern code that matches said current delivery pattern code, each of said select delivery records having a select past ship-to address; and (b) retrieving from said package-level detail database those select active shipment records having an active ship-to address that matches any said select past ship-to address in said select delivery records; building a set of mined data comprising said select delivery records and said select active shipment records; prioritizing said set of mined data in order of the records most closely associated with said mining key, such that a preferred address related to said mining key occurs first, wherein said step of prioritizing said set of mined data comprises having at least one of said one or more computer components execute logic for: (a) replacing one or more sequence values in a plurality of ship-to address records stored in said set of mined data with a representative symbol; (b) clustering together those said ship-to address records having the same stop identifier; (c) clustering together those said ship-to address records having the same delivery pattern code; building a delivery pattern similarity matrix by counting the coincidence of each delivery pattern code and each ship-to address within said set of mined data; (d) summing the overlapping delivery pattern occurrences within said delivery pattern similarity matrix for each pair of ship-to addresses; (e) building a stop identifier similarity matrix by counting the coincidence of each stop identifier and each ship-to address within said set of mined data; (f) summing the overlapping stop occurrences within said stop identifier similarity matrix for each pair of ship-to addresses; and (g) sorting said set of mined data in order of the highest number of overlapping delivery pattern occurrences and the highest number of overlapping stop occurrences; and assigning said preferred address to said current parcel and updating said address database. 8. The method of claim 6 , further comprising: selecting said preferred address as a preferred consignee address for a single consignee location; assigning a unique consignee token related to said single consignee location; and storing said unique consignee token and said preferred consignee address in a master address database located in said memory.