Abstract: A browse node page is addressed by its path. As a result, a web crawler may be more likely to find the browse node than the corresponding parameter-based search page. The browse node may be further distinguished from a search result page by the use of a title or header metatag that indicates information about the browse node and distinguishes the browse node from a general search result page. The number of combinations of keywords, categories, and key-value pairs makes the creation of a browse node for every possible combination prohibitive in all but the simplest applications. Methods and systems to identify which search result pages should be converted to browse nodes are disclosed herein.

Abstract: A browse node page is addressed by its path. As a result, a web crawler may be more likely to find the browse node than the corresponding parameter-based search page. The browse node may be further distinguished from a search result page by the use of a title or header metatag that indicates information about the browse node and distinguishes the browse node from a general search result page. The number of combinations of keywords, categories, and key-value pairs makes the creation of a browse node for every possible combination prohibitive in all but the simplest applications. Methods and systems to identify which search result pages should be converted to browse nodes are disclosed herein.

Abstract: A browse node page is addressed by its path. As a result, a web crawler may be more likely to find the browse node than the corresponding parameter-based search page. The browse node may be further distinguished from a search result page by the use of a title or header metatag that indicates information about the browse node and distinguishes the browse node from a general search result page. The number of combinations of keywords, categories, and key-value pairs makes the creation of a browse node for every possible combination prohibitive in all but the simplest applications. Methods and systems to identify which search result pages should be converted to browse nodes are disclosed herein.

Abstract: A browse node page is addressed by its path. As a result, a web crawler may be more likely to find the browse node than the corresponding parameter-based search page. The browse node may be further distinguished from a search result page by the use of a title or header metatag that indicates information about the browse node and distinguishes the browse node from a general search result page. The number of combinations of keywords, categories, and key-value pairs makes the creation of a browse node for every possible combination prohibitive in all but the simplest applications. Methods and systems to identify which search result pages should be converted to browse nodes are disclosed herein.

Abstract: A method of posting a listing submitted with respect to a first electronic commerce system onto a second electronic commerce system is disclosed. A submission of the listing is received for posting in association with a target category included in a taxonomy of the first electronic commerce system. Category confidence scores are generated pertaining to strengths of correspondences between the target category and each of a set of candidate matching categories included in a taxonomy of the second electronic commerce system. At least one of the candidate matching categories is selected as an actual matching category. The selecting is communicated for posting of the listing in association with the actual matching category included in the taxonomy of the second electronic commerce system in addition to the posting of the listing in association with the target category included in the taxonomy of the first electronic commerce system.