WO2002027550A1

WO2002027550A1 - Match engine for matching profiles

Info

Publication number: WO2002027550A1
Application number: PCT/US2000/026202
Authority: WO
Inventors: Peter Berg Steffensen; Poul Prindahl; Morten Nielsen
Original assignee: Brokerserver.Com
Priority date: 2000-09-25
Filing date: 2000-09-25
Publication date: 2002-04-04
Also published as: AU2000279853A1

Abstract

The present invention relates to a match engine [186] that matches a first profile [196] with a second profile [202] recurrently and reciprocally. The present invention accomplishes this by utilizing standard classification codes to define profiles and register profiles so they can be matched reciprocally and recurrently with other registered profiles.

Description

MATCH ENGINE FOR MATCHING PROFILES Microfiche Appendix

The application includes a microfiche appendix containing computer program listing.

The microfiche appendix consists of 26 microfiche and a total of 1,517 frames. The contents of the microfiche are hereby incorporated in their entirety into this specification by reference.

Technical Field

The present invention relates to a match engine that in real-time or near-real-time matches a first profile with a second profile recurrently and reciprocally, more particularly by utilizing standard classification codes and attribute specification schemes to define and register products and service profiles to be matched on an ongoing basis with other registered profiles.

Background of the Invention Recently, the implementation of advanced computer networks has expanded dramatically. The Internet, for instance, has become a very popular and increasingly important medium for the public in general and businesses in particular to communicate. Communication over the Internet requires software applications executed throughout the network to effectively connect two end users. Examples of such software applications that are used with the Internet are email, chat rooms, instant messaging, World Wide Web browsing, and search engines.

Search engines are used in a variety of different computer and network environments to allow end users to locate relevant documents among a large number of documents dispersed over a computer network. The typical search engine is responsive to keywords input by an end user at a user interface; the search engine searches through a large number of documents dispersed over a computer network and locates documents that are most relevant to the end user's interests, according to the input keywords. As the Internet has expanded over time and the amount of publicly accessible documents has increased, search engines have played an increasingly important role in enabling end users to navigate through the Internet and locate information. Figure 1 depicts an exemplary arrangement of a typical search engine of the prior art.

The purpose of the search engine 16 is to find documents, such as document 20 and document 24. The search engine 16 is accessible by an end user through a user interface 10. The end user normally provides keywords or search terms into the search engine 16 through user interface 10. The user interface 10 can be coupled to search engine 16 through a network connection, such as the Internet. This aspect allows a search engine 16 to service a plurality of computer users with efficiency. Some search engines, such as "spiders" or "bots", periodically query documents accessible through the network 22 and analyze these documents. Results of the analyzed documents are stored in a database 18. The information stored in the database 18 may include the document title, the document location on the network, keywords contained in the document, the frequency of such keywords, and the date of the most recent query. Some databases index the full text of documents. The search engine 16, upon a request from the user interface 10, will search the database for documents containing keywords input by a computer user. The search engine 16 will then output to the user interface 10 information about documents found in the database 18 matching in various degrees to the input query. The search engine 16 may sort the documents found in the database according to the relationship between the keywords input from the user interface with the keywords stored in the database. The frequency of keywords in a document stored in a database 18 and the variety of keywords found in documents 20, 24 stored in a database 18 may be considered by the search engine 16 in formulating a response to a user query. There are several shortcomings of search engines. Often an end user will input keywords he/she believes will be effective in searching for a document. However, the most relevant documents are not found using these keywords. These query search terms may be selected from a different set of vocabulary than the most relevant documents discussing the same area of interest. In other words, there may be semantic differences between the search terms input by the end user searching for documents and the words chosen by the authors of the most relevant documents. Semantic differences can result from different languages, different dialects, or different modes of expression between different end users. For this and other reasons, search engines are unable to adequately assist end users in finding the most relevant document among a large number of documents.

Another shortcoming of typical search engines is that end users input search terms into the search engine and cannot indicate the relative importance of each search term. This is inefficient as end users typically place a preference or priority on an exemplary first search term over an exemplary second search term both input into the search engine at the same time. .For instance, the end user may place more significance on the first search term because the second search term serves only to describe the first search term. If an end user inputs the search terms "blue book" into a search engine, the end user may be trying to locate a document concerning a book that is blue. Without any priority setting for each term, the search engine places equal priority on the words "blue" and "book", making a search result relating to a "blue car" as relevant as a search result pertaining to a "red book". Hence, this characteristic of search engines produces search results that are irrelevant to the user's query and is therefore inefficient. Another shortcoming of search engines is that searches are implemented only in response to search terms from an end user. A search engine leaves the end user unaware of relevant documents that may become available after the keywords are input to the search engine and a search result communicated to the end user. A search engine that performs recurrent searches would be better.

Summary of the Invention

There is a need for a match engine that can reciprocally and recurrently match profiles of two end users communicating on a computer network without semantic restrictions. Further, there is a need for a match engine that can perform this task in real-time or near-realtime. These and other needs are met by the embodiments of the present invention which provides a match engine that matches profiles. The present invention utilizes user interfaces coupled to the match engine to allow end users to define a match request with selectable menus in a vernacular particular to the end user's preferences. Selected match terms from the selectable menus are translated to standard classification codes which the match engine uses for matching. The standard classification codes are thus immune to the semantic preferences of the end users. The end users develop profiles or standard search queries and register these profiles to the match engine to be both immediately and periodically matched against other registered profiles. Positive results from this periodic matching are reported to the end users in a vernacular particular to the end users at the user interfaces.

