Abstract: A user interface for searching records in a database is provided. Each record may contain information regarding one or more categories. The user interface may receive search criteria of one or more categories and provide search results comprising exact and/or inexact matching records. An inexact matching record may have a relevance value representing the relevance of the record to the search query, and inexact matching records may be displayed in an ordering based on the relevance values. The user interface may provide slider tools for receiving changes in a weight value or search criterion of an associated category. A new ordering of the inexact matching records may be displayed in real-time based on newly received weight values or search criterion. The user interface may also provide a mapping tool, a search-result selection function, and/or one or more drill down tools. The user interface may provide any tool or function alone or in any combination.

Abstract: Method, system, and programs for detecting dynamic relationship and discovering dynamic events. Data from a first data source is first received. At least one dynamic relation candidate is identified and each dynamic relation candidate involves multiple entities. The at least one dynamic relation candidate is identified based on temporal properties with respect to the entities exhibited in the data from the first data source. Dynamic relations are then extracted by corroborating the temporal properties of the entities involved in the at least one dynamic relation candidate with that of the same entities exhibited in data from a second data source. Then, a dynamic event that gives rise to the dynamic relations among different entities is detected.

Abstract: A computer-implemented method of providing text entry assistance data includes receiving at a system location information associated with a user, receiving at the system information indicative of predictive textual outcomes, generating dictionary data using the location information, and providing the dictionary data to a remote device.

Abstract: Calendar-based suggestion of travel options involves suggesting a travel option based on events stored in a calendar of a user. For example, a user in San Francisco may be scheduled for a business trip to New York, and the user's calendar may show a dinner reservation in San Francisco on Saturday, September 3 and business meeting in New York on Monday, September 5. A suggestion machine accesses calendar data of the user and travel data for several available travel options (e.g., flights from San Francisco to New York). Based on the accessed calendar data and travel data, the suggestion machine determines that one or more travel options (e.g., a flight on Sunday, September 4) are compatible with the dinner reservation and the business meeting on the user's calendar. The suggestion machine presents these compatible travel options to the user.

Abstract: A similarity search initialization system includes a leaf selector to select a leaf of a suffix tree generated from a target string representing a target sequence. The selected leaf is associated with a prefix in the suffix tree having a longest match to a suffix of a query string representing a query. The system further includes a distance module to determine a distance between the query and a subsequence of the target sequence represented by a candidate substring of the target string. The candidate substring includes the prefix associated with the selected leaf. The determined distance is to provide an initial upper bound in a similarity search of the target sequence using the query.

Abstract: A method and apparatus for identifying and resolving conflicting data records are disclosed. The individual data fields of a master record are compared with the corresponding data fields of each source record in a particular data set. For each, one of various matching algorithms is used to assign a field matching score indicating the extent to which the data in the two data fields matches. The particular algorithm used to determine the extent of a match and to assign the corresponding score is dependent on the type of the data field. Once all of the data fields for a particular source record have been analyzed, the sum of the field matching scores is tallied to determine an overall record matching score for that particular source record.

Abstract: A system and method for providing a personalized advertisement for a good or service for display to a user is described. The system includes a communications device operated by the user; a virtual person database comprising information about the user; and a search engine useful for finding advertisements of interest to the user and generating personalized advertisements for display on the communications device.

Abstract: Embodiments relate to identifying a sketching matrix used by a linear sketch. Aspects include receiving an initial output of the linear sketch, generating a query vector and inputting the query vector into the linear sketch. Aspects further include receiving an revised output of the linear sketch based on inputting the query vector and iteratively repeating the steps of generating the query vector, inputting the query vector into the linear sketch, and receiving an revised output of the linear sketch based on inputting the query vector until the sketching matrix used by the linear sketch can be identified.

Abstract: A computer-implemented method of semantically linking, by a computing device, a citing document to a cited document in a corpus of documents includes locating at least one citation present in the citing document, determining a reason-for-citing for at least one citation, and determining a cited-text-area present in the cited document, wherein the cited-text-area corresponds with the reason-for-citing. The method further includes populating a citation entry of a citation-pairing metadata file with a citing-document identifier, a reason-for-citing identifier, a cited-document identifier, and a cited-text-area identifier. The citation-pairing metadata file includes a plurality of citation entries and is stored separately from the citing document and the cited document.

