Invention Grant
- Patent Title: Method and equipment for determining common subsequence of text strings
-
Application No.: US15770486Application Date: 2016-09-21
-
Publication No.: US10769192B2Publication Date: 2020-09-08
- Inventor: Xiaochuan Wan , Hanzhao Gao
- Applicant: BEIJING HANSIGHT TECH CO., LTD.
- Applicant Address: CN Beijing
- Assignee: BEIJING HANSIGHT TECH CO., LTD.
- Current Assignee: BEIJING HANSIGHT TECH CO., LTD.
- Current Assignee Address: CN Beijing
- Agency: Cherskov Flaynik & Gurda, LLC
- Priority: com.zzzhc.datahub.patent.etl.us.BibliographicData$PriorityClaim@2422ba31
- International Application: PCT/CN2016/099631 WO 20160921
- International Announcement: WO2017/067364 WO 20170427
- Main IPC: G06F16/35
- IPC: G06F16/35 ; G06F16/00 ; G06F21/55 ; G06F40/186 ; G06F40/279 ; G06F16/31
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.
Public/Granted literature
- US20190057148A1 METHOD AND EQUIPMENT FOR DETERMINING COMMON SUBSEQUENCE OF TEXT STRINGS Public/Granted day:2019-02-21
Information query
