Abstract: A method of retrieving content from one or more media content sites may include identifying one or more event features corresponding to an event, automatically generating, by a computing device, a first set of one or more queries based on the identified event features, running, by the computing device, at least a portion of the first set of queries against one or more media content sites to generate a first content dataset comprising one or more media documents that satisfy the queries, creating a query model for each query based on one or more results retrieved for the query in the first content dataset, evaluating each query model against one or more of the identified event features to identify a match, and performing one or more of the following: filtering the queries based on their associated match, and ranking the queries based on their associated match.

Abstract: A method is disclosed for expansion of rare queries to improve advertisement results, including receiving a query from a user by a search engine; determining that the query does not match an entry in an ad query lookup table coupled with the search engine; retrieving one or more expanded queries located within a query feature index whose features relate to one or more features of the received query, wherein the query feature index includes a plurality of queries expanded based on at least corresponding search results; generating, in real time and by the search engine, an ad query including an expanded version of the received query based on features of the retrieved expanded queries; and selecting one or more advertisements based on the generated ad query, wherein the one or more advertisements are displayed to the user in response to the query received from the user.

Abstract: Embodiments of the present invention include methods and systems for domain name system (DNS) pre-caching. A method for DNS pre-caching is provided. The method includes receiving uniform resource locator (URL) hostnames for DNS pre-fetch resolution prior to a user hostname request for any of the URL hostnames. The method also includes making a DNS lookup call for at least one of the URL hostnames that are not cached by a DNS cache prior to the user hostname request. The method further includes discarding at least one IP address provided by a DNS resolver for the URL hostnames, wherein a resolution result for at least one of the URL hostnames is cached in the DNS cache in preparation for the user hostname request. A system for DNS pre-caching is provided. The system includes a renderer, an asynchronous DNS pre-fetcher and a hostname table.

Abstract: A system for generating a query comprises a term unit (1) for extracting a term from at least one input document (51), to obtain an extracted term. A category unit (2) is arranged for associating the extracted term with a category that is semantically related with the extracted term. A query unit (3) is arranged for generating a query in dependence on the extracted term and the category. The query unit (3) comprises an additional term unit (4) for generating at least one additional search term based on the category, and the query unit (3) is arranged for including the additional search term in the query. A submit unit (5) is arranged for submitting the query to at least one search engine (50), to obtain a plurality of found documents.

Abstract: A set of potential search-query terms can be identified based on empirical queries for apps. For each potential search-query term, a subset of documents within a set of documents can be identified based on apps that users were likely to click on or download following entry of a search query with a comparable or same term. One or more other indicator terms can be identified as being related to the potential search-query term based on the one or more second indicator terms being prevalent within the subset of documents. Upon receipt of a subsequent search query, a search can then be performed using both a term within the search query and one or more related other indicator terms.

Abstract: This disclosure describes various processes for collecting information about users from sources other than catalog activity data. This information can be used to generate recommendations for users with activity data deficiencies. Some example sources for this supplemental data include collaborative content sites, such as social networking sites. Social networking sites typically allow users to engage in conversations with other users through text, audio, and/or video. Conversation data collected from these sites or from other sources can be analyzed to infer user interests. A recommendation process (or other application) can use the inferred interests to supplement or take the place of catalog activity data.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for identifying query refinements from sibling queries. In one aspect, a method includes associating each of a plurality of parent queries with a respective group of one or more child queries for the parent query, identifying one or more candidate sibling queries for a particular child query, selecting one or more final sibling queries for the particular child query from the one or more candidate sibling queries, and associating the final sibling queries with the particular child query as query refinements.

Abstract: A system and method for querying heterogeneous data sources is disclosed. In some embodiments, the system comprises a plurality of heterogeneously structured data sources, a plurality of query objects that represent queries to the data sources and that are independent of the structure of the data sources, and a user interface configured to query the plurality of query objects.

