-
1.发明申请公开(公告)号：US20170255692A1
公开(公告)日：2017-09-07
申请号：US15444267
申请日：2017-02-27
发明人： Peng LEI
CPC分类号： G06F16/3337 , G06F16/3323 , G06F16/3331 , G06F16/334 , G06F17/2836 , G06F17/2863 , G06N3/004 , G10L15/00 , G10L15/02 , G10L15/265
摘要： A method for providing one or more search suggestion candidates for an input key comprises: (1) acquiring characteristic information of the input key; (2) creating a characteristic DFA (Deterministic Finite Automaton) of the input key based on the characteristic information of the input key; (3) searching the characteristic DFA of the input key in a predetermined database DFA having a plurality of bridge transitions each linking a bridge head state with a bridge tail state, so as to identify a bridge head state that matches the characteristic DFA of the input key, wherein each bridge head state of the predetermined database DFA corresponds to a final state of a characteristic DFA of a target candidate which is created based on characteristic information of the target candidate; and (4) outputting one or more target candidates corresponding to a bridge tail state linked with the identified bridge head state as the search suggestion candidate for the input key.
-
公开(公告)号：US20170255670A1
公开(公告)日：2017-09-07
申请号：US15444256
申请日：2017-02-27
发明人： Peng LEI
IPC分类号： G06F17/30
CPC分类号： H03M7/3097 , H03M7/3091 , H03M7/55
摘要： According to one aspect of the present application, a method for data compression comprises: creating a first trie for a first set of strings, the first set of strings comprising a plurality of raw data strings, wherein a trie consists of a plurality of nodes linked through parent-child relation, and wherein each edge of the trie is of at least one character and the edge corresponds to a state transition from a parent node of the edge to a child node of the edge; collecting edges of the first trie longer than a predetermined length and making these edges a first subset of strings of the first trie; segmenting a string in the first subset of strings into two or more fragments when the string satisfies a predetermined condition and collecting all segmented fragments and all un-segmented strings in the first subset of strings as a segmented set of strings; and storing the first set of strings using the first trie and the segmented set of strings so as to compress the raw data strings.
-
搜索结果
2 条记录 (耗时 0.014 秒)
