Abstract: Embodiments relate to generating a retrieval condition for retrieving a target character string from texts by pattern matching. An aspect includes dividing a first text into words. Another aspect includes generating a converted character string by performing at least one of appending at least one character in at least either one of previous and subsequent positions of the target character string. Another aspect includes replacing at least one character of the target character string. Another aspect includes generating the retrieval condition for retrieval candidates in the words of the first text, the retrieval condition comprising determining that a retrieval candidate matches the target character string and does not match the converted character string based on a ratio of a part of the retrieval candidate which matches the converted character string and corresponds to the target character string is less than or equal to a reference frequency.

Abstract: Embodiments relate to generating a retrieval condition for retrieving a target character string from texts by pattern matching. An aspect includes dividing a first text into words. Another aspect includes generating a converted character string by performing at least one of appending at least one character in at least either one of previous and subsequent positions of the target character string. Another aspect includes replacing at least one character of the target character string. Another aspect includes generating the retrieval condition for retrieval candidates in the words of the first text, the retrieval condition comprising determining that a retrieval candidate matches the target character string and does not match the converted character string based on a ratio of a part of the retrieval candidate which matches the converted character string and corresponds to the target character string is less than or equal to a reference frequency.

Abstract: A keyword to be categorized is received. A category dictionary including categories having associated registered keywords, and a text corpus are received. Registered keywords are identified in the category dictionary having a degree of similarity to the keyword to be categorized that is equal to or greater than a predetermined value, and the categories associated with the identified registered keywords are extracted. Registered keywords are identified that are co-occurring in the text corpus with the keyword to be categorized, and the categories associated with the identified co-occurring registered keywords are extracted. A degree of importance is determined for each extracted category based on a function of the identified registered keywords in the category dictionary and/or a function of the identified co-occurring registered keywords.

Abstract: An apparatus for calculating a correlation between annotations includes a first obtaining unit configured to provide an annotator with a first data group capable of being evaluated to determine whether or not to attach annotations thereto, and obtaining a plurality of first confidence levels indicating certainty of the annotations in the first data group, the annotator outputting confidence levels indicating certainty of annotations to be attached to data when the data is given; a second obtaining unit configured to provide the annotator with a second data group used to calculate a correlation between the plurality of annotations, and thereby obtaining a plurality of second confidence levels indicating the certainty of the annotations in the second data group; and a computing unit configured to compute an estimated value of the correlation between the plurality of annotations based on the plurality of first and second confidence levels.

Abstract: An apparatus for calculating a correlation between annotations includes a first obtaining unit configured to provide an annotator with a first data group capable of being evaluated to determine whether or not to attach annotations thereto, and obtaining a plurality of first confidence levels indicating certainty of the annotations in the first data group, the annotator outputting confidence levels indicating certainty of annotations to be attached to data when the data is given; a second obtaining unit configured to provide the annotator with a second data group used to calculate a correlation between the plurality of annotations, and thereby obtaining a plurality of second confidence levels indicating the certainty of the annotations in the second data group; and a computing unit configured to compute an estimated value of the correlation between the plurality of annotations based on the plurality of first and second confidence levels.

Abstract: A keyword to be categorized is received. A category dictionary including categories having associated registered keywords, and a text corpus are received. Registered keywords are identified in the category dictionary having a degree of similarity to the keyword to be categorized that is equal to or greater than a predetermined value, and the categories associated with the identified registered keywords are extracted. Registered keywords are identified that are co-occurring in the text corpus with the keyword to be categorized, and the categories associated with the identified co-occurring registered keywords are extracted. A degree of importance is determined for each extracted category based on a function of the identified registered keywords in the category dictionary and/or a function of the identified co-occurring registered keywords.

Abstract: A computer-implemented method for computing an intersection or an intersection cardinality of each pair of a set in a first list of a plurality of sets and a set in a second list of a plurality of sets, the method including calculating a first union of a predetermined number of sets in the first list, obtaining filtered sets of the second list by filtering out an element from the plurality of sets in the second list, the element being not included in the first union, and intersecting a set in the first list and a set in the filtered sets of the second list.

Abstract: Embodiments relate to generating a retrieval condition for retrieving a target character string from texts by pattern matching. An aspect includes dividing a first text into words. Another aspect includes generating a converted character string by performing at least one of appending at least one character in at least either one of previous and subsequent positions of the target character string. Another aspect includes replacing at least one character of the target character string. Another aspect includes generating the retrieval condition for retrieval candidates in the words of the first text, the retrieval condition comprising determining that a retrieval candidate matches the target character string and does not match the converted character string based on a ratio of a part of the retrieval candidate which matches the converted character string and corresponds to the target character string is less than or equal to a reference frequency.

Abstract: A first element is extracted from a pair including a past inquiry and a past response, wherein the first element indicates that the past response shows an understanding of the past inquiry. A model is generated used to estimate a second element in a new inquiry based on the first element, wherein the second element indicates that a new response to the new inquiry shows an understanding of the new inquiry.

