Techniques are disclosed for identifying hypocrisy in text. A computer system creates, from fragments of text, a syntactic tree that represents syntactic relationships between words in the fragments. The system identifies, in the syntactic tree, a first entity and a second entity. The system further determines that the first entity is opposite to the second entity. The system further determines a first sentiment score for a first fragment comprising the first entity and a second sentiment score for a second fragment comprising the second entity. The system, responsive to determining that the first sentiment score and the second sentiment score indicate opposite emotions, identifies the text as comprising hypocrisy and providing the text to an external device.

Systems, devices, and methods of the present invention create a searchable index that includes informative portions of text. In an example, a computer-implemented method creates a discourse tree from a body of text. For each non-terminal node in the discourse tree, the method identifies a rhetorical relationship associated with the non-terminal node. The method labels each terminal node associated with the non-terminal node as either a nucleus or a satellite. The method further accesses a rule associated with the rhetorical relationship, and selects, based on the rule, selects the fragment associated with the nucleus. The method creates a searchable index including the selected fragments.

A software voting or prediction system iteratively solicits participant preferences between members of a set, with a binary tree built used to minimize the number of iterations required. As each member of the set is considered, it is pairwise-compared with select members represented by nodes already in the binary tree, with iterations beginning at a root node of the tree and continuing to a leaf node. The newly considered member is placed as a new leaf node, and the tree is height-rebalanced as appropriate. Red-black tree coloring and tree rotation rules are optionally used for this purpose. Yes/no preference tallies are kept for each member of the set throughout the tree-building process and are ultimately used for scoring. Height-rebalancing of the tree helps minimize the number of iterations needed to precisely score each member of the set relative to its alternatives.

A computer-implemented method for extracting semantic relations is disclosed. In the method, a plurality of hierarchal structures that originates from a corpus of documents is obtained. Each hierarchal structure includes a plurality of elements having respective recitations included in a corresponding document. In the method, for each predetermined relationship between ancestor and descendant elements in the hierarchal structures, a first keyword list is extracted from the ancestor element and a second keyword list is extracted from the descendant element. A statistical index is calculated for each pair of first and second keywords using the first keyword lists and the second keyword lists. The index indicates a strength of association between the first and second keywords. In the method, a candidate list of keyword pairs having semantic relationships is output using the statistical index calculated for each pair.

The present disclosure relates generally to Lightweight Directory Access Protocol (LDAP), and more particularly, to techniques for improving query performance on an LDAP server. One particular technique includes receiving a LDAP query having search criteria, identifying one or more search filters within the search criteria, determining candidate indices based on the identified one or more search filters, evaluating the candidate indices based on statistics collected for the candidate indices, selecting one or more indices from the candidate indices based on the evaluating, and executing the LDAP query on an LDAP directory using the selected one or more indices.

A phrase that includes a trigger word that modifies a meaning within the phrase is received. The trigger word is identified. The words of the phrase that are modified by the trigger word are identified by analyzing features of the phrase that link the trigger word to other words. The phrase is interpreted by modifying the second subset of words according to the modification of the trigger word.

A digital data processor includes an instruction memory storing instructions specifying a data processing operation and a data operand field, an instruction decoder coupled to the instruction memory for recalling instructions from the instruction memory and determining the operation and the data operand, and an operational unit coupled to a data register file and to an instruction decoder to perform a data processing operation upon an operand corresponding to an instruction decoded by the instruction decoder and storing results of the data processing operation. The operational unit is configured to perform a table write in response to a look up table initialization instruction by duplicating at least one data element from a source data register to create duplicated data elements, and writing the duplicated data elements to a specified location in a specified number of at least one table and a corresponding location in at least one other table.

The present disclosure provides systems and methods for building an inventory database with automatic labeling. A system can maintain a hierarchical concept tree including labels. Each of the labels is associated with a set of attributes and a respective embedding. The system can receive, from a provider device, a request to generate labels for an item of media content. The request can include a request attribute. The system can generate, using a gated categorical model, document embeddings for the item of media content. The system can select a subset of the labels based on the request attribute. The system can determine a respective label score for each label of the subset of the labels based on the document embeddings and the respective embedding of the label. The system can provide a selected label of the subset of the labels based on the respective label score of the selected label.

The present disclosure includes a computing device, a system, and method for performing a spreadsheet recalculation algorithm. In one embodiment, the computing device includes an electronic processor, and a memory coupled to the electronic processor. The memory includes Directed Acyclic Graph (DAG) data having a plurality of nodes, each node of the plurality of nodes having at least one of a constant value or one or more inputs, and program instructions. The program instructions, when executed by the electronic processor, cause the electronic processor to change the plurality of nodes, and update one or more affected nodes of the plurality of nodes based on the change to the plurality of nodes, the one or more affected nodes being less than all of the plurality of nodes.

Programs, systems, and methods for generating a support tree for automated resolution of user issues. In some embodiments, historical data may be obtained from a history of support interactions including historical issues and solutions to the historical issues. Most used solutions may be determined and stored with associated historical issues. Clusters of issues and solutions may be generated and labeled for generation of support tree nodes. Furthermore, solutions may be correlate such that a plurality of solutions may be provided for the resolving user issues. In some embodiments, issue data indicative of user issues may be provided by users. As the user provides issue data, deflections between nodes on the support tree may narrow a field of potential solutions to one or more solutions to be provided to the user.