Abstract: A computer-implemented method according to one embodiment includes identifying a textual document, determining a chemical reaction within the textual document, extracting a plurality of chemical terms from the chemical reaction, creating an annotation for the chemical reaction, utilizing the plurality of chemical terms, and storing a representation of the annotation for the chemical reaction.

Abstract: In one general embodiment, a computer program product for altering input search terms comprises a computer readable storage medium having program instructions embodied therewith, wherein the computer readable storage medium is not a transitory signal per se, and where the program instructions are executable by a processor to cause the processor to perform a method comprising identifying an input search term, utilizing the processor, determining, utilizing the processor, an additional term associated with the input search term, where the additional term targets a predetermined entity, altering, utilizing the processor, the input search term utilizing the determined additional term, and performing, utilizing the processor, a search, utilizing the altered input search term.

Abstract: A computer-implemented method according to one embodiment includes receiving a search query; determining a first set of categories associated with the search query, including performing a reverse lookup for the search query using a dynamic inference map in order to determine the first set of categories, where each category of the first set of categories includes one or more words that describe one or more aspects of the search query; determining a second set of categories associated with preliminary results of the search query; and filtering the preliminary results of the search query, including removing a subset of the preliminary results of the search query based on a comparison of the first set of categories to the second set of categories.

Abstract: A computer-implemented method according to one embodiment includes identifying a textual document, determining chemical data within the textual document, performing an analysis of the chemical data to identify a chemical pathway, and calculating a probability score for the chemical pathway.

Abstract: In one general embodiment, a computer-implemented method includes identifying an input search term, determining an additional term associated with the input search term, where the additional term targets a predetermined entity, altering the input search term utilizing the determined additional term, and performing a search, utilizing the altered input search term.

Abstract: A computer-implemented method according to one embodiment includes identifying a textual document, determining chemical data within the textual document, performing an analysis of the chemical data, and determining whether the chemical data is associated with one or more dangerous characteristics, in response to the analysis.

Abstract: According to one embodiment, a computer program product for performing chemical textual analysis to discover dangerous chemical pathways includes a computer readable storage medium having program instructions embodied therewith, wherein the computer readable storage medium is not a transitory signal per se, and where the program instructions are executable by a processor to cause the processor to perform a method comprising identifying a textual document, utilizing the processor, determining, utilizing the processor, chemical data within the textual document, performing an analysis of the chemical data, utilizing the processor, and determining whether the chemical data is associated with one or more dangerous characteristics, in response to the analysis.

Abstract: A computer-implemented method according to one embodiment includes identifying a textual document, determining chemical data within the textual document, performing an analysis of the chemical data, and determining whether the chemical data is associated with one or more dangerous characteristics, in response to the analysis.

Abstract: A computer-implemented method according to one embodiment includes identifying a textual document, determining chemical data within the textual document, performing an analysis of the chemical data to identify a chemical pathway, and calculating a probability score for the chemical pathway, including predicting an outcome of a chemical reaction, utilizing the chemical data.

Abstract: According to one embodiment, a computer program product for performing chemical textual analysis comprises a computer readable storage medium having program instructions embodied therewith, wherein the computer readable storage medium is not a transitory signal per se, and where the program instructions are executable by a processor to cause the processor to perform a method comprising identifying a textual document, utilizing the processor, determining chemical data within the textual document, utilizing the processor, performing an analysis of the chemical data to identify a chemical pathway, utilizing the processor, and calculating a probability score for the chemical pathway, utilizing the processor.

Abstract: A computer-implemented method according to one embodiment includes receiving a search query; determining a first set of categories associated with the search query, including performing a reverse lookup for the search query using a dynamic inference map in order to determine the first set of categories, where each category of the first set of categories includes one or more words that describe one or more aspects of the search query; determining a second set of categories associated with preliminary results of the search query; and filtering the preliminary results of the search query, including removing a subset of the preliminary results of the search query based on a comparison of the first set of categories to the second set of categories.

Abstract: A computer-implemented method according to one embodiment includes identifying a search query, determining a first set of categories associated with the search query, determining a second set of categories associated with preliminary results of the search query, and filtering the preliminary results of the search query based on an analysis utilizing the first set of categories and the second set of categories.

