Abstract: Provided herein is a system, method, and computer program product for modifying a language conversation model of the language learning system. Modifying the language conversation model includes receiving, using a conversational sub-system, voice inputs. The conversational sub-system converts the voice inputs to voice input data and processes the voice input data. The conversational sub-system detects an error in processing the voice input data and, based at least in part on the error, stores additional data comprising additional voice input data in a memory. The conversational sub-system applies machine learning to the additional data to derive a function that is not enabled within the language conversation model. The conversational sub-system develops an update that enables the language conversation model to implement the function. The update is applied to the language conversation model.

Abstract: A method for simplifying user interactions with decision tree dialog managers is provided. The method may include receiving from a client computer, by a server computer, a user input. The server computer may identify one or more candidate nodes of a decision tree corresponding to the received user input. An entropy value may be calculated by the server computer for each of the identified candidate nodes. The server computer may then select a current node from among the candidate nodes, whereby the selected current node has a lowest calculated entropy value. A prompt associated with the selected current node may be transmitted to the user by the server computer.

Abstract: A computer generates labels for machine learning algorithms by retrieving, from a data storage circuit, multiple label sets that contain labels that each classify data points in a corpus of data. A graph is generated that includes a plurality of edges, each edge between two respective labels from different label sets of the multiple label sets. Weights are determined for the plurality of edges based upon a consistency between data points classified by two labels connected by the edges. An algorithm is applied that groups labels from the multiple label sets based upon the weights for the plurality of edges. Data points are identified from the corpus of data that represent conflicts within the grouped labels. An electronic message is transmitted in order to present the identified data points to entities for further classification. A new label set is generated using the further classification received from the entities.

Abstract: A computer-implemented method for knowledge based ontology editing, is provided. The method receives a language instance to update a knowledge base, using a computer. The method semantically parses the language instance to detect an ontology for editing. The method maps one or more nodes for the ontology for editing based on an ontology database and the knowledge base. The method determines whether the mapped nodes are defined or undefined within the knowledge base. The method calculates a first confidence score based on a number of the defined and undefined mapped nodes. Furthermore, the method updates the knowledge base when the first confidence score meets a pre-defined threshold.

Abstract: A computer-implemented method includes receiving a question. The question is directed to a question answering system. The method includes extracting two or more queries from the question. The method includes generating two or more question sets, each of the two or more question sets addressing all of the two or more queries. The method includes selecting one of the two or more question sets to yield a selected question set, based on analyzing each of the two or more question sets according to a pre-trained model. The method includes presenting the selected question set to the question answering system.

Abstract: A computer generates labels for machine learning algorithms by retrieving, from a data storage circuit, multiple label sets that contain labels that each classify data points in a corpus of data. A graph is generated that includes a plurality of edges, each edge between two respective labels from different label sets of the multiple label sets. Weights are determined for the plurality of edges based upon a consistency between data points classified by two labels connected by the edges. An algorithm is applied that groups labels from the multiple label sets based upon the weights for the plurality of edges. Data points are identified from the corpus of data that represent conflicts within the grouped labels. An electronic message is transmitted in order to present the identified data points to entities for further classification. A new label set is generated using the further classification received from the entities.

Abstract: A computer generates labels for machine learning algorithms by retrieving, from a data storage circuit, multiple label sets that contain labels that each classify data points in a corpus of data. A graph is generated that includes a plurality of edges, each edge between two respective labels from different label sets of the multiple label sets. Weights are determined for the plurality of edges based upon a consistency between data points classified by two labels connected by the edges. An algorithm is applied that groups labels from the multiple label sets based upon the weights for the plurality of edges. Data points are identified from the corpus of data that represent conflicts within the grouped labels. An electronic message is transmitted in order to present the identified data points to entities for further classification. A new label set is generated using the further classification received from the entities.

Abstract: Two or more variables in a source code are determined. One or more variable groupings for the two or more variables are determined. A potential error for a variable of the two or more variables is determined based on the determined variable groupings.

Abstract: Techniques, systems, and articles of manufacture for utilizing dependency among internet search results. A method includes associating a user search query with a search task, identifying multiple information documents that correspond to the search task, and generating a recommended sequence of the multiple information documents to present to the user in response to the user search query, wherein the recommended sequence is based on dependency information associated with the multiple information documents.

Abstract: A computer-implemented method for knowledge based ontology editing, is provided. The method receives a language instance to update a knowledge base, using a computer. The method semantically parses the language instance to detect an ontology for editing. The method maps one or more nodes for the ontology for editing based on an ontology database and the knowledge base. The method determines whether the mapped nodes are defined or undefined within the knowledge base. The method calculates a first confidence score based on a number of the defined and undefined mapped nodes. Furthermore, the method updates the knowledge base when the first confidence score meets a pre-defined threshold.

