Abstract: Systems and methods are disclosed for search query language identification. One method comprises generating a seed dictionary comprising a plurality of labeled dictionary terms and receiving a plurality of unlabeled sample query terms. The plurality of unlabeled sample query terms are compared to the plurality of labeled dictionary terms at a first time, and a first set of labeled sample query terms are generated by labeling at least a subset of the plurality of unlabeled sample query terms based on the first comparison. Remaining unlabeled sample query terms are then compared with the first set of labeled sample query terms at a second time, and a second set of labeled sample query terms are generated by labeling the remaining unlabeled sample query terms based on the second comparison. The first and second sets of labeled sample query terms are provided to a machine learning model configured for query language prediction.

Abstract: The present disclosure describes systems and methods for information retrieval. Embodiments of the disclosure provide a retrieval network that leverages external knowledge to provide reformulated search query suggestions, enabling more efficient network searching and information retrieval. For example, a search query from a user (e.g., a query mention of a knowledge graph entity that is included in a search query from a user) may be added to a knowledge graph as a surrogate entity via entity linking. Embedding techniques are then invoked on the updated knowledge graph (e.g., the knowledge graph that includes additional edges between surrogate entities and other entities of the original knowledge graph), and entities neighboring the surrogate entity are retrieved based on the embedding (e.g., based on a computed distance between the surrogate entity and candidate entities in the embedding space). Search results can then be ranked and displayed based on relevance to the neighboring entity.

Abstract: Systems and methods for image retrieval are described. Embodiments of the present disclosure receive a search query from a user; extract an entity and a color phrase describing the entity from the search query; generate an entity color embedding in a color embedding space from the color phrase using a multi-modal color encoder; identify an image in a database based on metadata for the image including an object label corresponding to the extracted entity and an object color embedding in the color embedding space corresponding to the object label; and provide image information for the image to the user based on the metadata.

Abstract: The present disclosure describes systems and methods for information retrieval. Embodiments of the disclosure provide a retrieval network that leverages external knowledge to provide reformulated search query suggestions, enabling more efficient network searching and information retrieval. For example, a search query from a user (e.g., a query mention of a knowledge graph entity that is included in a search query from a user) may be added to a knowledge graph as a surrogate entity via entity linking. Embedding techniques are then invoked on the updated knowledge graph (e.g., the knowledge graph that includes additional edges between surrogate entities and other entities of the original knowledge graph), and entities neighboring the surrogate entity are retrieved based on the embedding (e.g., based on a computed distance between the surrogate entity and candidate entities in the embedding space). Search results can then be ranked and displayed based on relevance to the neighboring entity.

Abstract: Systems and methods are disclosed for search query language identification. One method comprises generating a seed dictionary comprising a plurality of labeled dictionary terms and receiving a plurality of unlabeled sample query terms. The plurality of unlabeled sample query terms are compared to the plurality of labeled dictionary terms at a first time, and a first set of labeled sample query terms are generated by labeling at least a subset of the plurality of unlabeled sample query terms based on the first comparison. Remaining unlabeled sample query terms are then compared with the first set of labeled sample query terms at a second time, and a second set of labeled sample query terms are generated by labeling the remaining unlabeled sample query terms based on the second comparison. The first and second sets of labeled sample query terms are provided to a machine learning model configured for query language prediction.

Abstract: Disclosed are various embodiments for a navigation element. An insertion point is identified in a ranking of search results. A navigation element is included in the search results. A selection of the navigation element modifies a constraint used to generate the search result.

Abstract: Embodiments described herein provide images representing a set of search results based on diversity between results of the search query. Images associated with a set of visually diverse items can be provided to provide a sample of items matching the search query across multiple types of categories. For example, search results can be grouped into types of categories and images from each of the types of categories can be grouped into subsets of visually related images (across one or more different visual attributes). A set of diverse representative images can be selected by taking at least one image from each of the groups of visually related images. The set of representative and diverse images can be displayed to provide an interesting, visually diverse, and aesthetically pleasing set of images to a user.

Abstract: Disclosed are various embodiments for a navigation element. An insertion point is identified in a ranking of search results. A navigation element is included in the search results. A selection of the navigation element modifies a constraint used to generate the search result.

Abstract: Systems and methods are presented for generating snippets from document data within the document and category taxonomies. In some embodiments, the system may receive a document comprising a set of paragraphs and sentences, identify text in the document relating to a set of categories, and score the paragraphs based on a relation between the paragraph and the set of categories to produce a section score. The system determines one or more sentences for inclusion in a snippet based in part on the section score. The system generates a snippet from the sentences determined for inclusion and associates the snippet with the document.

Abstract: A system and method of query expansion are disclosed. A query expansion source, a query expansion candidate, and feature data for the query expansion source and the query expansion candidate are received. The feature data comprises information for a plurality of features. A determination is made as to whether the query expansion candidate qualifies as an expansion of the query expansion source based on an analysis of the information for the plurality of features. The query expansion candidate is assigned as an expanded query of the query expansion source in a query expansion dictionary in response to a determination that the query expansion candidate qualifies as an expansion of the query expansion source.