The present invention allows end users to describe profiles using selectable search terms or keywords in a vernacular particular to the end users preference and translate the keywords into standard codes that are immune to semantic differences. Profiles are submitted to the match engine and recurrently matched with other registered profiles. Profiles with compatible descriptor-sets are matched and the end users associated with the compatible profiles are informed of the match at the user interfaces in a vernacular particular to the end users. Thus, the match engine of the present invention recurrently and reciprocally matches profiles without semantic restrictions.

The present invention also allows the end users to prioritize match terms of profiles to be registered by ranking the relevance of each match term at the user interfaces. Further, the present invention allows end users to classify search terms as critical or informative to effectively and efficiently match two profiles.

One embodiment of the present invention includes a profile exhibition which allows presentation of a plurality of profiles from a profile database and tailoring of a stored profile to an end user's individual needs. The exhibition allows the end user to view profiles in a manner which is most compatible with the end user's preferences and objectives. One embodiment of the present invention includes a directory feature allowing end users to search the database of profile submitters (i.e. other users) with standard classification codes, or with other business-specific search-criteria (i.e. company name, address, and contact information) without registering a profile on the match engine.

The foregoing and other features, aspects, and advantages of the present invention will become more apparent from the following detailed description of the present invention, taken in conjunction with the accompanying drawings.

Brief Description of the Drawings

Figure 1 is a diagram of an arrangement of a search engine of the prior art. Figure 2 is a diagram of a computer system upon which the present invention may be implemented.

Figure 3 a is a diagram of the global architecture of a match engine system. Figure 3 b is a diagram exemplifying the generation of numerous simultaneous matches.

Figure 4 is a diagram illustrating how an end user interfaces with a match engine.

Figure 5 is a diagram of the end user's interaction with a match engine. Figure 6 is a diagram of registered profiles interaction with a search engine.

Figure 7 is a diagram of components of registered profiles.

Figure 8 is a diagram of a match engine algorithm for producing a sorted list of compatible profiles.

Figure 9 is a diagram of the algorithm of assigning match values to registered profiles. Figure 10 is a diagram of the user interaction with the directory system of a match engine.

Detailed Description of the Invention

The description of the invention which follows is exemplary. However, it should be clearly understood that the present invention may be practiced without the specific details described herein.

One embodiment of the present invention relates to a profile matching system that matches profiles recurrently and reciprocally. A user interface of the profile matching system comprises software and hardware providing a list of selectable profile definitions in a vernacular particular to a particular end user. Such an end user creates a profile for matching by selecting at least one descriptor-set of the profile from menus accessible at the user interface. Selected profile descriptor-sets are then translated to standard classification codes, which are not in a particular vernacular. Further, the end user can assign ranking values to the profile descriptor-sets selected from the menus. All relevant information concerning a profile entered at the user interface is appended to a first profile. The first profile is submitted to the match engine and the match engine constructs a list of compatible profiles to the first profile from all the registered profiles of the system. This list of compatible profiles is constructed according to the information appended in the first profile. The list of compatible profiles, also referred to as a match list, is sorted according to a comparison between the profile descriptor-sets appended to the first profile and the profile descriptor-sets appended to other registered profiles. The match list is ordered according to a ranking value that the end user placed on the compatible profile descriptor-sets.

One embodiment of the present invention includes a directory system for users to search for submitters of profiles (i.e. Digital IDs) without registering a profile. Another embodiment of the present invention includes a virtual exhibition allowing users to view profiles in an exhibition format.

At least portions of the invention are intended to be implemented on or over a network such as the Internet. An example of such a network is described in Figure 2. Figure 2 is a block diagram that illustrates a computer system 100 upon which an embodiment of the invention may be implemented. Computer system 100 includes a bus 102 or other communication mechanism for communicating information, and a processor 104 coupled with bus 102 for processing information. Computer system 100 also includes a main memory 106, such as a random access memory (RAM) or other dynamic storage device, coupled to bus 102 for storing information and instructions to be executed by processor 104. Main memory 106 also may be used for storing temporary variables or other intermediate information during execution of instructions to be executed by processor 104. Computer system 100 further includes a read only memory (ROM) 108 or other static storage device coupled to bus 102 for storing static information and instructions for processor 104. A storage device 110, such as a magnetic disk or optical disk, is provided and coupled to bus 102 for storing information and instructions.

Computer system 100 may be coupled via bus 102 to a display 112, such as a cathode ray tube (CRT), for displaying information to a computer user. An input device 114, including alphanumeric and other keys, is coupled to bus 102 for communicating information and command selections to processor 104. Another type of user input device is cursor control 116, such as a mouse, a trackball, or cursor direction keys for communicating direction information and command selections to processor 104 and for controlling cursor movement on display 112. This input device typically has two degrees of freedom in two axes, a first axis (e.g., x) and a second axis (e.g., y), that allows the device to specify positions in a plane. Computer system 100 operates in response to processor 104 executing one or more sequences of one or more instructions contained in main memory 106. Such instructions may be read into main memory 106 from another computer-readable medium, such as storage device 110. Execution of the sequences of instructions contained in main memory 106 causes processor 104 to perform the process steps described herein. In alternative embodiments, hard- wired circuitry may be used in place of or in combination with software instructions to implement the invention. Thus, embodiments of the invention are not limited to any specific combination of hardware circuitry and software.

