Back to results
US 2019/0057148 A1Published application
Method and equipment for determining common subsequence of text strings
AssigneeBeijing Hansight Tech Co., Ltd.
InventorsXiaochuan WAN, Hanzhao GAO
Life of this patent
Estimating the term…
Abstract
A method for determining a longest common subsequence in a plurality of text strings. The method comprises: separately converting a plurality of text strings into word sequences (S100); classifying the word sequences (S400); and performing longest common subsequence computation on every class (S500). The time needed by LCS computation can be saved by classifying text strings.
Claims13
A method for determining the longest common subsequence among a plurality of text strings, comprising:
- converting a plurality of the text strings into word sequences respectively;
- converting the word sequences into corresponding word sets respectively;
- calculating the minimum hash value for each word set;
- classifying the word sequences according to the minimum hash value;
- and
- performing the longest common subsequence operation in each category.
3 more elements
An apparatus for determining the longest common subsequence among a plurality of text strings, comprising:
- a first conversion device 402 for converting a plurality of the text strings into word sequences respectively;
- a second conversion device 404 for converting the word sequences into corresponding word sets respectively;
- a first operation device 406 for calculating the minimum hash value for each word set;
- a classification device 408 for classifying the word sequences according to the minimum hash value;
- and
- a second operation device 410 for performing the longest common subsequence operation in each category.
3 more elements
Dependencies are inferred from the claim text.