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.

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.

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.

A POI popularity derivation device (10) includes: a dictionary generation unit (11) that assigns a feature word used as a co-occurrence word of a POI name to each popularity-assigned POI name serving as a popularity assignment target to generate a popularity-assigned POI dictionary in which a popularity-assigned POI name and a feature word are associated with each other; an extraction unit (12) that extracts posted data serving as a search target from posted data on the basis of predetermined criteria; and a popularity derivation unit (18) that searches for the posted data on the basis of a predetermined rule regarding feature words while referring to the popularity-assigned POI dictionary, to extract posted data linked to the popularity-assigned POI name, and derives the popularity of each popularity-assigned POI name on the basis of the number of pieces of extracted posted data for each popularity-assigned POI name.

A method for outputting a search result includes: executing a reception process that includes receiving a search query for target data; executing a candidate item identification process that includes referring to index information associating each of a plurality of items included in the target data with a position of a corresponding one of the items, and identifying a first storage area configured to store an item corresponding to a keyword included in the search query; and executing an addition process that includes when a description included in the corresponding one of the items includes a reference to a different item, referring to the index information, and adding information on a second storage area configured to store the different item to the reference to the different item.

An objective of the present disclosure is to allow a situation in a conversation of a user to be recognized as a context and allow an item appropriate for the situation to be presented. An information recommendation device according to the present disclosure includes a context extraction module 24 that extracts, from the conversation of the user, a keyword representing a topic, a similarity determination module 31 that refers to a knowledge base 13 storing recommended items linked to communication contexts each including the keyword to extract the recommended items and the communication contexts that are linked to the extracted keyword and selects, from among the extracted communication contexts, the communication context similar to the topic, and an information search module 32 that acquires, from the knowledge base 13, the recommended item linked to the selected communication context.

The subject matter of this specification generally relates to preventing the distribution of forbidden network content. In one aspect, a system includes a front-end server that receives content for distribution over a data communication network. The back-end server identifies, in the query log, a set of received queries for which a given forbidden term was used to identify a search result in response to the received query even though the given forbidden term was not included in queries included in the set of received queries. The back-end server classifies, as variants of the given forbidden term, a term from one or more queries in the set of received queries that caused a search engine to use the given forbidden term to identify one or more search results in response to the one or more queries and prevents distribution of content that includes a variant.

A similarity calculation apparatus according to the present invention includes: a name acquisition unit configured to acquire a first group name to which each word belonging to a first synonym group belongs and a second group name to which each word belonging to a second synonym group belongs; a name set generation unit configured to generate a first group name set and a second group name set; and a similarity calculation unit configured to calculate similarity between the first group name set and the second group name set. Therefore, even when a plurality of synonym groups are created, terms can be effectively unified.

The subject matter of this specification generally relates to preventing the distribution of forbidden network content. In one aspect, a system includes a front-end server that receives content for distribution over a data communication network. The back-end server identifies, in the query log, a set of received queries for which a given forbidden term was used to identify a search result in response to the received query even though the given forbidden term was not included in queries included in the set of received queries. The back-end server classifies, as variants of the given forbidden term, a term from one or more queries in the set of received queries that caused a search engine to use the given forbidden term to identify one or more search results in response to the one or more queries and prevents distribution of content that includes a variant.

Implementations include providing a first set of tags by processing a document using generic entity extraction based on one or more external taxonomies, providing a second set of tags by processing the electronic document using specific entity extraction based on internal taxonomies specific to the enterprise, determining a relevance score for each tag in the first set of tags, and the second set of tags, defining a set of tags including one or more tags of the first set of tags, and one or more tags of the second set of tags, tags of the set of tags being in rank order based on respective relevance scores, receiving user input to the set of tags, and performing one or more of adjusting a ranking of tags based on the user input, and editing at least one internal taxonomy of the one or more internal taxonomies based on the user feedback.