Abstract: What is provided is a system, user interface and computer implemented method of building a customized query for a student database. The query is built using filtering criteria and parameters associated thereto, which may be in natural language, yet capable of implementing BOOLEAN or set theory searching functionality without requiring user knowledge of such functionality. Query results may be modified without rebuilding the query, by adding a further filtering criteria and/or parameter, or removing a filter and/or parameter.

Abstract: A recommendation system may use a network of relationships between many different entities to find search results and establish a relevance value for the search results. The relevance value may be calculated by analyzing trust and similarity components of each relationship between the search user and the entity providing the search results. The entities may be, for example, persons associated within express or implied social networks, or corporations or other organizations with a historical or other reputation. The relationships may be created through many different contact mechanisms and may be unidirectional, asymmetric bidirectional, or symmetric bidirectional relationships. The relationships may be different based on topic or other factors.

Abstract: A technique including receiving a search query; identifying a first original query term based on the query; identifying a first expanded query term related to the first original query term; determining a first lexical distance between the first original query term and the first expanded query term; determining a first weight for the first expanded query term based on the determined first lexical distance; identifying a plurality of documents, from among a corpus of documents, as each relevant to the search query, the plurality of documents including a first document identified based on its inclusion of the first expanded query term; ranking the plurality of documents, with the ranking of the first document being based upon the calculated first weight; and generating a response to the search query identifying two or more of the plurality of documents, ordered according to the ranking.

Abstract: A method of incrementally refining queries and updating query result lists without requiring a user to provide an explicit indicator of query submission. In the method, one or more query related character patterns are defined. Entry of query defining characters by a user is monitored to detect entry of a defined query related character pattern. The user is provided with one or more suggested query refinement options and an updated query result list each time a defined query related character pattern is detected. The query related character patterns may be a character pattern that indicates a word has been input by the user.

Abstract: Methods and apparatus are described by which “superphrases” of “seed phrases” representing basic concepts may be identified without having to compare all possible pairs of seed and candidate phrases. According to one class of embodiments, a data structure similar to an inverted index is used for indexing phrases. The elimination of seed and candidate phrase pairs is enabled by building and traversing the index in a particular manner.

Abstract: A content management system detects a change to one part of a document, and to generate a corresponding change in a different part of the same document. Dynamic inclusion rules define conditions that, when satisfied, allow automatically changing a link in a document to a new link when corresponding data in the document is added or changed. If a change corresponds to a defined dynamic inclusion rule, a corresponding query in the rule is evaluated according to the changes in the document. When there is enough information to run the query, the query is automatically executed in a background process. If there is a single link that satisfies the query, the document may be updated with the new link. If multiple links satisfy the query, the top ranked query result may be automatically selected, or the user may select which link should be included in the document.

Abstract: A method of analyzing data is presented. The method includes generating a query based on a topic of interest, expanding search terms of the query, executing the query on one or more data sources, monitoring a specific data source selected from the one or more data sources. The monitoring is performed to monitor for matches to the query.

Abstract: The present invention is a method and system for enhancing the output of standard thesaurus databases. The user requires little knowledge of the meaning of a word for which he is seeking related words. The system requires at least one starter word, and it returns all synonyms regardless of meaning from multiple databases. The synonyms are then arranged in a two dimensional array, and sorted according to frequency. The user then scans the list, starting from the top, and selects one or more entries from the sorted frequency array, and the re-runs. After several cycles of running and selecting new entries, the related words having the highest relevance to the searcher will rise to top of the frequency array. The end result is a group of related words having one or more meanings, and also having a relationship to a single concept being sought by the user.

Abstract: Embodiments of the present invention provide for an end-to-end system and method for identifying custodians, preserving, collecting, processing, reviewing, analyzing, producing, presenting, and dispositioning data responsive to a legal discovery request.