Abstract: A computer-implemented method for knowledge based ontology editing, is provided. The method receives a language instance to update a knowledge base, using a computer. The method semantically parses the language instance to detect an ontology for editing. The method maps one or more nodes for the ontology for editing based on an ontology database and the knowledge base. The method determines whether the mapped nodes are defined or undefined within the knowledge base. The method calculates a first confidence score based on a number of the defined and undefined mapped nodes. Furthermore, the method updates the knowledge base when the first confidence score meets a pre-defined threshold.

Abstract: Systems and associated methods for address standardization and applications related thereto are described. Embodiments exploit a common context in a taxonomy and a given address to detect and correct deviations in the address. Embodiments establish a possible path from a root of the taxonomy to a leaf in the taxonomy that can possibly generate a given address. Given a new address, embodiments use complete addresses, and/or segments or elements thereof, to compute the representations of the elements and find a closest matching leaf in the taxonomy. Embodiments then traverse the path to a root node to detect the agreement and disagreement between the path and the address entry. Taxonomical structured is thus used to detect, segregate and standardize the expected fields.

Abstract: A computer-implemented method for knowledge based ontology editing, is provided. The method receives a language instance to update a knowledge base, using a computer. The method semantically parses the language instance to detect an ontology for editing. The method maps one or more nodes for the ontology for editing based on an ontology database and the knowledge base. The method determines whether the mapped nodes are defined or undefined within the knowledge base. The method calculates a first confidence score based on a number of the defined and undefined mapped nodes. Furthermore, the method updates the knowledge base when the first confidence score meets a pre-defined threshold.

Abstract: Methods, systems, and computer program products for resolving textual numerical queries using natural language processing techniques are provided herein.

Abstract: An approach is provided for creating a new document. Keywords specifying a subject matter of the new document are received. Metadata of documents is determined to match keyword(s) included in the received keywords and the documents are retrieved. Based on a section being created in the new document, a ranked list of the retrieved documents is generated. A selection of a document included in the ranked list is received. The selected document is added to the new document. The keywords are refined based on the added document. Based on the subject matter and the refined keywords, the new document is completed by repeating the steps of determining the metadata, retrieving the documents, generating the ranked list, receiving the selection, and adding the selected document.

Abstract: A computer-implemented method for knowledge based ontology editing, is provided. The method receives a language instance to update a knowledge base, using a computer. The method semantically parses the language instance to detect an ontology for editing. The method maps one or more nodes for the ontology for editing based on an ontology database and the knowledge base. The method determines whether the mapped nodes are defined or undefined within the knowledge base. The method calculates a first confidence score based on a number of the defined and undefined mapped nodes. Furthermore, the method updates the knowledge base when the first confidence score meets a pre-defined threshold.

Abstract: A computer-implemented method for knowledge based ontology editing, is provided. The method receives a language instance to update a knowledge base, using a computer. The method semantically parses the language instance to detect an ontology for editing. The method maps one or more nodes for the ontology for editing based on an ontology database and the knowledge base. The method determines whether the mapped nodes are defined or undefined within the knowledge base. The method calculates a first confidence score based on a number of the defined and undefined mapped nodes. Furthermore, the method updates the knowledge base when the first confidence score meets a pre-defined threshold.

Abstract: A computer-implemented method for knowledge based ontology editing, is provided. The method receives a language instance to update a knowledge base, using a computer. The method semantically parses the language instance to detect an ontology for editing. The method maps one or more nodes for the ontology for editing based on an ontology database and the knowledge base. The method determines whether the mapped nodes are defined or undefined within the knowledge base. The method calculates a first confidence score based on a number of the defined and undefined mapped nodes. Furthermore, the method updates the knowledge base when the first confidence score meets a pre-defined threshold.

Abstract: Methods, systems, and computer program products for identifying one or more utterances that are likely to carry the intent of a speaker are provided herein. A method includes providing a transcript of utterances to a word weight scoring module to perform inverse document frequency based scoring on each word in the transcript, thereby generating a weight for each word; calculating a weight for each utterance in the transcript to generate weighted utterances by summing the weights or each constituent word in each utterance; comparing at least one weighted utterance to pre-existing example utterances carrying the intent of a speaker to determine a relevancy score for the at least one weighted utterance; and generating a ranked order of the at least one weighted utterance from highest to lowest intent relevancy score, wherein the highest intent relevancy score corresponds to the utterance which is most likely to carry intent of the speaker.

Abstract: Generating a natural language dialog by finding missing semantic information in a user question by comparing it to the closest question available in a question corpus. Incremental improved question precision is targeted during each round of dialog.