| 摘要 |
<p>A one-dimensional liner space-based method for implementing trie tree dictionary search: one-dimensional liner space trie tree dictionary data is generated; a to-be-queried entry key is determined on the basis of a user input; and, a query is implemented on the basis of a current state of the entry key. In the trie tree dictionary data that is constructed in a one-dimensional linear space, dictionary loading and search speeds are increased, and rapid retrieval of all prefix terms of an entry is allowed. In addition, trie tree dictionary search implemented on the basis of one-dimensional linear space allows for solving of the problem of a conflict that is caused by insertion of a new state and is found in a process of trie tree construction of a conventional trie tree dictionary data search, thus allowing for prevention of the problem of a movement of a large amount of dictionary data caused by the conflict.</p> |