Abstract: A computer-implemented method for computing an intersection or an intersection cardinality of each pair of a set in a first list of a plurality of sets and a set in a second list of a plurality of sets, the method including calculating a first union of a predetermined number of sets in the first list, obtaining filtered sets of the second list by filtering out an element from the plurality of sets in the second list, the element being not included in the first union, and intersecting a set in the first list and a set in the filtered sets of the second list.

Abstract: A search query is received from a search engine of multiple search engines. One or more search results from each search engine of the multiple search engines in response to the search query are received. Each search result of the one or more search results includes a first search score. A factor is determined for each search result of the one or more search results. A second search score is determined for each search result of the one or more search results based on the first search score and the factor. The one or more search results are displayed to a user of the search engine in an order. The order is based on the second search score.

Abstract: A computer-implemented method, program product, and system, for extracting pieces of text from a plurality of pieces of text. The method includes: primarily evaluating a measure of positive expressions and a measure of negative expressions included in each of pieces of text; secondarily evaluating each of the pieces of text on the basis of a plurality of evaluation functions, where certain evaluation functions among the plurality of evaluation functions include, as variables, the measure of positive expressions and the measure of negative expressions; and extracting a piece of text having an evaluation result with a higher rating in preference to a piece of text having an evaluation result with a lower rating, where the individual evaluation results are based on the same evaluation function among the plurality of evaluation functions.

Abstract: A search query is received from a search engine of multiple search engines. One or more search results from each search engine of the multiple search engines in response to the search query are received. Each search result of the one or more search results includes a first search score. A factor is determined for each search result of the one or more search results. A second search score is determined for each search result of the one or more search results based on the first search score and the factor. The one or more search results are displayed to a user of the search engine in an order. The order is based on the second search score.

Abstract: A search query is received from a search engine of multiple search engines. One or more search results from each search engine of the multiple search engines in response to the search query are received. Each search result of the one or more search results includes a first search score. A factor is determined for each search result of the one or more search results. A second search score is determined for each search result of the one or more search results based on the first search score and the factor. The one or more search results are displayed to a user of the search engine in an order. The order is based on the second search score.

Abstract: A method includes hierarchically identifying occurrences of some of the words in the set of sentences; creating a first index for each of some of the words based on the upper hierarchy of occurrences identified for each word; receiving input of a queried word; hierarchically identifying occurrences of the queried word in the set of sentences; creating a second index based on the upper hierarchy of occurrences identified for the queried word; comparing the first index and the second index to calculate an estimated value for the number of occurrences of a word in the neighborhood of the queried word; and calculating the actual value of the number of occurrences of a word in the neighborhood of the queried word based on an upper hierarchy and lower hierarchy of the occurrences on condition that the estimated value is equal to or greater than a predetermined number.

Abstract: A method and system are provided for performing a legal document search. The method includes finding, by a processor, for each of a plurality of documents, a respective law clause related thereto, to obtain a plurality of related law clauses. The method further includes constructing, by the processor, a graph having nodes defined by the plurality of documents and the plurality of related law clauses and having edges defined by (1) relations between the plurality of documents and the plurality of related law clauses and (2) relations between the plurality of documents. The method further includes identifying, by the processor, from the plurality of documents, one or more candidate documents that are similar to an input query document by mining the graph using similarity criteria.

Abstract: A method and system are provided for collecting social media users who have a specific profile. The method includes retrieving a set of lists connected by at least one criterion to a particular list that is included in a set of reliable lists whose users have already been reliably deemed to have a specific profile. The method includes calculating a list name based confidence value and a list member based confidence value for each list in the retrieved set of lists. The method includes updating the set of reliable lists by adding all lists in the retrieved set of lists that have the list name based confidence value above a first threshold value and the list member based confidence value above a second threshold value. The method includes outputting a listing of users belonging to set of reliable lists as the social media users who have the specific profile.

Abstract: Embodiments relate to a dangerous expression based on a particular theme. An aspect includes acquiring, by an electronic apparatus, from text data for learning, a subset of the text data associated with the particular theme and with particular time period information. Another aspect includes extracting text data containing negative information from the acquired subset of the text data. Another aspect includes extracting a word or phrase having a high correlation with the extracted text data or a word or phrase having a high appearance frequency in the extracted text data from the extracted text data. Yet another aspect includes determining that the extracted word or phrase is the dangerous expression based on the particular theme.

Abstract: A computer-implemented method for computing an intersection or an intersection cardinality of each pair of a set in a first list of a plurality of sets and a set in a second list of a plurality of sets, the method including calculating a first union of a predetermined number of sets in the first list, obtaining filtered sets of the second list by filtering out an element from the plurality of sets in the second list, the element being not included in the first union, and intersecting a set in the first list and a set in the filtered sets of the second list.

Abstract: Aspects of the present invention disclose a method, computer program product, and system for generating target text based on target data. The method includes one or more processors decomposing one or more portions of text into at least one corresponding keyword and at least one corresponding template. The method further includes learning a classification model associated with selecting a template based on a category of a keyword. The method further includes identifying a target keyword that is represented by target data. The method further includes selecting a target template that is used to represent the target data based on a category associated with the identified target keyword utilizing the classification model. The method further includes generating target text that represents the target data based on the selected text template based on the selected target template and the identified target keyword.