Longest-common-subsequence detection for common synonyms
US8001136B1 · kind B1 · utility
40Cited by
5References
15Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Jul 2, 2008 |
| Grant date | Aug 16, 2011 |
| Priority date | — |
| Expiry date | Aug 26, 2029 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/36
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
One embodiment of the present invention provides a system for identifying synonym candidates. During operation, the system receives a first term and a second term. The system then determines a length of the longer one of the first and second terms, and determines a longest common subsequence of the two terms. The system further produces a result to indicate whether the two terms are synonym candidates based on the length of the longer term and a length of the longest common subsequence of the two terms.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.