Abstract: Systems, methods, and computer storage media having computer-executable instructions embodied thereon that facilitate generation of snippets. In embodiments, text features within a keyword-sentence window are identified. The text features are utilized to determine break features that indicate favorability of breaking at a particular location of the keyword-sentence window. The break features are used to recognize features of partial snippets such that a snippet score to indicate the strength of the partial snippet can be calculated. Snippet scores associated with partial snippets are compared to select an optimal snippet, that is, the snippet having the highest snippet score.

Abstract: A system and method of query expansion are disclosed. A query expansion source, a query expansion candidate, and feature data for the query expansion source and the query expansion candidate are received. The feature data comprises information for a plurality of features. A determination is made as to whether the query expansion candidate qualifies as an expansion of the query expansion source based on an analysis of the information for the plurality of features. The query expansion candidate is assigned as an expanded query of the query expansion source in a query expansion dictionary in response to a determination that the query expansion candidate qualifies as an expansion of the query expansion source.

Abstract: Some embodiments of the present invention provide a system that infers activity-related context information from a message. Upon receiving the message, the system looks for activity-related keywords in the message, wherein the activity-related keywords are from a content database. If one or more activity-related keywords are found in the message, the system infers message-related context information from the one or more activity-related keywords. Next, the system uses the message-related context information to facilitate recommending an activity to a user.

Abstract: One embodiment of the present invention provides a system that detects sensitive content in a document. In doing so, the system receives a document, identifies a set of terms in the document that are candidate sensitive terms, and generates a combination of terms based on the identified terms that is associated with a semantic meaning. Next, the system performs searches through a corpus based on the combination of terms and determines hit counts returned for each term in the combination and for the combination. The system then determines whether the combination of terms is sensitive based on the hit count for the combination and the hit counts for the individual terms in the combination, and generates a result that indicates portions of the document which contain sensitive combinations.

Abstract: Systems, methods, and computer storage media having computer-executable instructions embodied thereon that facilitate generation of snippets. In embodiments, text features within a keyword-sentence window are identified. The text features are utilized to determine break features that indicate favorability of breaking at a particular location of the keyword-sentence window. The break features are used to recognize features of partial snippets such that a snippet score to indicate the strength of the partial snippet can be calculated. Snippet scores associated with partial snippets are compared to select an optimal snippet, that is, the snippet having the highest snippet score.

Abstract: One embodiment of the present invention provides a system that detects sensitive content in a document. In doing so, the system receives a document, identifies a set of terms in the document that are candidate sensitive terms, and generates a combination of terms based on the identified terms that is associated with a semantic meaning. Next, the system performs searches through a corpus based on the combination of terms and determines hit counts returned for each term in the combination and for the combination. The system then determines whether the combination of terms is sensitive based on the hit count for the combination and the hit counts for the individual terms in the combination, and generates a result that indicates portions of the document which contain sensitive combinations.

Abstract: A method of automatically generating personalized text for teaching a student to learn to read. Based upon inputs of the students reading ability/level, either from a self assessment or teacher input and input of personal data, the system automatically searches selected libraries and chooses appropriate text and modifies the text for vocabulary and topics of character identification of personal interest to the student. An optional function of previewing by one of the student's teacher, parent or advocate is included. The system generates a local repository of generated text associated with a particular student.

Abstract: One embodiment of the present invention provides a system that recommends activities. During operation, the system receives a piece of content obtained from text or converted to text from speech. The system then analyzes the received content to identify any activity type, indication of willingness to participate in any type of activities, and at least one piece of temporal information, which can be implicitly and/or explicitly stated in the content, and/or one piece of location information associated with the activity type. The system further recommends one or more activities, venues, and/or services that afford or support activities for a user based on the information extracted from the content.

Abstract: Some embodiments of the present invention provide a system that infers activity-related context information from a message. Upon receiving the message, the system looks for activity-related keywords in the message, wherein the activity-related keywords are from a content database. If one or more activity-related keywords are found in the message, the system infers message-related context information from the one or more activity-related keywords. Next, the system uses the message-related context information to facilitate recommending an activity to a user.

Abstract: Techniques are provided for detecting entailment and contradiction. Packed knowledge representations for a premise and conclusion text are determined comprising facts about the relationships between concept and/or context denoting terms. Concept and context alignments are performed based on alignments scores. A union is determined. Terms are marked as to their origin and conclusion text terms replaced with by corresponding terms from the premise text. Subsumption and specificity, instantiability, spatio-temporal and relationship based packed rewrite rules are applied in conjunction with the context denoting facts to remove entailed terms and to mark contradictory facts within the union. Entailment is indicated by a lack of any facts from the packed knowledge representation of the conclusion in the union. Entailment and contradiction markers are then displayed.