Examples of the disclosure are directed to systems and methods of using natural language processing techniques to automatically assign metadata to articles as they are published. The automatically-assigned metadata can then feed into the algorithms that calculate updated causation scores for agent-outcome hypotheses, powering live visualizations of the data that update automatically as new scientific articles become available.

Provided are methods and apparatus for matching postal addresses. In an example, provided is a method for comparing postal addresses. The method includes receiving a first postal address, standardizing the form of the first postal address, removing a component of the first postal address to create a canonical representation of the first postal address, and utilizing a signature-based algorithm to identify at least one stored signature which substantially matches the first postal address.

Some aspects disclosed herein are directed to, for example, a system and method comprising a client device receiving an input of at least a portion of a message. The client device may transmit, to a server device, the at least the portion of the message for display via a second client device. The client device may determine an identifier for the at least the portion of the message. The client device may determine, based on a lexicon, a marker name for the at least the portion of the message. The client device may generate an association between the marker name for the at least the portion of the message and the identifier for the at least the portion of the message. The client device may store, at a storage location, the marker name for the at least the portion of the message, the identifier for the at least the portion of the message, and the association between the marker name for the at least the portion of the message and the identifier for the at least the portion of the message.

Systems and methods for performing searches using the natural written or spoken language of a search query's author are described herein.

Keyword suggestions that are category-aware (and field-proven) may be used to help advertisers better target the serving of their ads, and may reduce unused ad spot inventory. The advertiser can enter ad information, such as a creative, a landing Webpage, other keywords, etc. for example. A keyword facility may use this entered ad information as seed information to infer one or more categories. It may then request that the advertiser confirm or deny some basic feedback information (e.g., categories, Webpage information, etc.). For example, an advertiser may be provided with candidate categories and may be asked to confirm (e.g., using checkboxes) which of the categories are relevant to their ad. Keywords may be determined using at least the categories. The determined keywords may be provided to the advertiser as suggested keywords, or may automatically populate ad serving constraint information as targeting keywords. The ad server system can run a trial on the determined keywords to qualify or disqualify them as targeting keyword.

Provided are systems and methods for managing storage of machine data. In one embodiment, a method can be provided. The method can include receiving, from one or more data sources, raw machine data; processing the raw machine data to generate processed machine data; storing the processed machine data in a data store; and determining an allocated data size associated with the processed machine data stored in the data store, wherein the allocated data size is the size of the raw machine data corresponding to the processed machine data stored in the data store.

According to an aspect, automatically adding new concepts to a concept graph includes receiving a string of text, searching a corpus of data to locate additional text related to the string of text, and extracting concepts from the additional text. The extracted concepts include a subset of concepts in the concept graph. The adding new concepts also includes determining whether the string of text should be linked to an existing concept in the concept graph, performing the linking based on determining that the string of text should be linked to the existing concept in the concept graph and, based on determining that the string of text should not be linked to an existing concept in the concept graph, adding a new concept to the concept graph. The new concept is associated with the string of text.

The invention relates to electronic indexing, and more particularly, to the parallelization of indexing. Systems and methods of the invention index data archives by breaking a job into work items and sending the work items to multiple processors that can each determine whether to index data associated with the work item or to create a new work item and have a different processor index the data. This gives the system an internal load-balancing that results in indexing jobs during which no processor stands idle while another processor indexes data of unexpected complexity.

A written document (hereinafter referred to as a work, on electronic format which includes, stories, novels, education texts, biographies, compilations, collections, anthologies, tracts, and any other traditional format for relatively extensive texts) provides access to reference, bibliography and/or definition material through an electronic software capability associated with the work. Depending upon reader access information or characteristics (e.g., age, grade, proficiency, or position within the work or any other identifiable reader characteristic or access limitation), any request for reference material, definitions, explanations, translations, or other material provided in the associated software capability is automatically limited by system acknowledgement of the reader access information or characteristics. As the reader's access information or characteristics change, the quality and/or quantity and/or format of requested information with respect to a work changes.

A computer system implements novel identification algorithms to generate universal identifiers requested by distributed clients into unique numeric identifiers devoid of language-specific alphabetic characters. The identifiers may be used for indexing different objects in a database or databases. The computer system, working in cooperation with distributed clients, assists users who supply the unique numeric identifiers with finding information in the different systems regarding the identified objects.