A search term used in an online search is analyzed to determine a concept corresponding to the search term, the concept being present in an ontology related to a subject-matter domain of the search term. A set of concepts is selected from the ontology, including a related concept related to the concept in the organization of the ontology. A set of subscriber data sources is determined where a subscriber data source in the set subscribes to a concept in the set of concepts. From the set of subscriber data sources, a subset of those subscriber data sources is identified whose data is not participating in a result set corresponding to the search term. A non-participation message is sent to a subscriber data source in the subset of subscriber data sources.

Technologies are described herein for executing queries expressed with reference to a structured query language against unstructured data. A user issues a structured query through a traditional structured data management (“SDM”) application. Upon receiving the structured query, an SDM driver analyzes the structured query and extracts a data structure from the unstructured data, if necessary. The structured query is then converted to an unstructured query based on the extracted data structure. The converted unstructured query may then be executed against the unstructured data. Results from the query are reorganized into structured data utilizing the extracted data structure and are then presented to the user through the SDM application.

The present teaching relates to method and system for assessing semantic distance. A query is received and processed, by a document representation constructor, to obtain a first query representation. The query is then processed by a query representation constructor to obtain a second query representation. Based on the first and second query representations, a dynamic norm is determined. Based on the second query representation, a plurality of documents are identified as being related to the query and a semantic distance between the query and the plurality of documents is determined based on the dynamic norm.

A computer system processes a document. A user viewing a displayed text is monitored and it is determined that the user is experiencing difficulty understanding a query phrase in a displayed text, wherein the displayed text is translated from a first language to a second language. One or more alternative phrases are generated for the query phrase by determining a plurality of candidate phrases based on the context of the query phrase and a tone of the displayed text, scoring each of the plurality of candidate phrases, and selecting a candidate phrase to be the alternative phrase based on the score of the candidate phrase. The one or more alternative phrases are presented to the user. Embodiments of the present invention further include a method and program product for processing a document in substantially the same manner described above.

Systems, methods, and computer-readable media for fuzzy-searches on encrypted messages include maintaining, in an indexer, a dictionary of words appearing in a message history. Upon receiving a query including at least one search term, a fuzzy search of the dictionary using the at least one search term is performed to determine one or more fuzzy-matching words in the dictionary, and one or more search tokens are generated from the one or more fuzzy-matching words, the one or more search tokens including encrypted versions of the one or more fuzzy-matching words. The one or more search tokens are provided to a search service for searching a database of encrypted messages of the message history, where the at least one search term may not have an exact match with any of the words in the dictionary.

A method includes receiving a plurality of product query arrays each including a plurality of individual product queries received during a single user search session. The method further includes inputting the plurality of product query arrays into the query rewrite model. Text of each of the plurality of individual product queries in each product query array is treated as a whole token. The method further includes receiving a product query from a user electronic device. The method further includes determining a query rewrite for the product query using the query rewrite model and determining search results for the product query using the query rewrite. The method further includes sending information for presenting the search results on a display of the user electronic device responsive to the product query.

A method executes at a computer system to retrieve data from a database. Upon receiving a database query, the computer system translates the query into an intermediate representation, and estimates a compilation time to compile the intermediate representation into machine executable code. The query execution time to retrieve a result set is also estimated. In accordance with a determination that the query execution time and compilation time satisfy an interpretation criterion, the computer system invokes a byte code interpreter to interpret the intermediate representation and retrieve the result set from the database. In accordance with a determination that the query execution and compilation times satisfy one of a plurality of compilation criteria, the computer system compiles the intermediate representation to form machine code and executes the machine code to retrieve the result set from the database. In some cases, the query intermediate representation is optimized prior to compilation.

Managing answers in a question-answering environment is disclosed. Managing answers in the question-answering environment can include sorting, based on a set of answer categories for a subject matter, a first set of answers into a first answer category and a second set of answers into a second answer category. Managing answers in the question-answering environment can include determining, using the subject matter, a first category sequence including the first answer category and the second answer category, and establishing, based on the first category sequence, a first answer sequence established from a portion of the first set of answers from the first answer category and a portion of the second set of answers from the second answer category.

In various embodiments, a natural language (NL) application implements functionality that enables users to more effectively access various data storage systems based on NL requests. As described, the operations of the NL application are guided by, at least in part, on one or more templates and/or machine-learning models. Advantageously, the templates and/or machine-learning models provide a flexible framework that may be readily tailored to reduce the amount of time and user effort associated with processing NL requests and to increase the overall accuracy of NL application implementations.

Managing answers in a question-answering environment is disclosed. Managing answers in the question-answering environment can include sorting, based on a set of answer categories for a subject matter, a first set of answers into a first answer category and a second set of answers into a second answer category. Managing answers in the question-answering environment can include determining, using the subject matter, a first category sequence including the first answer category and the second answer category, and establishing, based on the first category sequence, a first answer sequence established from a portion of the first set of answers from the first answer category and a portion of the second set of answers from the second answer category.