Examples associated with reading difficulty level based resource recommendation are disclosed. One example may involve instructions stored on a computer readable medium. The instructions, when executed on a computer, may cause the computer to obtain a set of candidate resources related to a source document. The candidate resources may be obtained based on content extracted from the source document. The instructions may also cause the computer to identify reading difficulty levels of members of the set of candidate resources. The instructions may also cause the computer to recommend a selected candidate resource to a user. The selected candidate resource may be recommended based on subject matter similarity between the selected candidate resource and the source document. The selected candidate resource may also be recommended based on reading difficulty level similarity between the selected candidate resource and the source document.

Embodiments of the present invention provide a means for validating electronic forms using one or more semantic databases. The invention includes processing an electronic form into individual elements and generating entities for the individual elements. The closest matching ontology is found for each entity and the pairings are grouped into a general formal ontology tree. The entities in the general formal ontology tree are traversed using generated rules. This analysis yields validation results that are combined with the original form to create an annotated form.

Presented are relation inference methods and systems that use deep learning techniques for data mining documents to discover a relation between terms of interest in a given field covering a specific topic. For example, in the healthcare domain, various embodiments of the present disclosure provide for a relation inference system that mines large-scale medical documents in a free-text database to extract symptom and disease terms and generates relation information that aids in disease diagnosis. In embodiments, this is accomplished by training and using an RNN, such as an LSTM, a Gated Recurrent Unit (GRU), etc., that takes advantage of a term dictionary to examine co-occurrences of terms of interest within documents to discover correlations between the terms. The correlation may then be used to predict statistically most probable terms (e.g., a disease) related to a given search term (e.g., a symptom).

The present disclosure relates to methods and systems for querying data in a data repository. According to a first aspect, this disclosure describes a method of querying a database, comprising: receiving, at a computing device, a plurality of keywords; determining, by the computer device, a plurality of datasets relating to the keywords; identifying, by the computer device, metadata for the plurality of datasets indicating a relationship between the datasets by examining an ontology associated with the datasets; providing, by the computer device, one or more suggested database queries in natural language form, the one or more suggested database queries constructed based on the plurality of keywords and the metadata; receiving, by the computing device, a selection of the one or more suggested database queries; and constructing, by the computer device, an object view for the plurality of datasets based on the selected query and the metadata.

A method for suggesting revisions to a document-under-analysis from a seed database, the seed database including a plurality of original texts each respectively associated with one of a plurality of final texts, the method for suggesting revisions including selecting a statement-under-analysis (“SUA”), selecting a first original text of the plurality of original texts, determining a first edit-type classification of the first original text with respect to its associated final text, generating a first similarity score for the first original text based on the first edit-type classification, the first similarity score representing a degree of similarity between the SUA and the first original text, selecting a second original text of the plurality of original texts, determining a second edit-type classification of the second original text with respect to its associated final text, generating a second similarity score for the second original text based on the second edit-type classification, the second similarity score representing a degree of similarity between the SUA and the second original text, selecting a candidate original text from one of the first original text and the second original text, and creating an edited SUA (“ESUA”) by modifying a copy of the first SUA consistent with a first candidate final text associated with the first candidate original text.

A method for suggesting revisions to a document-under-analysis from a seed database, the seed database including a plurality of original texts each respectively associated with one of a plurality of final texts, the method for suggesting revisions including selecting a statement-under-analysis (“SUA”), selecting a first original text of the plurality of original texts, determining a first edit-type classification of the first original text with respect to its associated final text, generating a first similarity score for the first original text based on the first edit-type classification, the first similarity score representing a degree of similarity between the SUA and the first original text, selecting a second original text of the plurality of original texts, determining a second edit-type classification of the second original text with respect to its associated final text, generating a second similarity score for the second original text based on the second edit-type classification, the second similarity score representing a degree of similarity between the SUA and the second original text, selecting a candidate original text from one of the first original text and the second original text, and creating an edited SUA (“ESUA”) by modifying a copy of the first SUA consistent with a first candidate final text associated with the first candidate original text.

Examples of the present disclosure describe systems and methods for ontology-based graph query optimization. In an example, ontology data relating to a graph or isolated collection may be collected. The ontology data may comprise uniqueness and topology information and may be used to reformulate a query in order to yield a query that is more performant than the original query when retrieving target information from a graph. In an example, reformulating a query may comprise reordering one or more parameters of the query relating to resources, relationships, and/or properties based on uniqueness information. In another example, the query may be reformulated by modifying the resource type to which the query is anchored based on the topology information. The reformulated query may then be executed to identify target information in the isolated collection, thereby identifying the same target information as the original query, but in a manner that is more performant.

One embodiment provides a method for generating a digital standard utilizing a trained machine-learning model, the method including: receiving an underlying standard; extracting conceptual units from the underlying standard; classifying, using at least one trained machine-learning model, at least a portion of the extracted conceptual units into one of a plurality of classification groups; storing the classified extracted conceptual units into a data repository as defined by the schema; displaying, within a user interface on a display of an information handling device, a digital standard in a format based upon the schema; and providing, within the user interface, search and filter functions allowing for finding information related to the digital standard. Other aspects are described and claimed.

In some embodiments, the present disclosure provides for an exemplary computer-implemented system that may include a longitudinal data engine, including: a processor and specialized index generation software to generate: an index data structure for a respective event type associated with each respective subject or object; where each respective index data structure is a respective event type-specific data schema, defining how to store events of a particular event type to form longitudinal data of each respective subject or object; an ontology data structure that is configured to describe one or more properties of a respective event of a respective subject or object; and longitudinal data extraction software to extract a respective longitudinal data for a plurality of index data structures and a plurality of ontology data structures associated with a plurality of subjects or objects.

An apparatus and computer implemented method that include obtaining, into a computer, text of a patent, automatically finding and extracting, using the computer, a set of claim text from the patent text, identifying, using the computer, text of independent claims from the set of claim text, displaying in a first row on a computer monitor the text of the independent claims, automatically determining a plurality of preliminary scope-concept phrases from the text of the independent claims, displaying in a second row on the computer monitor the text of the plurality of preliminary scope-concept phrases, eliciting and receiving user input to specify a first one of the plurality of preliminary scope-concepts phrases, and highlighting each occurrence of the specified first one of the plurality of preliminary scope-concept phrases in a plurality of the independent claims displayed in the first row. A scope concept builder tool is also provided.