Abstract: Systems and methods are disclosed that allow for indexing, processing, or both of information from physical media or electronic media, which may be received from a plurality of sources. In embodiments, a document file may be matched using pattern matching methods and may include comparisons with a comparison reference database to improve or accelerate the indexing process. In embodiments, information may be presented to a user as potential matches thereby improving manual indexing processes. In embodiments, one or more additional actions may occur as part of the processing, including without limitation, association additional data with a document file, making observations from the document file, notifying individuals, creating composite messages, and billing events. In an embodiment, data from a document file may be associated with a key word, key phrase, or word frequency value that enables adaptive learning so that unindexed data may be automatically indexed based on user interaction history.

Abstract: The invention relates to a method which receives location information of a mobile terminal of a single user. One or more journeys are extracted from the location information of the single user. The corresponding journey data is stored in a journey database. From the journey data in the journey database, journey patterns for the single user are extracted. A journey pattern indicates at least the regularity of a particular journey in time, i.e. over a number of days. The journey patterns are stored in the pattern database. The journey patterns of the single user are matched with patterns of other users. If a match is found, at least one match based on the journey patterns is sent to the single user. These features enable the carpool service to find a match which takes into account the regularity across a period of days. By identifying the regularity, a better match can be made with users which travel the same route, as also the days on which the users travel are taken into account.

Abstract: Embodiments of the present invention provide a method, system and computer program product for cross-cutting event correlation in an enterprise computing monitoring and management system. An enterprise computing monitoring and management system can include a hierarchy of nodes, where several of the nodes are each coupled to a corresponding embedded correlation engine and an event bus. The system further can include a root node among the nodes. The root node can be coupled to the event bus and to centralized correlation logic programmed to identify a high correspondence between events from a particular event source among the nodes and a particular set of correlation rules in that correlation engine. The identification of such correspondence can be used to move to the set of correlation rules to an embedded correlation engine closer to the particular event source.

Abstract: When redacting natural language text, a classifier is used to provide a sensitive concept model according to features in natural language text and in which the various classes employed are sensitive concepts reflected in the natural language text. Similarly, the classifier is used to provide an utility concepts model based on utility concepts. Based on these models, and for one or more identified sensitive concept and identified utility concept, at least one feature in the natural language text is identified that implicates the at least one identified sensitive topic more than the at least one identified utility concept. At least some of the features thus identified may be perturbed such that the modified natural language text may be provided as at least one redacted document. In this manner, features are perturbed to maximize classification error for sensitive concepts while simultaneously minimizing classification error in the utility concepts.

Abstract: A method and apparatus for managing parts. A number of identifiers is received for an unidentified part. A determination is made as to whether the number of identifiers sufficiently matches a number of corresponding identifiers in a plurality of identifiers in a code stored in a database of codes associated with parts. The code is associated with the part. In response to the number of identifiers matching the number of corresponding identifiers in the plurality of identifiers in the code, a repository storing related information for the parts is accessed to obtain the related information for the part using a code identified for the part.

Abstract: Extensive databases of well-annotated reports are important knowledge sources in medical workflows, such as in radiology. These are typically accessed by the healthcare professional looking for reports similar to a current case being evaluated. However, filling and maintaining such databases requires considerable effort. A system is provided for storing a candidate report, comprising a searcher configured to retrieve one or more queries from a query database; to retrieve the candidate report from a user input; to execute the one or more queries on the candidate report to determine the relevance of the candidate report, and to store the candidate report in the report database if the relevance exceeds a predetermined value. This provides a check, prior to storing, to evaluate whether a candidate report would actually be a worthwhile addition to the database. If not, it is by default not added.

Abstract: Provided are techniques for secure matching supporting fuzzy data. A first bloom filter for a first data element is retrieved, wherein each of the characters in the data element has been encrypted with a beginning offset position of the character and encrypted with an end offset position of the character to produce two encrypted values that are added to the first bloom filter. A second bloom filter for a second data element is retrieved. The first bloom filter and the second bloom filter are compared to determine whether there is a match between the first data element and the second data element.

Abstract: The present invention relates to a system and method for improving a resume according to a job description, including generating a first user profile signature based on a first user profile element associated with a user, generating a first job description signature based on a first job description element associated with a job description; and comparing the first user profile signature with the first job description signature to determine a first score indicating a strength of a match between the first user profile element and the job description.