Abstract: A system and method for providing search query refinements are presented. A stored query and a stored document are associated as a logical pairing. A weight is assigned to the logical pairing. The search query is issued and a set of search documents is produced. At least one search document is matched to at least one stored document. The stored query and the assigned weight associated with the matching at least one stored document are retrieved. At least one cluster is formed based on the stored query and the assigned weight associated with the matching at least one stored document. The stored query associated with the matching at least one stored document are scored for the at least one cluster relative to at least one other cluster. At least one such scored search query is suggested as a set of query refinements.

Abstract: A semantic note taking system and method for collecting information, enriching the information, and binding the information to services is provided. User-created notes are enriched with labels, context traits, and relevant data to minimize friction in the note-taking process. In other words, the present invention is directed to collecting unscripted data, adding more meaning and use out of the data, and binding the data to services. Mutable and late-binding to services is also provided to allow private thoughts to be published to a myriad of different applications and services in a manner compatible with how thoughts are processed in the brain. User interfaces and semantic skins are also provided to derive meaning out of notes without requiring a great deal of user input.

Abstract: Cross product/service management of subscriber products/services is provided. When multiple product/services orders or instructions are received for a shared service or resource (e.g., a unified voicemail box/system) from two or more order or instruction entry systems (e.g., wireline and wireless telephone systems), the multiple orders or instructions are passed to a shared product/services provisioning manager for management of the orders or instructions with respect to the shared service or resource. If the orders require a change to the shared service or resource, the orders or instructions are mediated for concurrent or otherwise conflicting requests to the shared service or resource. Mediated requests are formatted for receipt and use by the shared service or resource and are then passed to a network element responsible for the shared service or resource for implementation.

Abstract: A fallback query mechanism that serves as a way to recover from query conditions (or criteria) that break due to excessively large result sets relative to a preset threshold. The fallback query mechanism detects when a query has failed to execute because the query requested more items from the database (or list) than allowed by the threshold, rewrites the query to examine no more than the threshold number of most recently created items that match one of the indexed filter criteria specified in a view, and then applies one or more of the other filter criteria. The mechanism then reruns the query and displays the results to the user.

Abstract: Methods and apparatus, including computer products, for generating a natural language expression in response to a query. A computer-implemented method of generating a natural language expression in response to a query, includes generating a text frame from the query, and processing the text frame in conjunction with a grammar and one or more logic configuration files applied recursively to the text frame to generate the natural language expression from the query, the logic configuration files including functions that can pass arguments.

Abstract: A variety of computer based service that permit users to edit, compose, upload, or otherwise generate content also provide for the integration of sponsored media into presentations along with user-generated content. An exemplary service generates text based on user input, provides tags based on the text to a sponsored media repository, receives a sponsored media data structure in return, and formats sponsored media from the data structure for display to the user.

Abstract: The present disclosure provides example query expansion methods and systems. A query input by a user is received. A normalized query of the query is determined according to the query. The normalized query is used as an expansion term of the query to implement query expansion. For example, session information in a search log of the user is obtained. All queries appearing in a single session are obtained and a number of votes for each query is calculated or counted. A vote similarity between a single query and a target query is determined and a correlation degree between the single query and the target query is determined according to the vote similarity. A normalized query of the target query is determined according to the correlation degree. The present techniques accurately expand queries and reduce query times, thereby improving system response speed and processing efficiency.

Abstract: Methods and systems for providing related web pages are disclosed. One method includes identifying a plurality of web pages, wherein the plurality of web pages each have a relationship with the first file, wherein the world wide web provides a platform for sharing web pages, and wherein each web page includes a document or information resource that is suitable for the world wide web and is accessible through a web browser. The method further includes generating a list of inquiries based on the plurality of web pages, providing, the list of inquiries to at least one author of the first file, receiving from the at least one author at least one response to the list of inquiries, selecting a subset of the plurality of web pages based on the at least one response, and storing information related to the selected subset of the plurality of web pages.