The term "computer-readable medium" as used herein refers to any medium that participates in providing instructions to processor 104 for execution. Such a medium may take many forms, including but not limited to, non-volatile media, volatile media, and transmission media. Non-volatile media includes, for example, optical or magnetic disks, such as storage device 110. Nolatile media includes dynamic memory, such as main memory 106. Transmission media includes coaxial cables, copper wire and fiber optics, including the wires that comprise bus 102. Transmission media can also take the form of acoustic or light waves, such as those generated during radio wave and infrared data communications.

Common forms of computer-readable media include, for example, a floppy disk, a flexible disk, hard disk, magnetic tape, or any other magnetic medium, a CD-ROM, any other optical medium, punchcards, papertape, any other physical medium with patterns of holes, a

RAM, a PROM, and EPROM, a FLASH-EPROM, any other memory chip or cartridge, a carrier wave as described hereinafter, or any other medium from which a computer can read.

Various forms of computer readable media may be involved in carrying one or more sequences of one or more insfructions to processor 104 for execution. For example, the instructions may initially be carried on a magnetic disk of a remote computer. The remote computer can load the instructions into its dynamic memory and send the instructions over a telephone line using a modem. A modem local to computer system 100 can receive the data on the telephone line and use an infrared transmitter to convert the data to an infrared signal. An infrared detector can receive the data carried in the infrared signal and appropriate circuitry can place the data on bus 102. Bus 102 carries the data to main memory 106, from which processor 104 retrieves and executes the instructions. The instructions received by main memory 106 may optionally be stored on storage device 110 either before or after execution by processor 104.

Computer system 100 also includes a communication interface 118 coupled to bus 102. Communication interface 118 provides a two-way data communication coupling to a network link 120 that is connected to a local network 122. For example, communication interface 118 may be an integrated services digital network (ISDN) card or a modem to provide a data communication connection to a corresponding type of telephone line. As another example, communication interface 118 may be a local area network (LAN) card to provide a data communication connection to a compatible LAN. Wireless links may also be implemented. In any such implementation, communication interface 118 sends and receives electrical, electromagnetic or optical signals that carry digital data streams representing various types of information.

Network link 120 typically provides data communication through one or more networks to other data devices. For example, network link 120 may provide a connection through local network 122 to a host computer 124 or to data equipment operated by an Internet Service Provider (ISP) 126. ISP 126 in turn provides data communication services through the world wide packet data communication network now commonly referred to as the "Internet" 128. Local network 122 and Internet 128 both use electrical, electromagnetic or optical signals that carry digital data streams. The signals through the various networks and the signals on network link 120 and through communication interface 118, which carry the digital data to and from computer system 100, are exemplary forms of carrier waves transporting the information. Computer system 100 can send messages and receive data, including program code, through the network(s), network link 120 and communication interface 118. In the Internet example, a server 130 might transmit a requested code for an application program through Internet 128, ISP 126, local network 122 and communication interface 118. The received code may be executed by processor 104 as it is received, and/or stored in storage device 110, or other non- volatile storage for later execution. In this manner, computer system 100 may obtain application code in the form of a carrier wave.

Figure 3 a relates to an exemplary global network arrangement of the present invention. The master site 26 is a control center in charge of monitoring and maintaining the configuration, quality and integrity of the match engine hardware and software components. The regional sites 28 are servers located in strategic regional locations for easy access to end users 32 in different regions of the world. All of the regional sites 28 are substantially the same and each site backs up the other sites by instant or periodic replication . If one regional site is not functioning, users 32 can be routed to alternate regional sites 28. An intermediate between a regional site and the end users 32 are the partner sites 30. Partner sites are typically Internet service providers or other institutions that manage the end user 32 access to the match engine.

Figure 3b exemplifies one feature of the the present invention that allows for the generation of numerous simultaneous real-time or near-real-time matches based on profile submission. This feat is possible due to the unique utilization of the available memory (RAM) on the computers in the configuration, and to the fact that a match engine configuration comprises match compilers 29 as well as match engines 31. The match compilers 29 are in charge of getting match results from match engines 31. Each match engine 31 is loaded with a specific segment of the total sum of submitted profiles. Match compilers 29 can route profiles submitted for matching to one or a number of match engines 31 , which in turn match a new profile against the existing profile pool, and compile the result and route it back to the user. This can be done " on demand" in real-time or periodically. The first time a profile is submitted, and every time it is edited (and hence re-submitted), the profile is matched real-time. Hereinafter, the profile remains in a profile database 27 and is the subject of matches based on the submission of other profiles (from other clients and end users), as well as periodic (typically daily) self-centered re-matchings (to check if there are changes in the profile database which have a bearing on the profile).

Figure 4 is a diagram showing an exemplary match engine 156, with an exemplary first interface 158 and an exemplary second interface 160. The first and second interface 158, 160 provide end users communication with the match engine 156. The first interface 158 includes selectable descriptions 162 for end users to describe profiles. The selectable descriptions 162 are in a first vernacular specific to the preference of the end user. The first interface 158 further comprises a description translator 164 that translates selected descriptions in a first vernacular to standard classification codes without semantic restrictions. The first interface 158 is also coupled to a description ranker 1667, which allows the end users to prioritize selected descriptions. Similar to the first interface 158, a second interface 160 comprises selectable descriptions 168, a description translator 170, and a description ranker 172, all in a second vernacular. The selectable descriptions 168 are in the second vernacular and the description translator 170 translates the selected descriptions from the selectable descriptions 168 into standard classification codes without semantic restrictions. The description translator 170 translates to standard classification codes that are universal and the same as the standard classification codes translated to by the description translator 164. Further, the description ranker 172 ranks the selected descriptions from the selectable descriptions 168 and appends this information to a profile inputted into the match engine 156 for matching.