Abstract: There is provided a method that includes (i) receiving a first record that contains an identity of an individual, a name of a business, and a role of the individual in the business, (ii) matching the first record to data that provides a unique business identifier for the business, (iii) matching the first record to data that provides a unique individual identifier for the individual, (iii) appending to the first record (a) the unique business identifier, (b) the unique individual identifier, and (c) a unique role identifier for the role of the individual in the business, (iv) matching the first record to a second record based on the unique business identifier, the unique individual identifier, and the unique role identifier, and (v) consolidating the first and second records into a resultant record.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for determining word boundary likelihoods in potentially incomplete text. In one aspect, a method includes selecting query sequences from the query, each query sequence being at least a portion of a word n-gram, the word n-gram being a subsequence of up to n words selected from the second sequence of words of the query, and for each query sequence: determining one or more query sequence keys for the query sequence; determining at least one of a word boundary count and a non-word boundary count for each query sequence key, each word-boundary count and non-word boundary count being dependent on the context of the query sequence; and associating, in a data storage device, the at least one word boundary count and non-word boundary counts with each query sequence key.

Abstract: A method for correcting service manual textual inconsistencies. Extracting textual procedures from service documents stored in a memory of a service document storage device. Each term of an extracted textual procedure terminology is compared to a correlating target name terminology for identifying any matching terms by a processor. An overlap similarity is computed as a function of the identified matching terms from the extracted textual procedure terminology and the correlating target name terminology. A determination is made whether the overlap similarity is greater than a predetermined similarity threshold. The service documents are modified to change the extracted textual procedure terminology to the correlating target name terminology in response to the overlap similarity being greater than the predetermined similarity threshold and the extracted textual procedure terminology not exactly matching the correlating target name terminology.

Abstract: The embodiments of the present invention provide a computer-implemented method and system for translating user keywords into semantic queries based on domain vocabulary. The system receives the user keywords and search for the concepts. The concepts are transformed into a connected graph. The user keywords are translated into precise access paths based on the information relationship described in conceptual entity relationship models and then converts these paths into logic based queries. It bridges the semantic gap between user keywords and logic based structured queries. It enables users to interact with the semantic system by articulating the information in a structured query language. It improves the relevance of search results by incorporating semantic technology to drive the mechanics of the search solution.

Abstract: A method of normalizing a bibliographic field of a structured field relational database is disclosed. The method comprises weighting potential candidate records according to the value in the corresponding field in the records, together with other related fields in the candidate record and other related records in the database. Each of the candidate records is successively evaluated and compared against an acceptable threshold. If the weight exceeds the threshold, the candidate record is returned from the query. Otherwise, a new entry in the database is created. Optionally, before creating such a new entry, the highest weighted candidate record may be compared against a minimally acceptable threshold and if the weight exceeds such lower threshold, the candidate is returned from the query.

Abstract: Aspects of the invention relate generally to providing useful search results from chain business queries. More specifically, various algorithms may be used to identify chain businesses and queries for chain businesses. Chain businesses may include, for example, various types of businesses which are associated with other businesses with the same name, such as chain restaurants, car rental locations, pharmacies, banks, retail stores, or other franchise businesses. This information may be used to rank and filter search results as well as incorporate other useful features in order to improve a user's search experience.

Abstract: This invention relates in general to search and more specifically to two-stage search, where first an incremental character-based search for the keywords and sub keyphrases that together form the target keyphrase to be searched for is performed in order to construct the target keyphrase and then a search for the target keyphrase so constructed is performed among the documents to be searched. The system in this invention is comprised of a user device system from the which the user performs the search, a search server system which performs the search for keywords and sub keyphrases that together form the target keyphrase using text entered by the user and performs the search for documents using the target keyphrase constructed by the user, and an advertisement server system that performs the search for advertisements corresponding to the target keyphrase.

Abstract: Systems, methods, and media for generating fused risk scores for determining fraud in call data are provided herein. Some exemplary methods include generating a fused risk score used to determine fraud from call data by generating a fused risk score for a leg of call data, via a fuser module of an analysis system, the fused risk score being generated by fusing together two or more uniquely calculated fraud risk scores, each of the uniquely calculated fraud risk scores being generated by a sub-module of the analysis system; and storing the fused risk score in a storage device that is communicatively couplable with the fuser module.