Abstract: A keyword acquiring unit transmits a keyword acquisition request to a first server serving as a keyword providing service, and receives a keyword from the first server. An information acquiring unit transmits an acquisition request of information related to the keyword to a second server serving as an information providing service, and receives the information from the second server. A cover unit presents information acquired by the information acquiring unit to a user. An input unit receives selection of at least one of information presented by the cover unit. A service acquiring unit transmits a search request based on the keyword related to information selected at the input unit to a third server serving as a search service, and acquires a search result from the third server. A socket unit presents the search result to the user.

Abstract: Methods and systems for incrementally selecting and providing relevant search engines in response to a user query. A method of incrementally selecting and providing relevant search engines is based in part on identifying a set of search engines associated with corresponding metadata, receiving a partial search query entered by the user of a device, inferring after each user keypress a set of potential full queries intended by the user, using the potential full queries and the search engine metadata to identify a set of relevant search engines, and for each of these search engines, providing a direct link to launch a relevant query in the search engine. The user input may be either ambiguous, or erroneous, and may be entered using an input-constrained device.

Abstract: A method for processing an inputted XPath query against an inputted XML document is provided. The method generates a summary index, an ancestor-descendant path index, and a value index from one or more inputted XML documents. The summary index and the ancestor-descendant path index and the value index have at least one path defined. XPath queries at articulation points are parsed into multiple partial queries. The cursor type index access methods are determined. Partial queries are executed against the SUM-Index to generate a list of path identifiers (PID) satisfies the partial query segments. A set of ancestor-descendant PID identifiers list is generated to provide a result sequence. The result sequence of nodes is filtered producing one or more outputted XML documents from the final result sequence of nodes. A related system and computer medium is also provided.

Abstract: The invention relates to a system (100) for identifying a certain data-object of a set of data-objects, wherein each data-object of the set of data-objects is described by a plurality of discriminating characteristics, the system comprising: a composition unit (110) for composing a query for identifying the certain data-object; an identification unit (120) for identifying a candidate data-object of the set of data-objects, based on the query; a presentation unit (130) for presenting a description of the candidate data-object to a user; a feedback unit (140) for receiving user feedback on a discriminating characteristic of the plurality of discriminating characteristics, the discriminating characteristic describing the candidate data-object; and an update unit (150) for updating the query for identifying the certain data-object, based on the user feedback on the discriminating characteristic describing the candidate data-object.

Abstract: An information retrieval system uses phrases to index, retrieve, organize and describe documents, analyzing documents and storing the results of the analysis as phrase data. Phrases are identified that predict the presence of other phrases in documents. Documents are the indexed according to their included phrases. Related phrases and phrase extensions are also identified. Changes to existing phrase data about a document collection submitted by a user is captured and analyzed, and the existing phrase data is updated to reflect the additional knowledge gained through the analysis.

Abstract: Dynamic language checking includes identifying questionable language usage; creating a query in dependence upon the questionable language usage; querying a search engine with the query; receiving from the search engine search result statistics describing the search results for the query; and determining, in dependence upon search results statistics returned by the search engine, whether the questionable language usage is proper language usage.

Abstract: A priority hash index provides efficient lookup of posting lists for search query terms. The priority hash index is a data structure in which hash values for terms are distributed across multiple storage devices based on importance of the terms and access speeds of the storage devices. Terms are grouped into search lists with each search list including a storage location on each storage device. When a search query is received, a term is identified and hashed to a location on the first storage device and to generate a unique hash value for the term. The locations on the storage device for the term's search list are sequentially read until the hash value for the term is located to access the posting list for the term.

Abstract: A search and find user interface is provided that is integrated with a data indexing engine to allow efficient and high-speed data search and retrieval across data storage folders associated with a given software module or associated with a number of disparate software modules. An expanded form of the search and find user interface is provided for advanced searching. Where searching is required beyond a present search scope, an automatic “upscoping” mechanism is provided for expanding a search to data storage folders outside a current data storage folder on which an initial search is executed.