The user interfaces, such as first interface 158 and second interface 160, has many useful features. More particularly, the user interfaces allow for users to select standardized codes for products/services. Further, the user interfaces allow for users to select numerous codes within the same profile. The user can select, for each code in the profile, specific attributes and their values. Attributes come in two varieties; the product/service specific attributes (e.g. color, weight, and frequency) and the company/business specific attributes (e.g. credit rating of the business, references, memberships, etc.). The company/business specific attributes are also called "Digital IDs". The invention hence seeks to match with both product/service codes and the merits and credentials of the buyer/supplier of the products/services. Collectively, the two types of match-criteria can be called a descriptor-set. The match engine 156 generates, for profiles registered by the first interface 158, a list of compatible profiles using a compatible profile list constructor 174. The match engine 156 then assigns a match value to each profile in the compatible profile list according to the matched standard classification code and the description ranking. A profile sorter 178 then sorts the profiles according to the magnitude of the assigned match value. The profiles from a sorted compatible profile list are sent to the first interface 158 and translated to the first vernacular by the description translator 164. The end user at the first interface 158 may view the translated profiles from the sorted compatible profile list and select a profile appearing to be compatible and attractive. The end user at the first interface may then initiate a online communication session 180 through the match engine services with the end user at the second interface to discuss any common interests. Alternatively, first end user at the first interface 158 may send a standard text message 182 to the end user at the second interface 160. The standard text messages may be translatable from the first vernacular to the second vernacular and vice versa, if necessary. Both the sending a standard text message, sending email, and initiating online communication sessions can be facilitated by the match engine 156. Alternatively, an end user at the first interface 158 may send an end user at the second interface an email message over a network connection independent of the match engine 156. It is possible to send email and standard text messages to single users (pointcast) or multiple users (narrowcast), on the basis of matched profiles. Hence, when an end user receives a list of profiles from a submitted profile, the list can be marked and the outgoing message will be forwarded to the respective profile submitters. The profile submitters being each of the businesses who submitted profiles that matched your submission.

Figure 5 is a diagram exemplifying the interaction of an exemplary user A 194 and an exemplary user B 204 with a match engine 186. User A 194 submits profile A 196 to the match engine. Similarly, user B 204 submits a profile B 104 to the match engine. The match engine 186 performs matches with all registered profiles in the profile database 188. User A receives matches 192 from the match engine and user B 204 receives matches 200 from the match engine 186. If both profile A 196 and profile B 204 are reciprocally matched, user A may contact user B 190 through a communication medium 199. In one embodiment, the communication medium 199 is part of the match engine 186.

Figure 6 is a diagram exemplifying interaction between submitted profile A 1110 and submitted profile B 1098 both submitted to a match engine. The match engine 1106 interacts with periodic profile A match request 1112 to match submitted profile A 1110 with all other profiles submitted in the system. All other profiles submitted in the system are stored in the profile database 1104. Likewise, periodic profile B match request 1096 is an interaction with the match engine 1106 to match submitted profile B 1098 with all other submitted profiles stored in profile database 1104. In profile match requests 1096, 1112 the match engine queries the database 1104 for compatible profiles. Positive results are periodically communicated to the match engine 1106. When a profile is submitted to the match engine 1106, the profile information is updated 1100, 1108 to the profile database 1104.

Figure 7 is a block diagram exemplifying the components of profiles 1218, 1222 submitted to a match engine 1220. Exemplary profile A 1218 and profile B 1222 are submitted to the match engine 1220. Profiles A and B 1218, 1222 illustrate that a plurality of profiles interact with the match engine simultaneously. Profile A 1218 of Figure 7 illustrates that submitted profiles comprise various settings and information that are utilized by the match engine 1220. Examples of such settings include a visibility setting 1202, an expiration date 1204, an activation setting 1206, a match range setting 1208, and a Digital ID setting 1209. The visibility setting 1202 allows the end user, who registered profile A 1218, to regulate the viewing by others of the information contained in the profile. For instance, the end user who submitted profile A 1218 may desire to keep his/her name information anonymous throughout the matching process. In this example, the visibility setting 1202 will allow an end user to effectively submit a profile, such as profile A 1218, and remain immune from any positive or negative prejudices associated with his/her name. The Digital ID setting contains criteria on the businesses to be matched and can limit match results based on the information contained in a Digital ID.

Another setting associated with profile A 1218 is an expiration date 1204. When profile A 1218 is submitted to the match engine 1220, it is appropriate and desirable for the profile 1218 to expire on a given date, according to the expiration date setting 1204. For example, profile A 1218 submitted to the match engine 1220 will indefinitely recurrently match profile A 1218 with other profiles submitted to the system, in the absence of an expiration date setting 1204. For practical reasons, profile A 1218 will not need to be matched against other profiles indefinitely, as the useful life of profile A is most likely limited. The expiration date setting 1204 will deactivate or unsubmit a submitted profile, such as profile A 1218, on the date and time specified by the end user in the expiration date setting 1204.

Exemplary profile A 1218 also includes an activation setting 1206. The activation setting 1206 allows an end user interacting with profile A 1218 to selectively activate or deactivate submitted profile A 1218. It may be desirable for an end user interacting with profile A 1218 to temporarily deactivate profile A 1218. For example, the end user may be a homebuilder and profile A 1218 describes a particular kind of lumber that the homebuilder uses for every house he/she builds. However, depending on how many houses being built, the time of year, or other circumstances, the home builder may not always desire to purchase that particular kind of lumber described in profile A. In such an instance, the end user would deactivate profile A 1218 using the activation setting 1206 when he/she is not in the market for the particular kind of lumber.

