Abstract: A method of improving computing efficiency of a computing device for language-independent problem solving and reasoning includes receiving a query from a user, which is decomposed into one or more sub-queries arranged according to a tree structure. The one or more sub-queries are executed in a knowledge base. The results of the executed one or more sub-queries are received and composed into a query response. The query response is transmitted to the user.

Abstract: A method of improving computing efficiency of a computing device for language-independent problem solving and reasoning includes receiving a query from a user, which is decomposed into one or more sub-queries arranged according to a tree structure. The one or more sub-queries are executed in a knowledge base. The results of the executed one or more sub-queries are received and composed into a query response. The query response is transmitted to the user.

Abstract: A method and system of creating a model for large scale data analytics is provided. Training data is received in a form of a data matrix X and partitioned into a plurality of partitions. A random matrix T is generated. A feature matrix is determined based on multiplying the partitioned training data by the random matrix T. A predicted data {tilde over (y)} is determined for each partition via a stochastic average gradient (SAG) of each partition. A number of SAG values is reduced based on a number of rows n in the data matrix X. For each iteration, a sum of the reduced SAG values is determined, as well as a full gradient based on the sum of the reduced SAG values from all rows n, by distributed parallel processing. The model parameters w are updated based on the full gradient for each partition.

Abstract: Systems, computer-implemented methods, and computer program products that can facilitate encoding a tree data structure into a vector based on a set of constraints are provided. According to an embodiment, a system can comprise a memory that stores computer executable components and a processor that executes the computer executable components stored in the memory. The computer executable components can comprise a constraint former that can form a set of constraints based on a first tree data structure and a vector encoder that can encode the first tree data structure into a vector based on the set of constraints.

Abstract: This invention comprises a series of steps which transforms one or more natural language expressions into a single, well-formed formal language representation. Each natural language expression is partially parsed into simple fragments, each of which is then associated with one or more short formal expressions. Each formal expression is constructed in such a way as to contain one or more placeholder variables, each of which is associated with one or more attributes to constrain the types of entities that each variable can potentially represent. The resulting plurality of formal expressions is then filtered for relevance within a given context, and the surviving expressions manipulated based upon a plurality of rules, which are cognizant of the attributes associated with each variable contained therein. A user is then presented with the resulting plurality of formal expressions, whereupon the user optionally selects, rejects, adds to, logically connects and otherwise manipulates each member of said plurality.

Abstract: A method, system and computer program product for identifying documents of interest. A profile of a subscriber is created based on information obtained about the subscriber. Subscriber-interest determination rules are used to identify potential topics of interest of the subscriber based on the subscriber's profile as well as based on external knowledge sources. Each potential interest of the subscriber may be represented by a pointer that references a concept. Additionally, concepts in the documents published by the publishers are identified. A comparison may be made between the concepts identified in the documents published by the publishers with those concepts representing the potential topics of interests of the subscriber. Those documents with matching concepts may then be identified as potentially being of interest for the subscriber. In this manner, documents of interest are more accurately identified for the document seeker.

Abstract: A system and method for producing semantically-rich representations of texts to amplify and sharpen the interpretations of texts. The method relies on the fact that there is a substantial amount of semantic content associated with most text strings that is not explicit in those strings, or in the mere statistical co-occurrence of the strings with other strings, but which is nevertheless extremely relevant to the text. This additional information is used to both sharpen the representations derived directly from the text string, and also to augment the representation with content that, while not explicitly mentioned in the string, is implicit in the text and, if made explicit, can be used to support the performance of text processing applications including document indexing and retrieval, document classification, document routing, document summarization, and document tagging.

Abstract: This invention comprises a series of steps which transforms one or more natural language expressions into a single, well-formed formal language representation. Each natural language expression is partially parsed into simple fragments, each of which is then associated with one or more short formal expressions. Each formal expression is constructed in such a way as to contain one or more placeholder variables, each of which is associated with one or more attributes to constrain the types of entities that each variable can potentially represent. The resulting plurality of formal expressions is then filtered for relevance within a given context, and the surviving expressions manipulated based upon a plurality of rules, which are cognizant of the attributes associated with each variable contained therein. A user is then presented with the resulting plurality of formal expressions, whereupon the user optionally selects, rejects, adds to, logically connects and otherwise manipulates each member of said plurality.

Abstract: A system and method for producing semantically-rich representations of texts to amplify and sharpen the interpretations of texts. The method relies on the fact that there is a substantial amount of semantic content associated with most text strings that is not explicit in those strings, or in the mere statistical co-occurrence of the strings with other strings, but which is nevertheless extremely relevant to the text. This additional information is used to both sharpen the representations derived directly from the text string, and also to augment the representation with content that, while not explicitly mentioned in the string, is implicit in the text and, if made explicit, can be used to support the performance of text processing applications including document indexing and retrieval, document classification, document routing, document summarization, and document tagging.

Abstract: A method for collecting related queries, comprising the steps of obtaining a first query and a second query that have been submitted during a search for data, and determining whether the first query and the second query have a likelihood of being submitted by a class of searcher.