Abstract: Application launching on a computer via indexed data. Based on a search term entered by a user, the computer searches an index containing metadata representative of one or more applications installed on the computer. A user interface on the computer's display has a window for displaying the results of searching the index. In addition, the user interface receives user input to select an application from the search results to be initiated. The computer is responsive to the user input via the user interface for initiating the selected application installed on the computer. A computer-readable medium including a persistent component, an index component, a query component, and an execution component embodies further aspects of the invention.

Abstract: A system for guiding a search for information is presented. The system comprises a user interface that accepts a phrase and receives at least one suggestion based at least in part on the phrase. The system also includes a phrase suggestion engine that matches the phrase with the at least one suggestion. Methods of using the system are also provided.

Abstract: A search technology generates recommendations with minimal user data and participation, and provides better interpretation of user data, such as popularity, thus obtaining breadth and quality in recommendations. It is sensitive to the semantic content of natural language terms and lets users briefly describe the intended recipient (i.e., interests, eccentricities, previously successful gifts). Based on that input, the recommendation software system and method determines the meaning of the entered terms and creatively discover connections to gift recommendations from the vast array of possibilities. The user may then make a selection from these recommendations. The search/recommendation engine allows the user to find gifts through connections that are not limited to previously available information on the Internet. Thus, interests can be connected to buying behavior by relating terms to respective items.

Abstract: A network-accessible toolbox permits collaborative annotation, facilitating interaction and communication among users. In an implementation, content on a Web page, or other page or document accessible through a network or the Internet, can be annotated. A user can view the page and with the toolbox, select content on the page and make an annotation or suggestion. Multiple users can view and make annotations to the same page at the same time. After annotations are made, users can view the page with annotations made by other users. The author or owner of the page can accept or reject the annotations or suggestions made to the page. If the owner accepts a particular suggestion, the selected content is replaced with the suggestion.

Abstract: An embodiment includes a computer-implemented method. For one embodiment, the computer-implemented method includes displaying a plurality of first groups of words in a browser for display to a user, constructing a new combination of search terms using more than one user-selected word groups, wherein the user-selected word groups are selected by the user from the plurality of first groups of words displayed to the user; invoking a search service with the new combination of search terms, displaying results of the search service using the new combination of search terms in the browser, and storing the results in memory coupled to a processor.

Abstract: Techniques for integrating triple tags into a tagging tool are described herein. According to one embodiment, tags used to tag document pages and associated with one or more communities are stored in a storage as a triple store, where each tag is stored in a format having a subject, a predicate, and an object fields representing a relationship among each tag, an associated document page, and associated communities. A tag input field is displayed in a sidebar window communicatively coupled to a main window of a browser to allow a user to enter a type of tag and an identifier of the tag in the tag search field, such that the entered tag can be stored within the triple store in view of the tag type and tag identifier. Other methods and apparatuses are also described.

Abstract: Among other disclosures, a method may include collecting historical communication data and personal data relating to a portion of a plurality of communications, a sender of one or more of the communications or one or more recipients of the communications. The method may include depositing the collected data into a repository of historical communication data and personal data. The method may include presenting one or more items in the repository on a mobile device, in response to user behavior.

Abstract: A system and method for serving reliable content in search, the method comprising: receiving at a server computer from a user, a request to search a network for certain information; searching the network for the information requested and obtaining a set of results including user-generated content; searching the user's list of social connections; determining whether any of the search results related to a person in the user's list of social connections/contacts; and providing an indication of greater reliability for the search results that correspond to persons from the user's list of social connections.

Abstract: Methods, systems, and apparatus, including computer program products, for suggesting alternative queries based on original query search results. In one aspect, a method includes receiving search results for a first query, where each search result refers to a respective resource and includes a snippet of content from the respective resource, receiving one or more suggested second queries, for each of the suggested second queries: selecting a set of words in one of the snippets to represent the suggested second query, associating the suggested second query with the set so that a user can interact with a word in the set to invoke the suggested second query, and marking the set so as to indicate that the user can interact with a word in the set to invoke the suggested second query, and transmitting the search results including each marked set to a client device for presentation to the user.