Exemplary profile A 1218 may also contain a match range setting 1208. The match range setting 1208 specifies the geographic extent to which profile A 1218 is to be matched by match engine 1220. The match range setting 1208 associated with profile A 1218 may indicate that profile A 1218 is to be matched only with profiles submitted to the match engine 1220 that are in a particular geographic area. It can be appreciated that an end user associated with profile A 1218 would only be interested in matches to profiles with end users close to their location or in a particular geographic region for tax, political, communication, or reputational reasons. Exemplary profile A 1218 includes end user data 1205 which may include the end user's geographic location, the end user's name, the end user's business, and other relevant information.

End user data, such as end user data 1205 or end user data 1217, may include a Digital ID. A Digital ID is a container of all the user's relevant business details and credentials. A Digital ID is similar to a printed business card. However, as opposed to printed business cards, Digital IDs can be certified by being wrapped in a digital signature (from the X.509v3 standard for identity certification). Furthermore, as instances of standard identity certificates, Digital IDs can be coupled with attribute certificates. Attribute certificates are issued for or against an identity certificate. For instance, a bank can issue an attribute certificate against you to attest to your current credit limit. Apart from utilizing descriptor-sets containing information about the product/service codes and their respective specification attributes, the match engine can utilize information contain in Digital IDs (i.e. both identity certificate information and attribute certificate information) to recurrently and reciprocally identify best-matched buyers and suppliers for each end user. It is important to note that each user may be responsible for his/her own Digital ID and the content herein. The user is initially prompted to verify the Digital ID and can require that the Digital ID is certified, both for identity and attributes. The match engine 1220 may use the match range setting 1208 of profile A 1218 and end user data 1217 for exemplary matched profile B 1222 to qualify profile B onto a list of compatible profiles when profile A is matched. Further, the visibility setting 1210 of profile B 1222 may prevent the end user associated with profile A 1218 to appreciate the geographic location of the end user associated with profile B 1222 by mere inspection of profile B 1222. However, with the appropriate match range setting 1208 for profile A 1218, the end user associated with profile A 1218 can be assured that the end user associated with profile B 1222 is located in a compatible geographic region.

Exemplary profile A 1218 includes general codes 1224, 1226. General code 1224 and general code 1226 illustrate that a plurality of general codes may be associated with a single profile. A profile with multiple general codes is a profile wherein more than one interest is desired to be matched by a match engine 1220. Each general code, such as general code 1224, may include at least one UNSPSC code 1236 or other product code. Further, each general code may include description codes 1238. Description codes may include specifics of price, quantity, attribute, or any other information that most appropriately describes the profiled interest. UNSPSC codes and the description codes are standard classification codes that are appended to profiles. Descriptions are selected at the user interface in a vernacular particular to an end user and translated into these standard classification codes. General code 1226 is similar to general code 1224 and both codes serve to illustrate that more than one general code can be appended to a single profile. Profile B 1222 is similar to profile A 1218 and serves to illustrate that more than one profile can be registered to the match engine.

Figure 8 is a flow chart of an exemplary matching algorithm of a match engine. When a profile is matched, the match engine may construct a list of compatible profiles, as shown in block 1276. In the construction of a list of compatible profiles, typically the match engine searches the database of registered profiles and retrieves profiles in which the critical attributes of the match profile are satisfied. Such critical attributes may include a particular UNSPSC code, the match range setting, or other potentially critical attributes described in a description code. The match engine then determines if the constructed list of compatible profiles is sufficient size, as shown in block 1278. This function is typically performed by comparing the number of profiles in a list of compatible profiles with a predetermined number that represents a threshold value. If the number of profiles of the list of compatible profiles are not sufficient size, the list of compatible profiles is expanded to list the profiles with similar general codes, as shown in block 1280. This can be done by eliminating critical attributes from the profile for the purpose of constructing a list of compatible profiles. UNSPSC codes are organized in a logical fashion and adjacent UNSPSC codes are similar. One exemplary method of determining similar general codes is to expand the list of compatible profiles to profiles from adjacent UNSPSC codes to the matched UNSPSC codes. If the list of compatible profiles is sufficient size, the match engine assigns a match value to each profile from the list of compatible profiles, as shown in block 1282. This function is also performed to the expanded list of compatible profiles from block 1280 upon expansion of the list. The list of compatible profiles is then sorted according to the magnitude of the matched value for each profile of the list of compatible profiles, as shown in block 1284.