Abstract: Systems and methods for identifying which video segment is being displayed on a screen of a television system. The video segment is identified by deriving data from the television signals, the derived data being indicative of the video segment being displayed on the screen. This feature can be used to extract a viewer's reaction (such as changing the channel) to a specific video segment (such as an advertisement) and reporting the extracted information as metrics. The systems and methods may further provide contextually targeted content to the television system. The contextual targeting is based on not only identification of the video segment being displayed, but also a determination concerning the playing time or offset time of the particular portion of the video segment being currently displayed.

Abstract: A natural language processing system and method resolves partial matches when a natural language input query does not fully specify an entity. The input query is tokenized into a set of query tokens, which are compared to contents of a searchable index, the contents representing entities, each of which is tokenized into a set of entity tokens associated with the tokenized entity. A plurality of partial match query tokens are identified from the set of query tokens, each partial match query token matching at least one entity token in the index. The entity(s) corresponding to each partial match query token are selected if a sequential break exists in the input query between the partial match query tokens and there is no intersection between the entity(s) corresponding to each partial match query token.

Abstract: An information processing device includes: a creating unit that extracts link information from content, and creates interpage relationship data which includes information between a subject page and linking pages having links from/to the subject page directly or indirectly; a page weight calculating unit that calculates the weight of at least one of the linking pages, based on the interpage relationship data; a tag weight calculating unit that calculates the weight of a tag, based on the weight of the at least one of the linking pages and information about the tag; a tag transmission determining unit that determines which tag is to be transmitted to which page, based on the tag weight; and a page creating unit that creates a new page having the tag added to the subject page, based on the determination result of the tag transmission determining unit.

Abstract: A collaborative search session is provided hosted by one or more computing devices. First query data is received from a first computing device in a collaborative search session. Further, second query data is received from a second computing device in the collaborative search session. A corpus of resources can be caused to be searched based at least in part on the first and second query data to identify a particular search result set for the collaborative search session. At least a portion of the particular search result set can be caused to be presented on each of the first and second computing devices participating in the collaborative search session.

Abstract: A computer system that includes a computer that couples with a database. The computer includes program code or modules to gather location and activity content from disparate sources, and through text analytics, extract associations from the content and populate the database with the associations between locations and activities. Further modules provide end user interaction through presentation of a search user interface specific to locations and activities. Additional modules provide the capability to search the database, rank the results of the search and present the results to the user.

Abstract: Disclosed are methods, apparatus, systems, and computer-readable storage media for retrieving content related to a feed item of an online social network. In some implementations, a computing device receives a feed item to be displayed in a feed associated with a first user of an online social network. The computing device identifies, in the received feed item, a first tagged keyword comprising a first tag and a first keyword and identifies one or more data sources based on the first tag. The computing device retrieves, from the one or more data sources, a plurality of content records related to the first keyword and selects a content record of the plurality of content records. The computing device automatically generates an information update associated with the feed item, the information update including content information of the selected content record, the information update capable of being displayed in association with the feed.

Abstract: A relationship-information storage unit stores relationships between configuration items. The configuration items belong to an information system and are stored in multiple databases. A first counting unit compares, across the databases, attribute values of one configuration item in each of the databases, thereby counting a matching-attribute-value count. A second counting unit identifies a configuration item having a relationship with the one configuration item, for which the first counting unit counts the matching-attribute-value count, by referring to the relationship-information storage unit. Then, the second counting unit compares, across the databases, attribute values of the identified configuration items to count a matching-attribute-value count. A similarity calculation unit calculates similarity between the configuration items, based on the matching-attribute-value count counted by the first counting unit and the matching-attribute-value count counted by the second counting unit.

Abstract: A method and apparatus include extracting a global descriptor from a query image with a plurality of segments. The method also includes identifying segments with a desirable discriminating potential by analyzing data of the plurality of segments based on an available image database. The method also includes creating a bitmask where the identified segments are active. The method also includes masking any segment of the plurality of segments of the global descriptor that are inactive according to the bitmask A method includes extracting a global descriptor from a query image and identifying one or more reference global descriptors. The method also includes determining a distance between the global descriptor and each of the one or more reference global descriptors. In addition, the method includes, responsive to the distance satisfying a threshold, adding an image associated with each of the one or more reference global descriptors that satisfy the threshold to a list.

