Abstract:
One embodiment involves a method and apparatus for mapping lexical keywords into entity description semantics in order to create unambiguous buyer-confirmed descriptions of entities. The method described herein relies on a computer program and some mechanism for computer data storage.

Description:
RELATED APPLICATION(S) 
       [0001]    This is a Continuation Application of U.S. patent application Ser. No. 11/213,145, which was filed on Aug. 25, 2005, which in turn claims priority from U.S. Provisional Application 60/606,357, filed Aug. 31, 2004, which incorporated herein by reference. 
     
    
     BACKGROUND OF INVENTION 
       [0002]    There are many descriptions of computer-aided searches of large search spaces, such as the world wide web, whereby narrowing the search space to a successively smaller and more precise area of interest is accomplished using one or more algorithms involving lexicons. 
         [0003]    One problem with the use of lexicons is the limitation inherent in a pure textual search. For example, although a lexical search of the world wide web for matches to “blue sweater” might be refined through human-computer interactions to the more specific “blue sweater crew neck men&#39;s large”, the resulting search result set is likely to include citations for:
       (A) Descriptions of an article of men&#39;s apparel known as a sweater and haying elements of fashion known as a crew-neck and available in size large and extra-large.   (B) Descriptions of an article of men&#39;s apparel known as a sweater and having elements of fashion known as a crew-neck and available at large department stores.   (C) Many reprints and quotes from an often quoted article on the hardworking men on the crew of the Blue Man Group and their experiences during their tour of large cities.       
 
         [0007]    In the above case, the intended search scope is best characterized by the citation in item A. Item B is closer, however there was no semantic meaning to the keyword “large” to indicate that “large” should be used to modify the size of the article of apparel rather than to modify the size of the department store. Item C is wildly out of scope as compared to the buyers intended search space, yet scores a hit (match) on the refined search terms. 
         [0008]    Even more sophisticated computer-aided lexical searches employing lexical associations do not appreciably and consistently reduce the occurrences of search results returning citations that are wildly outside of the target scope (false hits). One commonly employed partial solution to the shortcomings of a pure lexical search is to inject lexical associations into the lexical refinements. Prior attempts to inject lexical associations into computer-aided searches have relied on the existence of a virtual expert advisor, or other access to a domain-specific knowledgebase. in practice such implementations merely inject lexical associations iteratively, resulting in the construction of longer and longer search strings. This technique can result in a rapid narrowing of the search space, however this technique does not reliably eliminate or reduce the occurrence of false hits or wildly out of scope citations. 
         [0009]    It has been observed that when humans interact with computer-aided search engines (e.g., Google, eBay.com) in search of products, services or information, they frequently provide keywords that tend to be values or characteristics of the desired products, services or information. For example, when searching for an automobile, the keyword string might be:
       “1997 Mustang red convertible”
 