Figure 9 is a flow chart illustrating how match values are assigned to profiles during matching. First, profile A, which is the profile being matched, is compared with profile B. In this example, profile B is from the list of compatible profiles. The match engine identifies the similar general codes that are comprised in both profile A and profile B. As the match engine constructs the list of compatible profiles, it selects profiles from a database that have at least one general code that is similar to Profile A. In this example, the match engine identifies similar general codes among profile A and profile B, as shown in block 1288. The match engine then sums the ranking value of the general codes and all associated description codes as indicated by profile A, as shown in block 1290. The match engine then assigns profile B a match value equal to the sum of the ranking values calculated in block 1290, as shown in block 1292. Figure 10 depicts a directory system utilizing a match engine 1304. The directory system facilitates the swift identification of other businesses in the system. These businesses can be identified on the basis of their contact details (name, address, etc.), their credentials, and/or details of their submitted profiles (typically specific UNSPSC codes). The exemplary match engine arrangement includes a match engine 1304 and a plurality of user interfaces, such as user interface 1302. The user interface includes selectable profile descriptions 1294, the description translator 1296, and a description ranker 1298, all in a first vernacular. These functions of the user interface allow an end user to describe a target profile which is matched by the match engine 1304 to profiles contained in a profile database 1306, in the exact same way as the match engine matches two registered profiles. The difference in the directory system is that the target profile is matched only once. Further, a target profile is not submitted to the match engine. Like the match engine relationship for two exemplary submitted profiles, the match engine includes a compatible profile list constructor 1308, a match value assignor 1310, and a profile sorter 1312. The present invention further includes a match engine with an exhibition. An exhibition is a means of tailoring the presentation of the content of the profile database to the individual needs of end users. The exhibition is a presentational function that allows end users to view other end users profiles in a manner which is most conducive to the end user's preferences. The present invention relates to a match engine that matches a first profile with a second profile recurrently and reciprocally. The present invention accomplishes this by utilizing standard classification codes and attribute specification schemes to compose profiles and submitting profiles so they can be matched instantly or periodically with other registered profiles. It will be apparent to those skilled in the art that various modifications and variations can be made in the system and method of the present invention without departing from the spirit or scope of the invention. The present invention cover the modifications and variations of this invention provided they come within the scope of the appended claims and their equivalents.

Claims

What is Claimed Is:

1. A profile matching system, comprising: an interface comprising stored profile descriptions in a plurality of vernaculars, and a target profile, the target profile comprising at least one of the stored profile descriptions translated from one of the plurality of vernaculars to a standard classification code and assigned a ranking value; and a match engine coupled to a storage medium for matching the target profile against profiles stored in the storage medium to obtain a list of compatible profiles having respective match values, the list of compatible profiles sorted in order of match value magnitude.

2. The profile matching system of claim 1, wherein the target profile can be submitted to the match engine by saving the target profile to the storage medium for instant or periodic matching of the first profile against the other profiles stored in the storage medium.

3. The profile matching system of claim 1, wherein the target profile comprises at least one setting selected from a group of an expiration date setting, an activation setting, a geographic matching range setting, a visibility setting, and a Digital ID setting.

4. The profile matching system of claim 3, wherein the geographic matching range setting is set for local matching and the first profile is stored in a local profile database for matching.

5. The profile matching system of claim 3, wherein the geographic matching range setting is set for global matching and the first profile is stored in a local profile database and a target regional profile database for matching.

6. The profile matching system of claim 5, wherein the first profile is replicated from the first regional profile database to a plurality of regional profile databases for matching in a plurality of geographic regions.

7. The profile matching system of claim 1, wherein the match value is computed by the match engine for the target profile and each profile from the list of compatible profiles by summing for each profile from the list of compatible profiles the assigned ranking values for the standard classification codes common to the target profile and each profile from the list of compatible profiles.

8. The profile matching system of claim 1, wherein: each said standard classification codes consist of one general code and optionally at least one description code; and the match value is computed by the match engine for the target profile and each profile from the list of compatible profiles by summing for each profile from the list of compatible profiles the assigned ranking values for the general codes profile from the list of compatible profiles and at least one description code common to the target profile and each that is common to the target profile and each profile from the list of compatible profiles.

9. The profile matching system of claim 1, wherein: said standard classification codes consist of one general code and optionally at least one description code; and if the list of compatible profiles comprises less than a predetermined number of profiles, the list of compatible profiles is expanded to further comprise profiles with at least one similar general code as the general code appended to the first profile.

10. The profile matching system of claim 1, wherein the interface constructs a list of desirable profiles in one of the plurality of vernaculars by translating the list of compatible profiles from standard classification codes to descriptions in one of the plurality of vernaculars.

11. The profile matching system of claim 10, wherein each profile of the list of desirable profiles are selectable for communication with an end user associated with a selected profile.

12. The profile matching system of claim 11, wherein the communication with an end user consisting of one of a group of an email message, an internet online communication session, and a standard text message in a first vernacular.

13. The profile matching system of claim 1, wherein each at least one standard classification code consist of one general code and optionally at least one description code.

14. The profile matching system of claim 13, wherein the at least one description code comprises information selected from a group of a price, a quantity, and an attribute.

15. The profile matching system of claim 13, wherein each profile of the list of compatible profiles comprises at least one general code of the target profile.

16. The profile matching system of claim 13, wherein the at least one general code is a UNSPSC code.

17. The profile matching system of claim 13, wherein the list of compatible profiles consists of profiles from a list of submitted profiles that have a common general code as the target profile.

18. The profile matching system of claim 13, wherein the list of compatible profiles consists profiles from a list of submitted profiles that have description codes that are common with all critical description codes of the target profile.

19. The profile matching system of claim 13, wherein the interface comprises attribute usage objects correlated to UNSPSC codes to provide statistical information on products and services.

20. The profile matching system of claim 1 , wherein: the match engine comprises a key extractor that classifies the at least one standard classification code of to the target profile based on the usage statistics of the target profile.

21. The profile matching system of claim 1, wherein the match engine locates associated information related to the target profile.

22. In a system comprising a match engine and at least one interface remote from and connectable to the match engine, a method of matching profiles, comprising steps of:

(a) forming a target profile at the interface, the forming step comprising the steps of: selecting at least one profile description from a list of selectable profile descriptions in one of a plurality of vernaculars; translating the at least one profile descriptions to a standard classification code; and assigning a ranking value to the profile descriptions;