Abstract: A method and system for automated generation of social networks. A graphical user interface receives a user query for an entity of interest, and outputs a graphical network showing entities and associations related to the entity of interest. A search engine interface transmits the query to a search engine, and receives references to documents. A named entity extractor downloads a selection of the documents, and generates a list of named entities referenced in the downloaded documents. A network inference module receives each list of named entities, and generates associations between the named entities in each list. An entity matcher operates on the associations to consolidate them in instances wherein differently named entities are determined to be the same named entity, and provides a consolidated list of named entities and associations to the user interface for display as a graphical network.

Abstract: Signal data from a sensor is stored in a storage device. The signal data is accessed by means access request that includes an identification of a base signal that may indicate the signal data from said sensor and an identification of a derivation to obtain a requested signal from the base signal. An interface extracts the identifications of the base signal the derivation. The interface tests whether stored signal data obtained from the base signal by said derivation is available in the storage device, and if so it returns the stored signal data in response to the access request via the interface. If not signal data is derived from further stored signal data by at least one signal processing operation identified in the derivation.

Abstract: The present application discloses a method and an apparatus for obtaining structured information in a fixed layout document to improve the structuring speed for information management of a fixed layout document. The method may comprise: determining initial page number information corresponding to current directory entry of the document; segmenting first article content of a page corresponding to the initial page number information into at least one structured-characters-block; searching in each structured-characters-block for a first structured-characters-block which matches with name strings of the current directory entry, and obtaining first position information about where the first structured-characters-block is located in the first article content; and obtaining initial position information of the current directory entry and end position information of the previous directory entry based on the first position information.

Abstract: Provided are techniques for secure matching supporting fuzzy data. A first bloom filter for a first data element is retrieved, wherein each of the characters in the data element has been encrypted with a beginning offset position of the character and encrypted with an end offset position of the character to produce two encrypted values that are added to the first bloom filter. A second bloom filter for a second data element is retrieved. The first bloom filter and the second bloom filter are compared to determine whether there is a match between the first data element and the second data element.

Abstract: A method of determining a similarity between records in a data set is provided. Data organized into a plurality of records is received. First characters associated with a field and a first record of the plurality of records are selected. The selected first characters are encoded and subdivided into a first sliding series of a defined number of characters. Second characters associated with the field and a second record of the plurality of records are selected. The selected second characters are encoded and subdivided into a second sliding series of the defined number of characters. Whether or not the first sliding series and the second sliding series are similar is determined by comparing the encoded and subdivided first characters to the encoded and subdivided second characters using a fuzzy matching algorithm.

Abstract: A system and method are disclosed for inexact search acceleration using reference data. A representative system includes one or more memory circuits storing a plurality of queries and a FM-index of the reference data; and one or more FPGAs configured to select a query; select a substring of the selected query; read a section of the FM-index and calculate a plurality of suffix array intervals for the substring with a corresponding plurality of prepended characters in a first or next position; read a first or next character in the first or next position of the query and select a suffix array interval for the read first character; determine whether the suffix array interval is valid and whether a beginning of the query has been reached; returning a first search result when the suffix array interval is valid and the beginning of the query has been reached; and returning a second search result that no match of the query with the reference data was found when the suffix array interval is not valid.

Abstract: Systems, methods, and computer-readable storage media are provided for conducting searches utilizing search navigation patterns. Search queries are received that include search terms that are of a particular type. It is recognized that at least one prior search session has been conducted that included a search query having search terms of an equivalent or similar type and followed a particular navigation pattern. Such prior search(es) may have been conducted by the user or by a different user and/or may have a navigation pattern that was affirmatively recorded by the requesting user or that was recorded by the system without explicit contemporaneous user instruction to do so. Upon identifying the navigation pattern associated with the prior search, the system effectively conducts a search session following the navigation pattern.

Abstract: A system for recommending feeds for a user comprises a client with a web browser, an application server, and a content server. The browser tracks the user's browsing activity and transmits user data related to the user's browsing activity to the application server. The application server searches the content server to determine feeds that may be relevant to the user's browsing activity and then communicates those feeds to the browser. The browser displays the received feeds to the user as feed recommendations, prompting the user to select from among the recommended feeds. Once the user has selected one or more feeds, the browser transmits the user's selection to the application server, which enables the feeds to be presented subsequently to the user. In this way, the system uses the user's browsing activity to obtain automatically for a user feeds that are likely to be relevant to the user.

