| Patent application number | Description | Published |
|---|
| 20090106221 | Ranking and Providing Search Results Based In Part On A Number Of Click-Through Features - Embodiments are configured to provide information based on a user query. In an embodiment, a system includes a search component having a ranking component that can be used to rank search results as part of a query response. In one embodiment, the ranking component includes a ranking algorithm that can use one or more click-through features to rank search results which may be returned in response to a query. Other embodiments are available. | 04-23-2009 |
| 20090106223 | ENTERPRISE RELEVANCY RANKING USING A NEURAL NETWORK - A neural network is used to process a set of ranking features in order to determine the relevancy ranking for a set of documents or other items. The neural network calculates a predicted relevancy score for each document and the documents can then be ordered by that score. Alternate embodiments apply a set of data transformations to the ranking features before they are input to the neural network. Training can be used to adapt both the neural network and certain of the data transformations to target environments. | 04-23-2009 |
| 20090106235 | Document Length as a Static Relevance Feature for Ranking Search Results - Embodiments are configured to provide information based on a user query. In an embodiment, a system includes a search component having a ranking component that can be used to rank search results as part of a query response. In one embodiment, the ranking component includes a ranking algorithm that can use the length of documents returned in response to a search query to rank search results. | 04-23-2009 |
| 20090182723 | RANKING SEARCH RESULTS USING AUTHOR EXTRACTION - Architecture that extracts author information from general documents and uses the author information for search results ranking. The architecture performs automatic author value extraction and makes the extracted value available at index time for subsequent use at query processing and results ranking. Machine learning (e.g., a perceptron algorithm) is employed and a set of input features for the perceptron algorithm utilized for author value extraction. The extracted author value is converted into a feature for input a ranking function for generating a ranking score for each document. The input features can also be weighted according to weighting criteria. | 07-16-2009 |
| 20090187550 | SPECIFYING RELEVANCE RANKING PREFERENCES UTILIZING SEARCH SCOPES - A mechanism for expressing a user preference to a set of documents based on user knowledge about the document corpora. The user preference input to the system can be positive, negative, or both. A set of documents that can be identified with a query can define a search scope definition. The search scope is mapped into an input ranking feature for a ranking function. The search scope definition is employed as a soft preference ranking feature, and thus, used to bias ranking via relevance feedback. The mechanism facilitates increasing or decreasing the final ranking score of a document based on whether the document falls into the user scope. The ranking weight can be configured by the user ad-hoc, or when relevance judgments are available, using machine learning techniques to find the optimal weights to optimize ranking. | 07-23-2009 |
| 20090198667 | Generating Search Result Summaries - Embodiments are configured to provide a summary of information associated with one or more search results. In an embodiment, a system includes a summary generator that can be configured to provide a summary of information including one or more snippets associated with a search term or search terms. The system includes a ranking component that can be used to rank snippets and the ranked snippets can be used when generating a summary that includes one or more ranked snippets. In one embodiment, the system can be configured to include one or more filters that can be used to filter snippets and the filtered snippets can be used when generating a summary. Other embodiments are available. | 08-06-2009 |
| 20090240680 | TECHNIQUES TO PERFORM RELATIVE RANKING FOR SEARCH RESULTS - Techniques to perform relative ranking for search results are described. An apparatus may include an enhanced search component operative to receive a search query and provide ranked search results responsive to the search query. The enhanced search component may comprise a resource search module operative to search for resources using multiple search terms from the search query, and output a set of resources having some or all of the search terms. The enhanced search component may also comprise a proximity generation module communicatively coupled to the resource search module, the proximity generation module operative to receive the set of resources, retrieve search term position information for each resource, and generate a proximity feature value based on the search term position information. The enhanced search component may further comprise a resource ranking module communicatively coupled to the resource search module and the proximity generation module, the resource ranking module to receive the proximity feature values, and rank the resources based in part on the proximity feature values. Other embodiments are described and claimed. | 09-24-2009 |
| 20090259651 | SEARCH RESULTS RANKING USING EDITING DISTANCE AND DOCUMENT INFORMATION - Architecture for extracting document information from documents received as search results based on a query string, and computing an edit distance between the data string and the query string. The edit distance is employed in determining relevance of the document as part of result ranking by detecting near-matches of a whole query or part of the query. The edit distance evaluates how close the query string is to a given data stream that includes document information such as TAUC (title, anchor text, URL, clicks) information, etc. The architecture includes the index-time splitting of compound terms in the URL to allow the more effective discovery of query terms. Additionally, index-time filtering of anchor text is utilized to find the top N anchors of one or more of the document results. The TAUC information can be input to a neural network (e.g., 2-layer) to improve relevance metrics for ranking the search results. | 10-15-2009 |
| 20090319505 | TECHNIQUES FOR EXTRACTING AUTHORSHIP DATES OF DOCUMENTS - Various technologies and techniques are disclosed for calculating authorship dates for a document. A portion of a document to select to look for possible authorship dates is determined. The possible authorship dates are extracted from the portion of the document. A revised authorship date of the document is generated using a neural network. The revised authorship date is returned to an application or process that requested the date. | 12-24-2009 |
| 20090319521 | NAME SEARCH USING A RANKING FUNCTION - An approach is described for performing a name search using a name search operation and a ranking operation. The name search operation may take text as input and apply a fuzzy matching operation and a lookup operation to generate a collection of candidate names with respective probability scores. In other cases, speech or handwriting recognition may generate the collection of candidate names and probability scores. The ranking operation may then rank these candidate names using a ranking function. The ranking function may rank the candidate names based on the probability scores associated with the names and at least one other factor. One such factor may reflect whether information provided by a user matches profile information associated with a candidate name under consideration. Another factor may reflect an extent of a nexus between the user and a person associated with the candidate name. Other types of factors can be used. | 12-24-2009 |
| 20090327266 | Index Optimization for Ranking Using a Linear Model - Technologies are described herein for providing a more efficient approach to ranking search results. One method reduces an amount of ranking data analyzed at query time. In the method, a term is selected, at index time, from a master index. The term corresponds to a number of documents greater than a threshold. A set of documents that includes the term is selected based on the master index. A rank is determined for each document in the set of documents that contains the term. Each document in the set of documents that contains the term is assigned to a high ranking index or a low ranking index based on the simple rank. | 12-31-2009 |
| 20100017403 | SYSTEM AND METHOD FOR SCOPING SEARCHES USING INDEX KEYS - A set of index keys is included in an index search system that are associated with the scope of the search rather than the content of the documents that are the target of the search. These scope related index keys, or scope keys allows the scope of the search to be selected, reducing the number of documents that a search is required to sift through to obtain results. Furthermore, compound scopes are recognized and stored such that an index of complex search scopes is provided to eliminate rehashing of the searches based on these complex search scopes. | 01-21-2010 |
| 20100121838 | INDEX OPTIMIZATION FOR RANKING USING A LINEAR MODEL - Technologies are described herein for providing a more efficient approach to ranking search results. An illustrative technology reduces an amount of ranking data analyzed at query time. In the technology, a term is selected, at index time, from a master index. The term corresponds to a number of documents greater than a threshold. A set of documents that includes the term is selected based on the master index. A rank is determined for each document in the set of documents that contains the term. Each document in the set of documents that contains the term is assigned to a top document list or a bottom document list based on the rank. Predefined values of at least part of the rank are stored in the top document list for documents in the top document list and are not stored in the bottom document list for documents in the bottom document list. | 05-13-2010 |
| 20100169324 | RANKING DOCUMENTS WITH SOCIAL TAGS - Technologies are described herein for ranking documents with social tags. A number ranking feature containing a number of times a document was tagged is received. A textual property ranking feature containing a union of each social tag associated with the document is also received. The number ranking feature is transformed into a static input value. Further, the textual property ranking feature is transformed into a dynamic input value. A document rank for the document is determined by inputting the static input value and/or the dynamic input value into a ranking function. | 07-01-2010 |
| 20100174712 | EXPERTISE RANKING USING SOCIAL DISTANCE - Tools and techniques for expertise ranking using social distance are provided. These tools may receive search queries from users, and extract from these search queries record identifiers associated with the users. In addition, the tools may extract query strings from the search queries. In connection with processing these queries, the tools may identify other users associated with a given user, with some of these other users being first-level colleagues of a given user, and some of these other users being second-level colleagues. The tools may identify documents within a search store that are associated with the other users, and may search these documents for any occurrences of the query string. In turn, results of the search may be ranked based on a social distance between the user and the other users, with the social distance indicating whether the other users are first-level or second-level colleagues of the user. | 07-08-2010 |
| 20100191744 | RANKING FUNCTIONS USING DOCUMENT USAGE STATISTICS - Methods of providing a document relevance score to a document on a network are disclosed. Computer readable medium having stored thereon computer-executable instructions for performing a method of providing a document relevance score to a document on a network are also disclosed. Further, computing systems containing at least one application module, wherein the at least one application module comprises application code for performing methods of providing a document relevance score to a document on a network are disclosed. | 07-29-2010 |
| 20100228711 | Enterprise Search Method and System - A system and method for enterprise search includes one or more computer-readable media storing computer-executable instructions that, when executed on one or more processors that perform acts including extracting one or more of term data, personal data and metadata from one or more predetermined resources; retrieving a set of information derived from the extracted term data, personal data and metadata responsive to a query; and receiving feedback responsive to the set of information, the feedback augmenting at least one of the one or more predetermined resources. | 09-09-2010 |
| 20100268707 | SYSTEM AND METHOD FOR RANKING SEARCH RESULTS USING CLICK DISTANCE - Search results of a search query on a network are ranked according to an additional click distance property associated with each of the documents on the network. The click distance is measurement of the number clicks or user navigations from a page or pages on the network designated as highest authority or root pages on the network. The precision of the results is increased by the addition of the click distance term when the site or intranet where the search query takes place is hierarchically structured. | 10-21-2010 |
| 20110066611 | GENERATING SEARCH RESULT SUMMARIES - Embodiments are configured to provide a summary of information associated with one or more search results. In an embodiment, a system includes a summary generator that can be configured to provide a summary of information including one or more snippets associated with a search term or search terms. The system includes a ranking component that can be used to rank snippets and the ranked snippets can be used when generating a summary that includes one or more ranked snippets. In one embodiment, the system can be configured to include one or more filters that can be used to filter snippets and the filtered snippets can be used when generating a summary. Other embodiments are available. | 03-17-2011 |
| 20110106850 | Relevant Individual Searching Using Managed Property and Ranking Features - Embodiments are configured to provide information relevant to individuals of interest to a searching user. In an embodiment, a method includes identifying relevant individuals of a network using a relevance model that includes the use of a number of managed properties and ranking features to identify relevant individuals of a defined network. The relevance model of one embodiment is defined by a schema that includes a textual matching ranking feature, social distance ranking feature, a levels to top ranking feature, and a proximity ranking feature. | 05-05-2011 |
| 20110125732 | INTERNAL RANKING MODEL REPRESENTATION SCHEMA - A markup language schema utilized to represent internal ranking models. In one implementation, the schema developed utilizes XML (extensible markup language) for internal ranking model representation. Other markups languages can be employed. | 05-26-2011 |
| 20110137893 | CUSTOM RANKING MODEL SCHEMA - A customizable ranking model of a search engine using custom ranking model configuration and parameters of a pre-defined human-readable format. The architecture can employ a markup language schema to represent the custom ranking model. In one implementation, the schema developed utilizes XML (extensible markup language) for representing the custom ranking model. Weights for dynamic and static relevance ingredients can be altered per ranking model and new relevance ingredients can be added. Additionally, features are provided for improving relevance such as adding terms to a thesaurus for synonym expansion, for example, the ability to deal with single terms either as compounds, and/or using custom word breaking rules. | 06-09-2011 |
| 20110145218 | SEARCH SERVICE ADMINISTRATION WEB SERVICE PROTOCOL - The embodiments described herein generally relate to a method and system for enabling a client to configure and control the crawling function available through a crawl configuration Web service. A client is able to configure and control the crawling function by defining the URL space of the crawl. Such space may be defined by configuring the starting point(s) and other properties of the crawl. The client further configures the crawling function by creating and configuring a content source and/or a crawl rule. Further, a client defines authentication information applicable to the crawl to enable the discovery and retrieval of electronic documents requiring authentication and/or authorization information for access thereof. A protocol governs the format, structure and syntax (using a Web Services Description Language schema) of messages for communicating to and from the Web crawler through an application programming interface on a server hosting the crawler application. | 06-16-2011 |