(b) communicating the target profile formed in step (a) from the interface to the match engine; and (c) matching the target profile against profiles in a storage medium coupled to the match engine, the step of matching comprising: constructing a list of compatible profiles from the profiles in the storage medium; assigning a match value to each profile in the list of compatible profiles; and sorting the list of compatible profiles according to the respective magnitudes of the match values assigned to the profiles in the list of compatible profiles.

23. The method of claim 26, wherein the target profile communicated to the match engine is saved on the storage medium and periodically matched against other profiles.

24. The method of claim 22, wherein the target profile comprises at least one selected from a group of an expiration date setting, an activation setting, a geographic matching range setting, a visibility setting, and a Digital ID setting.

25. The method of claim 24, wherein the geographic matching range setting is set for local matching and the target profile is stored in a local profile database for matching.

26. The method of claim 24, wherein the geographic matching range setting is set for global matching and the target profile is stored in a local profile database and a first regional profile database for matching.

27. The method of claim 26, wherein the target profile is replicated from the first regional profile database to a plurality of regional profile databases for matching in a plurality of geographic regions.

28. The method of claim 22, wherein the match value is computed the match engine for the target profile and each profile from the list of compatible profiles by summing for each profile from the list of compatible profiles the assigned ranking values for the standard classification codes common to the target profile and each profile from the list of compatible profiles.

29. The method of claim 22, wherein: each said at least one standard classification code consists of one general code and optionally at least one description code; and the match value is computed by the match engine for the target profile and each profile from the list of compatible profiles by summing for each profile from the list of compatible profiles the assigned ranking values for the general codes common to the target profile and each profile from the list of compatible profiles and the at least one description code that is common to the target profile and each profile from the list of compatible profiles.

30. The method of claim 22, wherein: said standard classification codes consist of one general code and optionally at least one description code; and if the list of compatible profiles comprises less than a predetermined number of profiles, the list of compatible profiles is expanded to further comprise profiles with at least one similar general code as the general code appended to the first profile.

31. The method of claim 22, wherein the at least one interface constructs a list of desirable profiles in one of a plurality of vernaculars by translating the list of compatible profiles from standard classification codes to descriptions in one of the plurality of vernaculars.

32. The method of claim 31, wherein each profile of the list of desirable profiles are selectable for communication with an end user associated with a selected profile.

33. The method of claim 32, wherein the communication with an end user consists of one of a group of an email message, an internet chat session, and a standard text message in a first vernacular.

34. The method of claim 22, wherein each at least one standard classification code consist of one general code and optionally at least one description code.

35. The method of claim 34, wherein the at least one description code comprises information selected from a group of a price, a quantity, and an attribute.

36. The method of claim 34, wherein each profile of the list of compatible profiles comprises at least one general code of the target profile.

37. The method of claim 34, wherein the at least one general code is a UNSPSC code.

38. The method of claim 34, wherein the list of compatible profiles consists of profiles from a list of registered profiles that have a common general code as the target profile.

39. The method of claim 34, wherein the list of compatible profiles consists profiles from a list of registered profiles that have description codes that are common with all critical description codes of the target profile.

40. The method of claim 34, wherein the first interface statistical information statistics on products and services.

41. The method of claim 22, wherein: the match engine comprises a key extractor that classifies the at least one standard classification code of the target profile based on the usage statistics of the target profile.

42. The method of claim 22, wherein the match engine locates associated information related to the target profile.

43. A computer-readable medium having stored thereon a plurality of sequences of instructions, wherein the plurality of sequences of instructions comprise the steps of:

(a) forming a target profile at the interface, the forming step comprising the steps of: selecting at least one profile description from a first list of selectable profile descriptions in one of a plurality of vernaculars; translating the at least one profile descriptions to a standard classification code; and assigning a ranking value to the target profile descriptions;

(b) communicating the profile formed in step (a) from the interface to the match engine; and

(c) matching the target profile against profiles in a storage medium coupled to the match engine, the step of matching comprising: constructing a list of compatible profiles from the profiles in the storage medium; assigning a match value to each profile in the list of compatible profiles; and sorting the list of compatible profiles according to the respective magnitudes of the match values assigned to the profiles in the list of compatible profiles.

44. The computer-readable medium of claim 43, wherein the target profile communicated to the match engine is saved on the storage medium and instantly or periodically matched against other profiles.

45. The computer-readable medium of claim 43, wherein the target profile comprises at least one selected from a group of an expiration date setting, an activation setting, a geographic matching range setting, a visibility setting, and a Digital ID setting.

46. The computer-readable medium of claim 45, wherein the geographic matching range setting is set for local matching and the target profile is stored in a local profile database for matching.

47. The computer-readable medium of claim 45, wherein the geographic matching range setting is set for global matching and the target profile is stored in a local profile database and a first regional profile database for matching.

48. The computer-readable medium of claim 47, wherein the target profile is duplicated from the first regional profile database to a plurality of regional profile databases for matching in a plurality of geographic regions.

49. The computer-readable medium of claim 43, wherein the match value is computed the match engine for the target profile and each profile from the list of compatible profiles by summing for each profile from the list of compatible profiles the assigned ranking values for the standard classification codes common to the target profile and each profile from the list of compatible profiles.

50. The computer-readable medium of claim 43, wherein: each said at least one standard classification code consists of one general code and optionally at least one description code; and the match value is computed by the match engine for the target profile and each profile from the list of compatible profiles by summing for each profile from the list of compatible profiles the assigned ranking values for the general codes common to the target profile and each profile from the list of compatible profiles and the at least one description code that is common to the target profile and each profile from the list of compatible profiles.