Abstract: A method and a system for efficient search of string patterns characterized by positional relationships in a character stream are disclosed. The method is based on grouping string patterns of a dictionary into at least two string sets and performing string search processes of a text of the character stream based on individual string sets with the outcome of a search process influencing a subsequent search process. A system implementing the method comprises a dictionary processor for generating string sets with corresponding text actions and search actions, a conditional search engine for locating string patterns belonging to at least one string set in a text according to a current search state, a text operator for producing an output text according to search results, and a search operator for determining a subsequent search state.

Abstract: A portable executable file can be repaired by identifying an invalid field of a portable executable file. A likelihood of repairing the invalid field of the portable executable file is determined. A repair model for repairing the invalid field of the portable executable file is generated, and the invalid field of the portable executable file is repaired based upon, at least in part, the repair model.

Abstract: A method of processing a query to a graph database using a plurality of processors. The method comprises providing a plurality of threads to be executed on a plurality of processors, each the thread is associated with one of a plurality of unique thread identifiers, providing a graph database having a plurality of graph database nodes and a plurality of graph database edges, each the graph database edge represents a relationship between two of the plurality of graph database nodes, receiving a query tree that defines a tree comprising plurality of query nodes connected by a plurality of query tree edges, and searching at least part of the graph database for a match with the query tree, wherein the searching is executed by the plurality of the processors, and wherein each the processor searches one of a plurality of sub-graphs of the graph database, each the sub-graph is defined by one of the plurality of thread identifiers.

Abstract: Structured and unstructured project information is collected, analyzed, and consolidated by a project service. On-demand or periodically, the project service consolidates the unstructured project information and the structured project information to present to an end user as aggregate information. The aggregate information may be formatted based on user criteria.

Abstract: A method for detecting and locating occurrence in a data stream of any complex string belonging to a predefined complex dictionary is disclosed. A complex string may comprise an arbitrary number of interleaving coherent strings and ambiguous strings. The method comprises a first process for transforming the complex dictionary into a simple structure to enable continuously conducting computationally efficient search, and a second process for examining received data in real time using the simple structure. The method may be implemented as an article of manufacture having a processor-readable storage medium having instructions stored thereon for execution by a processor, causing the processor to match examined data to an object complex string belonging to the complex dictionary, where the matching process is based on equality to constituent coherent strings, and congruence to ambiguous strings, of the object complex string.

Abstract: A computer-implemented method and system for determining documents that are nearest to a query are provided herein. The method includes constructing a vantage point tree based on a number of document vectors. The method also includes searching the vantage point tree to determine a number of nearest neighbor document vectors to a query vector by removing a portion of the document vectors from the vantage point tree based on one or more vantage points for each of a number of nodes in the vantage point tree and a specified search radius centered about the query vector.

Abstract: A computer-implemented method of tagging a transaction that includes tagging a transaction with one of a first tag value or a second tag value, forming a set of clusters associated with the tagged transactions having a first value, and forming a second set of clusters associated with the tagged transactions having a second value. The computer implemented method also includes determining a fuzzy tag value based on a relationship between the transaction and one of the centroids of the clusters having a first tag value, and one of the centroids of the clusters having second value. The method also includes replacing the first tag value or the second tag value with the fuzzy tag value.

Abstract: Technologies are disclosed for enabling users to comprehensively determine their exposures to media and to receive services based thereon. For example, an application can be executed on a computing device associated with a user. The application can continuously monitor audio data that the computing device is exposed to and can generate digital signatures thereof. The digital signatures can be transmitted to a server that comprises a database of reference digital signatures and circuitry configured to compare and match the received digital signatures and the reference digital signatures. When a match is found, the server retrieves information associated with the matched reference digital signature and returns, to the device, the retrieved information. The server can also concatenate matches associated with data received from a plurality of computing devices and provide the concatenated data to a third party, who in turn, returns services to the users based on the received data.

Abstract: Embodiments of the inventive concept can extract digital document information related with a specific individual to achieve a work load reduction associated with evidentiary material preparation for litigation. A specific individual is selected from at least one individual included in user information. Only digital document information which was accessed by the specific individual is extracted based on access history information regarding the selected specific individual. Additional information indicating whether or not document files in the extracted digital document information are each related with the litigation is set, and a document file related with the litigation is outputted based on the additional information.