Abstract: A system and method for the matching addresses is provided. Addresses may be received from a search engine or other source for purposes of matching. Address parts in the addresses may be contextually identified. Identified address parts, including their associated data, that have address part types that are alike may be compared to one another and a contextual matching score may be calculated and assigned. A free format token analysis of the addresses may also be performed in parallel with, before, or after, the contextual identification, and a free format matching score may be calculated. An address likeness score may be calculated and assigned based on the contextual matching score and the free format matching score.

Abstract: In accordance with embodiments, there are provided mechanisms and methods for dynamically suggesting answers to questions submitted to a portal of an online service. These mechanisms and methods for dynamically suggesting answers to questions submitted to a portal of an online service can enable embodiments to provide help document suggestions with limited user input. The ability of embodiments to provide help document search term suggestions with limited user input can enable users to quickly and efficiently find useful help documents.

Abstract: Embodiments of the present disclosure provide a unique and novel archiving system that includes two or more network storage systems, each network storage system including removable hard disk drives embedded in removable disk cartridges, referred to simply as removable disk drives. The removable disk drives allow for expandability and replacement such that the archiving system need not be duplicated to add new or more storage capacity. In embodiments, the archiving system accesses, writes, reads, or performs functions on data from one network storage system to another remote network storage system.

Abstract: An alteration candidate for a query can be scored. The scoring may include computing one or more query-dependent feature scores and/or one or more intra-candidate dependent feature scores. The computation of the query-dependent feature score(s) can be based on dependencies to multiple query terms from each of one or more alteration terms (i.e., for each of the one or more alteration terms, there can be dependencies to multiple query terms that form at least a portion of the basis for the query-dependent feature score(s)). The computation of the intra-candidate dependent feature score(s) can be based on dependencies between different terms in the alteration candidate. A candidate score can be computed using the query dependent feature score(s) and/or the intra-candidate dependent feature score(s). Additionally, the candidate score can be used in determining whether to select the candidate to expand the query. If selected, the candidate can be used to expand the query.

Abstract: Disclosed are various embodiments of systems and methods for generating composite mediasets from mediasets, each comprising media items, associated with a plurality of users. In some embodiments, individual and/or group recommendations are provided for creating a group playlist by aggregating user taste data for a plurality of users in a group. In other embodiments, systems and methods are provided which allow for sharing and playing of a group playlist by users in a group, each of which has a media playback device. Each media item, such as a song, is played from one of the individual user devices for the benefit of all users in the vicinity at the time. Music thus can be “shared” without transferring files potentially in violation of copyrights.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for presenting spelling suggestions. In one aspect, a method includes receiving first search results for a first search query and a plurality of spelling suggestions for a first term in the first search query, wherein the first search results are provided by a search engine as a response to the first search query; displaying the plurality of spelling suggestions and the first search results in a user interface; receiving a user input selecting one of the plurality of spelling suggestions; transmitting data identifying the selected spelling suggestion to request second search results for a second search query comprising the selected spelling suggestion from the search engine; and displaying the second search results in place of the first search results in the user interface.

Abstract: Presenting one or more suggested search-engine queries based on an initial search-engine query is described herein. Once the initial query is received, a search engine determines whether any web content is relevant thereto. If not, a query-suggestion service determines whether any suggested queries can be substituted for the initial query. If not, the query is spell-corrected, if necessary, and parsed into individual terms. Each parsed term is then checked to see whether it can be associated with alternative search terms. Terms than can are combined and their combination is also checked for alternative search terms. All of the alternative search terms are scored and then assembled into a list of suggested search terms that is presented to the user.

Abstract: A method includes analyzing a plurality of electronic documents available via a network service, selecting content of the documents encountered during the analysis to generate signatures for the documents based on the content of the documents, generating an index comprising the signatures, and updating the index by performing additional analysis. The index is updated to include documents having the same signatures.