Term matching method based on a cedar double-array trie algorithm

Abstract

The invention discloses a term matching method based on a cedar double-array trie algorithm. The method is characterized in comprising a step of establishing an index and a step of carrying out term search matching through the index. The step of establishing the index comprises the sub-steps of traversing a database to obtain a term set, and calling the cedar double-array trie to insert terms, thereby forming the index of the term set, wherein the cedar double-array trie comprise a structure array which taken a reference value and a check value as members and a circular queue of which volume is the same to that of the structure array. Through application of the cedar double-array algorithm to the index establishment of a term matching engine and term search according to the index, the efficiency of the term matching engine is greatly improved. Moreover, according to the algorithm, the deficiency that a classic double-array algorithm libdatrie is very low in speed to the disadvantage of rapid data reconstruction when the index is established for a great number of terms is avoided. A binary tree is taken as an auxiliary structure, so the whole double-array trie can be rapidly restored.

Description

technical field [0001] The invention belongs to the field of computer communication, in particular to a method for term matching based on a cedar double-array trie algorithm. Background technique [0002] At present, the translation industry continues to expand, and the growth rate of corpus and terminology is relatively fast, and the number is also relatively large. A large number of terms are the cornerstone of translation, and effective information technology must be used to manage them. At present, the original text, translation, and other detailed information about terminology within the company are stored in the mongo database. It is very slow to directly query the database to obtain the original text or translation, and the original text or translation may be too long, and it is not convenient to use it as an index field. There is an existing set of term matching engine implementation, which uses a double array algorithm to create a peripheral index for the term, and...

AI Technical Summary

Problems solved by technology

[0005] The technical problem to be solved by the present invention is that the current term matching engine based on the database is relatively slow in word search efficiency, and the way to improve this problem is to build a fast index for the terms in the database, and the introduction of a double array dictionary tree can solve a large number of problems. The problem of slow index building and slow query of terms

Images