1421 results about "Categorization" patented technology

The present invention relates generally to the classification of items into categories, and more generally, to the automatic selection of different classifiers at different places within a hierarchy of categories. An exemplary hierarchical categorization method uses a hybrid of different classification technologies, with training-data based machine-learning classifiers preferably being used in those portions of the hierarchy above a dynamically defined boundary in which adequate training data is available, and with a-priori classification rules not requiring any such training-data being used below that boundary, thereby providing a novel hybrid categorization technology that is capable of leveraging the strengths of its components. In particular, it enables the use of human-authored rules in those finely divided portions towards the bottom of the hierarchy involving relatively close decisions for which it is not practical to create in advance sufficient training data to ensure accurate classification by known machine-learning algorithms, while still facilitating eventual change-over within the hierarchy to machine learning algorithms as sufficient training data becomes available to ensure acceptable performance in a particular sub-portion of the hierarchy.

A useful object-oriented knowledge base system is provided, which comprises an 'object-oriented knowledge base', an inference mechanism, and an ideal dictionary, etc. Sentences used as a 'rule' and / or as a 'fact' in the 'object-oriented knowledge base' are described according to a simple English grammar. Hierarchical structure of nouns-system in an 'ideal thesaurus' is constructed, on the basis of special kind of 'object-oriented-lexical-definition of nouns' recorded in the ideal dictionary. Lexical meaning of a verb whose meaning is specific are derived from that of a verb whose meaning is general and universal, by using 'dichotomy' on the basis of C-language-like way of description of English sentences in the lexicon. The hierarchical structure of verbs-system in an 'ideal classification table' is constructed on the basis of them. The Inference mechanism processes not only mathematically well defined equations but, also simple English sentences, by making full use of the 'ideal thesaurus' and the 'ideal classification table', on the basis of specially contrived 'sentence based object-oriented categorical syllogism'.

Systems, devices, and methods of the present invention detect argumentation in text. In an example, an application executing on a computing device accesses text comprising fragments. The application creates a discourse tree from the text. The discourse tree includes nodes, each nonterminal node representing a rhetorical relationship between two of the fragments and each terminal node of the nodes of the discourse tree is associated with one of the fragments. The application matches each fragment that has a verb to a verb signature, thereby creating a communicative discourse tree. The application determines whether the communicative discourse tree represents text that includes argumentation by applying a classification model trained to detect argumentation to the communicative discourse tree.

Systems, devices, and methods of the present invention uses noisy-robust discourse trees to determine a rhetorical relationship between one or more sentences. In an example, a rhetoric classification application creates a noisy-robust communicative discourse tree. The application accesses a document that includes a first sentence, a second sentence, a third sentence, and a fourth sentence. The application identifies that syntactic parse trees cannot be generated for the first sentence and the second sentence. The application further creates a first communicative discourse tree from the second, third, and fourth sentences and a second communicative discourse tree from the first, third, and fourth sentences. The application aligns the first communicative discourse tree and the second communicative discourse tree and removes any elementary discourse units not corresponding to a relationship that is in common between the first and second communicative discourse trees.