7 results about "Double array" patented technology

The application provides a double-array tree-based dictionary construction method and word query method, which comprises the following steps: generating a sensitive word tree based on the split text characters of each sensitive word and the arrangement order of the text characters, wherein each path in the sensitive word tree corresponds to a sensitive word; performing dictionary coding on the split text characters of the sensitive word after deduplication to obtain the character coding corresponding to each text character; determining the base coding of each character node in the sensitive word tree in layers according to at least one of random selection trial calculation, self-increment selection trial calculation, overall query selection trial calculation and preset data selection trial calculation; determining the storage location coding of the text character of each character node in the storage space based on the character coding corresponding to the text character of each character node and the base coding of the parent node of each character node, and taking the storage location coding of the parent node of each character node as the check coding of each character node, so as to construct a sensitive word dictionary.

The present application belongs to the technical field of data processing, and particularly relates to a digital archive automatic test paper management method and system based on big data analysis, which comprises the following steps: collecting test paper texts and cleaning, and constructing a double-array Trie tree with word frequency weight and semantic label; adopting positive and negative maximum matching bidirectional scanning, and outputting according to the word segmentation number and the ratio of the word frequency weight to the single word number on the segmentation path; using six types of character position conditional random fields containing stroke and pinyin first letter features to identify unregistered words, replacing inverse document frequency with archive category distribution entropy to calculate weighted TF-IDF, and feeding back and adjusting the weight; using genetic algorithm to group test papers based on weighted TF-IDF clustering, introducing distribution entropy disturbance recombination when the iteration tends to be stable, and using keyword hash value and distribution entropy to splice to form a version primary key. The present application can avoid the test paper grouping algorithm falling into local optimum, improve the scientificity and constraint satisfaction ability of the test paper generation, and realize the anti-duplication and traceable management of the test paper archive.

The invention relates to a multifunctional bitwise operation method and system based on double-array co-location index, in particular to the field of communication, and remarkably improves the reliability and efficiency of the operation system by introducing mode and data collaborative verification and structural consistency deep analysis. In the initialization stage, the compatibility of the operation mode and the input data is subjected to prospective judgment, operation errors and resource waste caused by mismatching of the data and the mode in a traditional method are effectively avoided, the system can intelligently analyze the operation requirement, structural consistency verification is conducted on the multi-source input data, and the system reliability is improved. On the basis of ensuring that subsequent operation is established on a reliable data basis, an optimized bitwise operation rule is adopted in an execution stage, calculation precision and consistency are guaranteed, final output is synthesized and optimized, the result is accurate, the structure is normative, the whole scheme realizes full-process optimization from data verification, operation execution to result output, and the calculation efficiency is improved. And the overall performance and stability of the system in processing complex and changeable scenes are greatly improved.

The invention provides a word bank construction method and a word query method based on a double-array tree, and the method comprises the steps: generating a sensitive word tree based on the split text characters of each sensitive word and the arrangement order of the text characters, and each path in the sensitive word tree corresponds to one sensitive word; carrying out dictionary coding after deduplication on the text characters split by the sensitive words to obtain character codes respectively corresponding to all the text characters; determining a basic code of each character node in the sensitive word tree in a layered manner according to at least one of random selection trial calculation, self-increase selection trial calculation, overall query selection trial calculation and preset data selection trial calculation in sequence; and based on the character code corresponding to the text character of each character node and the basic code of the father node of the character node, determining the storage position code of the text character of the character node in the storage space, and taking the storage position code of the father node of the character node as the check code of the character node to construct the sensitive word bank.

The invention provides a text sensitive word recognition method and a related device, and relates to the technical field of software, and the method comprises the following steps: obtaining an input text of a target service; calling a double-array AC automaton, wherein the double-array AC automaton is a memory structure which is constructed when the target service is initialized and is used for storing each sensitive word in the sensitive word bank; and matching the input text with the stored memory structure through the double-array AC automaton to obtain a sensitive word recognition result of the input text. According to the method, the double-array AC automaton is constructed to store a memory structure of the sensitive words in the sensitive word bank during service initialization, the sensitive word recognition result of the input text is further obtained through automatic matching of the double-array AC automaton during service calling, and quick response can be achieved during service calling by means of a multimode matching mode of the double-array AC automaton; the hardware influence of the sensitive word library does not need to be considered, and the efficiency and quality of text sensitive word recognition are greatly improved.

The application provides a dialogue information retrieval method, device, equipment, storage medium and program product. The method comprises the following steps: obtaining a target keyword corresponding to to-be-retrieved information; performing character traversal processing and node positioning processing on the target keyword according to a preset double-array dictionary tree to obtain node position information of the target keyword; wherein the preset double-array dictionary tree comprises a base array and a check array, the base array stores a transition base number of each node, the transition base number is used for calculating the node position of a corresponding character in the target keyword, and the check array stores a check identifier, the check identifier is used for checking the legality of node transition; querying a preset database according to the node position information; and determining target information corresponding to the target keyword according to a query result. The retrieval efficiency is improved.

The invention belongs to the technical field of cross of block chains and digital collections, and particularly relates to a three-dimensional digital collection block chain evidence storage optimization method. The specific process is as follows: S1, setting a layered block chain adaptation architecture, wherein the architecture comprises an asset layer, a protocol layer and an application layer; s2, batch casting: establishing a double-array association mechanism, and associating a basic information array and a three-dimensional feature array of the collection through a unique mapping key; pre-casting verification is executed before batch casting, Merkle roots passing verification are generated, and actual casting is executed only after root Hash uplink is passed; s3, three-dimensional recording of metadata: recording technical metadata and process metadata of the casting process, and establishing three-dimensional data network association metadata for constructing dynamic association; and S4, multi-dimensional traceability verification: realizing the multi-dimensional traceability verification through on-chain and off-chain cooperative verification, timestamp hierarchical verification and an intelligent contract traceability engine.