Abstract: A training query generation system is usable to generate fully formed training questions from prior search queries, some of which may be fully formed search queries and some of which are not fully formed. The system may identify fully formed questions from a query database stored on a storage device. The query database includes a plurality of search query character string, The system further identifies partially formed questions from the query database, creates question templates from the identified fully formed questions, and stores the question templates in a template database. The system then identifies entities with the partially formed questions, classifies each entity, and stores the classified entities in an entity database. Fully formed questions can then be generated using the question templates from the template database and classified entities from the entity database.

Abstract: Embodiments provide a computer implemented method, in a data processing system comprising a processor and a memory comprising instructions which are executed by the processor to cause the processor to implement a full question generation system, the method comprising ingesting a query dataset derived from one or more search queries entered by one or more users of an internet search engine; identifying questions from the ingested query dataset; separating one or more prior full questions from the ingested dataset; identifying one or more question intent queries from the query dataset; for each identified question intent query; sorting the question intent query into one or more bins based on one or more missing interrogative words; and appending the missing interrogative word and a verb onto the question intent query to generate a full question. The full question generation method can additionally generate un-canonical questions.

Abstract: Embodiments provide a computer implemented method, in a data processing system comprising a processor and a memory comprising instructions which are executed by the processor to cause the processor to implement a full question generation system, the method comprising ingesting, into the full question generation system, a query dataset derived from one or more search queries entered by one or more users of an internet search engine; identifying questions from the ingested query dataset; separating, through a full question identification module, one or more prior full questions from the ingested dataset; identifying, through a question intent query identification module, one or more question intent queries from the query dataset; for each identified question intent query: sorting, through a sorting module, the question intent query into one or more bins based on one or more missing interrogative words; and appending, through an appending module, the missing interrogative word and a verb onto the question intent

Abstract: Embodiments provide a system and method for semantic distance calculation. The method can involve receiving a plurality of documents having a set of subjects extracted through the use of latent dirichlet allocation; for each document in the plurality of documents, generating a classification list comprising a ranking of the one or more subjects based on the relevance of each subject to the document; for each classification list, calculating the semantic distance between each subject present on the classification list; aggregating the plurality of classification lists; and creating a distance matrix containing the relative semantic distances between each member of the set of subjects.

Abstract: Embodiments provide a system and method for semantic distance calculation. The method can involve ingesting a plurality of documents; extracting a set of subjects from the plurality of documents using latent dirichlet allocation; for each document in the plurality of documents, generating a classification list comprising a ranking of the one or more subjects based on the relevance of each subject to the document; for each classification list, calculating the semantic distance between each subject present on the classification list; aggregating the plurality of classification lists; and creating a distance matrix containing the relative semantic distances between each member of the set of subjects.

Abstract: A training query generation system is usable to generate fully formed training questions from prior search queries, some of which may be fully formed search queries and some of which are not fully formed. The system may identify fully formed questions from a query database stored on a storage device. The query database includes a plurality of search query character string, The system further identifies partially formed questions from the query database, creates question templates from the identified fully formed questions, and stores the question templates in a template database. The system then identifies entities with the partially formed questions, classifies each entity, and stores the classified entities in an entity database. Fully formed questions can then be generated using the question templates from the template database and classified entities from the entity database.

Abstract: A training query generation system is usable to generate fully formed training questions from prior search queries, The system may include a training dataset generation service that is configured to receive a message containing an indicator of a topic over a network, access a template database containing a plurality of question templates and associated topic indicators, each question template including one or more argument values indicative of a role, and select those question templates from the template database that match the received topic indicator. The training dataset generation service also is configured to select entities from an entity database that map to the argument values of the selected question templates and generate a plurality of fully formed questions, each generated fully formed question comprising a character string containing the question template and at least one of the selected agents.

Abstract: Embodiments provide a computer implemented method, in a data processing system comprising a processor and a memory comprising instructions which are executed by the processor to cause the processor to implement a full question generation system, the method comprising ingesting, into the full question generation system, a query dataset derived from one or more search queries entered by one or more users of an internet search engine; identifying questions from the ingested query dataset; separating, through a full question identification module, one or more prior full questions from the ingested dataset; identifying, through a question intent query identification module, one or more question intent queries from the query dataset; for each identified question intent query: sorting, through a sorting module, the question intent query into one or more bins based on one or more missing interrogative words; and appending, through an appending module, the missing interrogative word and a verb onto the question intent