51. The computer-readable medium of claim 43 , wherein: said standard classification codes consist of one general code and optionally at least one description code; and if the list of compatible profiles comprises less than a predetermined number of profiles, the list of compatible profiles is expanded to further comprise profiles with at least one similar general code as the general code appended to the first profile.

52. The computer-readable medium of claim 43, wherein the at least one interface constructs a list of desirable profiles in one of a plurality of vernaculars by translating the list of compatible profiles from standard classification codes to descriptions in one of the plurality of vernaculars.

53. The computer-readable medium claim 52, wherein each profile of the list of desirable profiles are selectable for communication with an end user associated with a selected profile.

54. The computer-readable medium of claim 53, wherein the communication with an end user consists of one of a group of an email message, an internet chat session, and a standard text message in a first vernacular.

55. The computer-readable medium of claim 43, wherein each at least one standard classification code consist of one general code and optionally at least one description code.

56. The computer-readable medium of claim 55, wherein the at least one description code comprises information selected from a group of a price, a quantity, and an attribute.

57. The computer-readable medium of claim 55, wherein each profile of the list of compatible profiles comprises at least one general code of the target profile.

58. The computer-readable medium of claim 55, wherein the at least one general code is a UNSPSC code.

59. The computer-readable medium of claim 55, wherein the list of compatible profiles consists of profiles from a list of registered profiles that have a common general code as the target profile.

60. The computer-readable medium of claim 55, wherein the list of compatible profiles consists profiles from a list of registered profiles that have description codes that are common with all critical description codes of the target profile.

61. The computer-readable medium of claim 55, wherein the first interface statistical information statistics on products and services.

62. The computer-readable medium of claim 43, wherein: the match engine comprises a key extractor that classifies the at least one standard classification code of the target profile based on the usage statistics of the target profile.

63. The computer-readable medium of claim 43, wherein the match engine locates associated information related to the target profile.

64. A computer data signal embodied in a carrier wave and representing a sequence of instructions which, when executed by one or more processors, causes the one or more processors to match profiles, wherein the sequences of instructions are comprising the steps of: (a) forming a target profile at the interface, the forming step comprising the steps of: selecting at least one profile description from a first list of selectable profile descriptions in one of a plurality of vernaculars; translating the at least one profile descriptions to a standard classification code; and assigning a ranking value to the profile descriptions;

(b) communicating the target profile formed in step (a) from the interface to the match engine; and

65. The computer data signal of claim 64, wherein the target profile communicated to the match engine is saved on the storage medium and periodically matched against other profiles.

66. The computer data signal of claim 64, wherein the target profile comprises at least one selected from a group of an expiration date setting, an activation setting, a geographic matching range setting, a visibility setting, and a Digital ID setting.

67. The computer data signal of claim 66, wherein the geographic matching range setting is set for local matching and the target profile is stored in a local profile database for matching.

68. The computer data signal of claim 66, wherein the geographic matching range setting is set for global matching and the target profile is stored in a local profile database and a first regional profile database for matching.

69. The computer data signal of claim 68, wherein the target profile is duplicated from the first regional profile database to a plurality of regional profile databases for matching in a plurality of geographic regions.

70. The computer data signal of claim 64, wherein the match value is computed the match engine for the target profile and each profile from the list of compatible profiles by summing for each profile from the list of compatible profiles the assigned ranking values for the standard classification codes common to the target profile and each profile from the list of compatible profiles.

71. The computer data signal of claim 64, wherein: each said at least one standard classification code consists of one general code and optionally at least one description code; and the match value is computed by the match engine for the target profile and each profile from the list of compatible profiles by summing for each profile from the list of compatible profiles the assigned ranking values for the general codes common to the target profile and each profile from the list of compatible profiles and the at least one description code that is common to the target profile and each profile from the list of compatible profiles.

72. The computer data signal of claim 70, wherein: said standard classification codes consist of one general code and optionally at least one description code; and if the list of compatible profiles comprises less than a predetermined number of profiles, the list of compatible profiles is expanded to further comprise profiles with at least one similar general code as the general code appended to the first profile.

73. The method of claim 64, wherein the at least one interface constructs a list of desirable profiles in one of a plurality of vernaculars by translating the list of compatible profiles from standard classification codes to descriptions in one of the plurality of vernaculars.

74. The computer data signal of claim 73, wherein each profile of the list of desirable profiles are selectable for communication with an end user associated with a selected profile.

75. The computer data signal of claim 74, wherein the communication with an end user consists of one of a group of an email message, an internet chat session, and a standard text message in a first vernacular.

76. The computer data signal of claim 64, wherein each at least one standard classification code consist of one general code and optionally at least one description code.

77. The computer data signal of claim 76, wherein the at least one description code comprises information selected from a group of a price, a quantity, and an attribute.

78. The computer data signal of claim 76, wherein each profile of the list of compatible profiles comprises at least one general code of the target profile.

79. The computer data signal of claim 76, wherein the at least one general code is a UNSPSC code.

80. The computer data signal of claim 76, wherein the list of compatible profiles consists of profiles from a list of registered profiles that have a common general code as the target profile.

81. The computer data signal of claim 76, wherein the list of compatible profiles consists profiles from a list of registered profiles that have description codes that are common with all critical description codes of the target profile.

82. The computer data signal of claim 76, wherein the first interface statistical information statistics on products and services.

83. The computer data signal of claim 64, wherein: the match engine comprises a key extractor that classifies the at least one standard classification code of the target profile based on the usage statistics of the target profile.

84. The computer data signal of claim 64, wherein the match engine locates associated information related to the target profile.