Data analytics systems and methods are disclosed herein. A parser can parse reference data from various data sources to store in a data structure. An uploader can receive study data designated by a researcher and store the study data in the data structure. A matcher can compare analyte nameset data in the study data with analyte nameset data from the reference data to generate one or more links each correlating an instance of an analyte in the study data with an instance of that analyte in the reference data. Library overlays each include one or more modules to access reference data to generate organized associations of reference data. A calculation engine can receive a selection of one or more library overlay(s) and manipulate the reference data and study data according to the organized associations of the selected library overlay(s) to generate configured data stored in a collection of data caches for presentation to a researcher via a user interface.

Highly accurate document search, especially intellectual property-related document search, is achieved with a simple input method. A processing portion has a function of generating text analysis data from text data input to an input portion; a function of extracting a search word from words included in the text analysis data; and a function of generating first search data from the search word on the basis of weight dictionary data and thesaurus data. A memory portion stores second search data generated when the first search data is modified by a user. The processing portion updates the thesaurus data in accordance with the second search data.

An information processing method for a computer to execute a process includes extracting, from a first document, a word not included in a second document; registering the word in a first dictionary; acquiring an intermediate representation vector by inputting a word included in the second document to a recursion-type encoder; acquiring a first probability distribution based on a result of inputting the intermediate representation vector to a recursion-type decoder that calculates a probability distribution of each word registered in the first dictionary; acquiring a second probability distribution of a second dictionary of a word included in the second document based on a hidden state vector calculated by inputting each word included in the second document to the recursion-type encoder and a hidden state vector output from the recursion-type decoder; and generating word included in the first document based on the first probability distribution and the second probability distribution.

The present disclosure discloses a method for generating a question answering robot, relates to the field of robotics. The specific implementation includes: obtaining field information input by a user, obtaining a field-specific robot from a robot library based on the field information; obtaining a template list corresponding to the field-specific robot, providing the template list to the user, the template list including a plurality of templates; receiving the plurality of templates filled in by the user, the templates filled in by the user including at least one question and an answer corresponding to the at least one question; expanding the at least one question filled in by the user based on a question semantic database to form a combination of questions corresponding to the answer, the answer and the combination of questions forming a question-answer pair; and generating a question answering robot based on the question-answer pair.

The present invention aims to provide an identification assistance system, an identification assistance client, and an identification assistance method that enable the user to identify drugs accurately and easily. In the identification assistance system according to an aspect of the present invention, first text which is the result of voice recognition is corrected, and thus errors of the voice recognition can be corrected. In addition, the first text is corrected with reference to a drug search dictionary having learned expressions used for drug identification, and thus expressions unique to drug identification can be taken into consideration. The user can perform a search not only by using the code and/or the name of the drug but also by speaking aloud the external appearance information on the drug. Thus, even if the code and the name are unknown, the user can perform a search by using the external appearance information.

Embodiments of the present disclosure disclose a method and apparatus for processing a weather alert text, an electronic device, a computer readable storage medium, and a computer program product, relate to the field of artificial intelligence technology such as natural language processing, cloud services, and computer vision. An implementation of the method includes: acquiring a to-be-processed weather alert text; extracting actual weather alert elements from the to-be-processed weather alert text using preset element matching templates, the element matching templates being obtained by clustering from contexts of a sample weather alert elements; and performing normalization processing on the actual weather alert elements, and combining obtained normalized alert elements in a preset order to obtain a key weather alert text. The application of this implementation may improve an accuracy of extracting weather alert elements and a generalization processing capability for various to-be-processed weather alert texts.

A similarity degree computation unit (211) computes a similarity degree between each of one or more partial ontologies in a first-system-oriented ontology and a benchmark ontology of a second system, as a similarity degree of each of the partial ontologies. A candidate extraction unit (212) extracts as an ontology candidate from the first-system-oriented ontology, a set of: each of partial ontologies having similarity degrees which satisfy a similarity degree condition; and a partial ontology for linking to each other the partial ontologies having the similarity degrees which satisfy the similarity degree condition. An ontology output unit (214) outputs, when the ontology candidate satisfies a constraint condition, the ontology candidate as a second-system-oriented ontology.

The present disclosure discloses a word library management method and an apparatus for an input method including: firstly parsing information about answers to examination questions to form a masked entry library, and according to the masked entry library, performing operations on word libraries of an input method installed on a terminal device, the operations including transversing information about entries in each word library of the input method, and deleting entries that need to be masked, so that a normal examination or test can be carried out on a common terminal device without the need of preparing a dedicated terminal device or using a dedicated input method, which can prevent the result of the examination or test from being affected due to the word libraries and will neither affect the input of other characters during the examination nor affect the normal use of the terminal device and the input method.

A method and a system for structured searches of information via key-objects are disclosed herein. Key-objects may be used to describe certain features or parameters of content within webpages in a structured fashion, may be linked or embedded into respective webpages, and may be subsequently collected and stored by search engines enabling the structured searches. A thesaurus of key-objects may be updated with new key-objects discovered by search engines. Methods described herein may be used for structured searches of merchandise or services in e-commerce or mobile e-commerce thereby facilitating the location and comparison of merchandise by product specifications in lieu of keywords needed to get to the product specifications. In all, the elimination of voluminous and largely irrelevant outputs is realized, whereby users receive precise, streamlined, or exceedingly relevant responses at will, and can control or manipulate the order of the structured search outputs according to their specific information needs.

Systems, methods, and computer-readable media are disclosed for list attribute normalization and standardization for creation of a controlled vocabulary. A vocabulary set comprising a plurality of vocabulary term may be received. For each vocabulary term, semantic duplicates may be identified. The semantic duplicates may be identified by analyzing semantics, syntactics, or phonetics of the vocabulary terms. Semantic chains may be formed from each vocabulary term and the corresponding semantic duplicates. The terms in each semantic chain may be ranked to determine a most probable vocabulary term. The most probable vocabulary term may then replace the semantic chain. The most probable vocabulary term across all semantic chains from the vocabulary set may form the controlled vocabulary.