Yahoo! Inc.

Microsoft Technology Licensing, LLC

Krishna Leela Poola

Amit Agarwal

Arun Ramanujapuram

Kalyan Kumar Kanuri

Rahul Kamalkishore Agrawal

Krishna Prasad Chitrapura

Mehulkumar Parsana

Deeplinks relevant to the context of a search query are included with a search result returned in response to the search query. Deeplink hierarchies may be generated for websites by analyzing web pages within the websites. A deeplink hierarchy for a website includes a hierarchy of nodes with each node including a group of deeplinks to web pages within the website. When a search query is received and a web page result identified, the search query may be employed to identify a relevant node of deeplinks from a deeplink hierarchy for a website corresponding with the web page result. A search result may then be returned for the web page result that includes the identified deeplinks.

Context-sensitive deeplinks

A service exchange is provided. The service exchange receives text messages (such as SMS messages), such as search queries sent by a user to the service exchange, or a text message sent from the user to another user. The service exchange determines service providers most relevant to the user, and provides the information related to the most relevant service providers to the user, including, for each relevant service provider provided to the user, a dynamically assigned, obfuscated phone number for contacting the service provider.

Apparatus, method, and manufacture for managing scalable and traceable exchanges of content between advertisers and publishers for mobile devices

Aspects include methods, computer readable storing instructions for such methods, and systems for processing text strings such as URLs that comprise patterns of parameters and values for such parameters, delimited in a site-specific manner. Such aspects provide for accepting a number of text strings that are expected to have a common delimiting strategy, then deeply tokenizing those text strings to arrive at a set of tokens from which are selected anchor tokens used to form patterns having the anchor tokens separated by wildcard portions for recursive processing. The patterns formed can be mapped to a tree of nodes. Information concerning relationships between nodes and between tokens within a given node, as well as other heuristics concerning which tokens are parameters and which are values can be used as observed events for producing probabilities that certain tokens are parameters or values, using a dynamic programming algorithm, such as a Viterbi algorithm.

Systems and methods for tokenizing and interpreting uniform resource locators

The present invention relates to methods, systems, and computer readable media comprising instructions for detecting templates within one or more web pages comprising a website. The method of the present invention comprises generating one or more groups of hyperlinks within a respective web page of the one or more web pages comprising the website. An in-link score is calculated for a given uniform resource locator associated with the one or more web pages comprising the website. The hyperlink groups in which the uniform resource locators associated with the one or more web pages comprising the website appear are identified. A template score is assigned to the identified hyperlinks groups on the basis of the in-link score associated with the uniform resource locators to which the hyperlinks comprising the hyperlink group correspond. The hyperlink groups with template scores exceeding a given template score threshold are thereafter identified as templates.

System and method for detecting templates of a website using hyperlink analysis

Techniques are described for organizing structurally similar web pages for a website. Fingerprints are made of the structure of the web pages using shingling by placing the web page's HTML tags and attributes in sequence and encoding the tags and attributes using a standard encoding technique. Fixed-size portions of the encoded sequence are taken and a set of values extracted using independent hash functions to compute the shingles. Alternatively, a DOM tree representation of HTML of the web page is generated and each path of the DOM tree encoded and values extracted using independent hash functions to compute the shingles. A specified number of shingles are retained as the fingerprint. The pages are then clustered based upon the URL and the similarity of the shingles. The clustered hierarchal organization of pages is further pruned by various criteria including similarity of shingles or support of the cluster node in the hierarchy.

Method for organizing structurally similar web pages from a web site

Web page clustering techniques described herein are URL Clustering and Page Clustering, whereby clustering algorithms cluster together pages that are structurally similar. Regarding URL clustering, because similarly structured pages have similar patterns in their URLs, grouping similar URL patterns will group structurally similar pages. Embodiments of URL clustering may involve: (a) URL normalization and (b) URL variation computation. Regarding page clustering, page feature-based techniques further cluster any given set of homogenous clusters, reducing the number of clusters based on the underlying page code. Embodiments of page clustering may reduce the number of clusters based on the tag probabilities and the tag sequence, utilizing an Approximate Nearest Neighborhood (ANN) graph along with evaluation of intra-cluster and inter-cluster compactness.

Growing community of inventors

Bengaluru, India

Krishna Leela Poola