where each of the above keywords is the value of an implied, attribute. A human would imply the following attributes;
       
 
         [0000]      Implied Attributes ={Model_year, Model_name, Exterior_color, Body_style} 
         [0011]    Furthermore, a human would infer a mapping of the keywords to attributes as follows:
       Mapping: {Model_year=1997,
           Model_name=Mustang,   Exterior_color=red,   Body_style=convertible}   
               
 
         [0016]    In use, a mapping between the human-specified values/characteristics and the correct corresponding attribute is required in order to enable an unambiguous and effective (i.e., few or no false hits) computer-aided search of a large structured data search space. 
         [0017]    Thus, what is desired is a method and apparatus to confirm the mapping between the human-specified values/characteristics and the correct correspondence to characteristics found in an entity description (e.g. product, service, or information), among other techniques to overcome the above prior art problems (as well as other prior art problems not mentioned). 
       SUMMARY 
       [0018]    One embodiment involves a method and apparatus for mapping lexical keywords into entity description semantics in order to create unambiguous buyer-confirmed descriptions of entities. The method described herein relies on a computer program and some mechanism for computer data storage. 
     
    
     
       BRIEF DESCRIPTION OF DRAWINGS 
         [0019]      FIG. 1  depicts the process flow and data storage as is commonly used in text searches. 
           [0020]      FIG. 2  depicts the data storage elements, processes and examples of semantic category extraction and category confirmation. 
           [0021]      FIG. 3  depicts the data storage elements, process and examples of semantic attribute extraction and category attribute confirmation. 
           [0022]      FIG. 4  depicts the data storage elements, process and examples of semantic attribute value extraction and category attribute value confirmation. 
           [0023]      FIG. 5  depicts an example of a computer-parsable description of hierarchical category description. 
           [0024]      FIG. 6  depicts an example of a cornputer-parsable representation of an item description. 
           [0025]      FIG. 7  depicts an example of a computer-parsable representation of the ranking of importance of an item attribute. 
           [0026]      FIG. 8  depicts the key protocol exchanges between Server and Client 
           [0027]      FIG. 9  depicts examples of
       a computer-parsable representation of Category Attribute DTD   a compressed format of the ITEMS ARRAY, and   an expansion of the ITEMS ARRAY into a textual/human-readable format.       
 
       
    
    
     DETAILED DESCRIPTION 
       [0031]    One method defined in the present embodiment may include the following inputs:
       A list of one of more text strings ( 110 ) as have been provided by the buyer as applicable to the search underway. This list may contain one or more words specifically excluded as a result of the lexical keyword refinement.   A database ( 210 ) containing the union of all known entity category descriptions, winch may occur as an enumerated list, of hierarchical category descriptions, or in a formal language that permits computer-aided enumeration. All example using a human-readable formal language to describe the levels of the hierarchy is provided in  FIG. 5 .   A database ( 240 ) containing buyer profiles.   A database ( 350 ) containing entity descriptions. An example of an entity description is given in  FIG. 6 .   A database ( 355 ) containing a relative scoring of entity attributes. Such scoring is based on the empirical or human-entered likelihood of a particular attribute being important to a buyer in search of that entity. An example of this scoring database is given in  FIG. 7 .       
 
         [0037]    With these inputs then, the mapping front buyer-provided keywords to buyer-confirmed product descriptions occurs through the client-server protocol exchanges of  FIG. 8 , and more specifically through application of the following operations: 
       Operation #1: 
       [0038]    Given a list of one or inure text strings, possibly including buyer-excluded strings, the process ( 220 ) scores the quality of the mapping of the text strings against each of the hierarchical category description expansions. For example, given the strings “sweater large crew NOT (children)” the process ( 220 ) may return a high score (i.e., matching to hierarchical levels) for the following hierarchical category descriptions:
       (A) apparel.men.outerwear.sweater (high score because two of the given strings match)   (B) apparel.women.outerwear.sweater (lower score because only one of the given strings match)       
 
         [0041]    There is also a set of hierarchical category descriptions (e.g., apparel.children.boy.outerwear.sweater) that may receive a low scoring of quality of match due to occurrence of one or more excluded words found in the hierarchical category description. 
         [0042]    Finally there is the set of hierarchical category descriptions that receive a zero score due to no matches of the strings found in the hierarchical category descriptions. 
         [0043]    In one embodiment of this operation, words/strings that are known to he attribute values (e.g., names of colors) and are not likely to be found in any hierarchical category description, are pre-screened from the scoring process, thus reducing compute time required for this operation. 
         [0044]    In another embodiment of this operation, one of many scoring algorithms is selected on the basis of the profile (e.g. record in database  240 ) of a returning buyer, specifically the process  220  increases the score of a particular category description if that category description had been confirmed by the buyer in a previous search. For example, a returning customer with the keyword string “box seat tickets” who had on previous occasions purchased tickets for theatre performances would more likely see theatre-related ticket categories at the top of the list rather than say tickets Par Hockey games. 
       Operation #2: 
       [0045]    The highest scoring hierarchical category descriptions are presented to the buyer in order of highest score toward lowest score. The buyer is then given the opportunity to select the best match of the hierarchical category description as compared to the entity the buyer seeks. In the example:
       apparel.men.outerwear.sweater   apparel.men.sportswear.sweater   apparel.men.holiday.sweater   apparel.women.outerwear.sweater   apparel.women.sportswear.sweater   apparel.women.holiday.sweater   apparel.children.outerwear.sweater   apparel.children.sportswear.sweater   apparel.children.holiday.sweater   entertainment.live-events.tickets.blue-man-group       
 
         [0056]    In one embodiment of this operation, the number of entities in the entity database ( 350 ) that correspond to a particular category is displayed to the buyer, thus providing a technique of positive feedback during the search refinement. An example of this is shown in  FIG. 2 . 
         [0057]    In another embodiment of this operation a logically contiguous set of matching categories (known as a category group) are selectively collapsed so as to reduce the number of enumerated matching categories to a smaller set and thus facilitate display to the buyer. In our example, “blue sweater” would match the following ten (10) fully enumerated categories:
       apparel.men.outerwear.sweater   apparel.men.sportswear.sweater   apparel.men.holiday.sweater   apparel.women.outerwear.sweater   apparel.women.sportswear.sweater   apparel.women.holiday.sweater   apparel.children.outerwear.sweater   apparel.children.sportswear.sweater   apparel.children.holiday.sweater   entertainment.live-events.tickets.blue-man-group       
 
         [0068]    In order to display matched categories in a limited display space, we may wish to collapse the categories. Observe that the first nine (9) fully enumerated categories belong to a category group. The collapsed set may thus be reduced to four (4) categories:
       apparel.men . . . sweater &lt;collapsed from outerwear, sportswear and holiday&gt;   apparel.women . . . sweater &lt;collapsed from outerwear, sportswear and holiday&gt;   apparel.children . . . sweater &lt;collapsed from outerwear, sportswear and holiday&gt;   entertainment.live-events.tickets.blue-man-group       
 
         [0073]    In another embodiment of this operation, if a category group was collapsed in order to reduce the number of matching categories, and the buyer selects front among one or more collapsed category groups, the next level(s) of expansion are presented to the buyer for confirmation. For example, if the buyer confirmed the collapsed category “apparel.men . . . sweater”, the corresponding fully enumerated categories are presented for confirmation. Thus, following our example:
       apparel.men.outerwear.sweater   apparel.men.sportswear.sweater   apparel.men.holiday.sweater       
 
         [0077]    For the purpose of continuing with our example though the following operations, let us assume the buyer selects the category:
       apparel.men.outerwear.sweater.       
 
         [0079]    The buyer-selected category is stored in the storage ( 230 ) for use in subsequent operations. 
       Operation #3: 
       [0080]    At the conclusion of Operation #2, the category description to the lowest level of hierarchy is known (that is, the category is known down to that level where no further hierarchical levels are defined). With this confirmed knowledge that the buyer intends to pursue a search for entities in the specified category, the process ( 360 ) makes suggestions to the buyer of most important search parameters (i.e., attributes). The order of presentation to the buyer of the attributes is determined on the basis of:
       The frequency of occurrence of a particular entity attribute as found in the entity descriptions database ( 350 ), and/or   The value of the Attribute Quotient Database entry for is particular entity attribute ( 355 )       
 
         [0083]    The process ( 360 ) may scan entity entries found in the. Entity Database ( 350 ) that are entities corresponding to the category selected in Operation #2. The process ( 360 ) may assemble and rank attributes found in those entries and suggest to the buyer a set of attributes most frequently found. In the example, since the buyer selected apparel.men.outerwear.sweater (during Operation #2), the set of attributes displayed to the buyer would include: 
         [0000]      {generic_color, size, generic_style, manufacturer_name, manufacturer_product_name}. 
         [0084]    In another embodiment, the Attribute Quotient Database entry for a particular entity attribute is stored as an array whereby the index of the array corresponds to a particular class of buyer (e.g., an X-generation consumer, a Y-generation consumer, a business-to-business buyer) and each value in the array (i.e., the Attribute Quotient) is determined by behaviors or characteristics of the class of buyer. For example, Y-generation consumers statistically choose The Gap over other designers, while X-generation consumers statistically prefer Ralph Lauren over other designers. The Attribute Quotient Database thus influences the ordering of Category Attributes and the Values of those Category Attributes for presentation to the Buyer in Operation #4. 
         [0085]    In one embodiment, the Server ( 810 ) of  FIG. 8  sends to the Client ( 820 )
       a) structured text in a form similar to the Category Attribute DTD ( 910 ) and   b) a computer representation of the Items Array ( 920 ).       
 
         [0088]    Thus the Client is able to display the Items Array in a human-readable format ( 930 ) using a graphical user interface as further described in Operation #4. 
       Operation #4: 
       [0089]    The buyer is then provided a technique to rank the buyer&#39;s relative importance/ranking of the one or more attributes presented for this particular search. 
         [0090]    In another embodiment of this Operation #4, one or more graphical user interface devices are presented to the buyer in order to aid buyer ranking of the relative importance of the attributes. 
         [0091]    In another embodiment of this Operation #4, the buyer may be offered a choice to select from one or more predefined search parameters that uniquely identify a product (e.g., SKU, or SKU plus color code). Alternatively, in one embodiment, the process  360  may suggest one or more matching Featured Item, and offer the buyer the chance to purchase the corresponding Featured Item. 
         [0092]    In another embodiment, the attributes are displayed dynamically, where each successive click results in a new dynamically generated screen that shows the buyer-selected ranking of the attributes. Multiple iterations of buyer clicks followed by repainting of the screen result in a final dynamically generated screen showing all of the buyer-selected attributes in order of importance to the buyer. 
         [0093]    At this point in Operation #4, the buyer has either confirmed buyer&#39;s desire to search for matching entities based on an exact match to a SKU (e.g. the buyer selected a Featured Item), or the buyer has confirmed the relative importance of specific attributes in the parametric search. 
         [0094]    In the Operation #4 process  420  the buyer is aided to identify prioritized choices (1 st  choice, 2 nd  choice, etc.) of values or ranges of values desired (e.g., the availability of a sweater in ‘generic_color=blue’ is acceptable as a first choice and availability in ‘generic_color=green’ is acceptable as a. second choice). 
         [0095]    In one embodiment, one or more graphical user interface device(s) are presented to the buyer in order to aid buyer&#39;s selection of one or more values or ranges of values of attributes. 
         [0096]    In another embodiment, the attribute values are displayed dynamically, where each successive click results in a new dynamically generated screen that shows the buyer-selected ranking at the attribute values. Multiple iterations of buyer clicks followed by repainting of the screen results finally in a dynamically generated screen showing all of the buyer-selected attribute values it order of importance to the buyer. 
       Operation #5: 
       [0097]    At the conclusion of Operation #4, the buyer has either confirmed time precedence of attributes and has indicated preferred values on the basis of actual items available and/or indicated acceptable ranges of values of attributes. An organized array of matching items are presented to the buyer for purchase. In the event the buyer elects not to conclude a transaction, the buyer is given the opportunity to ‘save’ the confirmed criteria (possibly including acceptable ranges for certain attribute values) for subsequent searches. The buyer is presented with options for computer-aided actions to be taken on behalf of the buyer in subsequent searches. 
         [0098]    In one embodiment, the buyer is given the opportunity to select one from a group of rule sets, each set containing the rules of exchange including currency designation, exchange rate authority and limits, and a description of acceptable payment instruments (e.g., credit card, P.O., PayPal, etc). 
         [0099]    In another embodiment, the buyer&#39;s search requirements can be stored in a computer memory and acted on or accessed at a later time. Future action by computer acting as agent for the buyer may inform the buyer of a (newly identified) match or the computer acting as agent for the buyer may perform the transaction on behalf of the buyer. 
         [0100]    Following are various optional features that may be optionally included in various embodiments:
       The method of  FIG. 1  whereby the buyers keywords are filtered to eliminate low value words such as articles (‘a’, ‘the’, ‘an’) connectives and prepositions.   The method of  FIG. 1  whereby in case of the presence of unambiguous keywords, those keywords are mapped to synonyms known to be in more common use (e.g., the words “clothing” gets mapped to the synonym “apparel”.   The method of  FIG. 1  whereby a match of the buyers keywords to category descriptions receive a higher score on the basis of previous full or partial matches as may be recorded in the buyer&#39;s profile record.   Category Descriptions of  FIG. 2  whereby the hierarchy of the category descriptions are described in XML.   Category Descriptions of  FIG. 2  whereby the hierarchy of the category descriptions are organized as a map of a department store.   Category Descriptions of  FIG. 2  whereby the basic item description is in the form of the AART Product XML dictionary.   A technique whereby the buyer is presented with a graphical user interface page containing three (3) independent frames/areas: (a) the text search area, (b) the refinement/feedback area, and (c) the browsing/results area.   The method of  FIG. 2  whereby the hierarchical/category description is confirmed by the buyer using a graphical user interface.   The method of  FIG. 3  whereby the buyer can exit the parametric search at any time and go directly to browsing mode (as described in item ‘c’ above).   The method of  FIG. 3  whereby item attributes (and a selection of values) are proposed to the buyer on the basis of the frequency of occurrence of an attribute being found among the union of items in that confirmed category description.   The method of  FIG. 4  whereby the Entity Description database ( 350 ) contains the rules of exchange including currency designation, exchange rate authority and limits, and a description of acceptable payment instruments (e.g., credit card, P.O., PayPal, etc).   Search criteria/results derive guidance for next operation(s) in the search process whereby at any point during execution of processes  210 ,  310 ,  360 , or  420  a list of products known to have similar attributes to buyer&#39;s criteria are presented to buyer in a browsable window or frame.   The method of  FIG. 4  whereby the value or range of values Of an attribute are confirmed by the buyer through a graphical use interface.   The automatic generation of database  355  whereby the database is generated over time, using actual search results and by capture and analysis of actual buyers&#39; behaviors.       
 
         [0115]    Those skilled in the art may now recognize that the search space has been reduced from the broad class of retrievable entities that may match one or more text-only keywords, down to a search for one or more entities that belong to a known, unambiguous and specific category, and further, that a match between the buyer&#39;s search criteria and entities can be made on the basis of a scoring system, whereby an exact match is not a necessary condition required before presenting the matching entities to the buyer.