Longest-common-subsequence detection for common synonyms

Data processing: database and file management or data structures – Database and file access – Record – file – and data search and comparisons

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C707S728000, C707S708000

Reexamination Certificate

active

08001136

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.

REFERENCES:
patent: 5331556 (1994-07-01), Black
patent: 5594641 (1997-01-01), Kaplan
patent: 5832474 (1998-11-01), Lopresti
patent: 6466901 (2002-10-01), Loofbourrow
patent: 7155427 (2006-12-01), Prothia
patent: 2003/0061122 (2003-03-01), Berkowitz
patent: 2004/0064447 (2004-04-01), Simske et al.
patent: 2004/0225667 (2004-11-01), Hu et al.
patent: 2005/0120020 (2005-06-01), Carus et al.
patent: 2005/0210003 (2005-09-01), Tsay et al.
patent: 2005/0278292 (2005-12-01), Ohi et al.
patent: 2006/0218136 (2006-09-01), Surakka et al.
patent: 2007/0011154 (2007-01-01), Musgrove et al.
patent: 2007/0162481 (2007-07-01), Millett
Toru Kasai; Linear- Time Longest Common Prefix Computation in Suffis Arrays and It's Applications; 2006;vol. 2089/2006; pp. 181-192.
Office Action prepared for related case (U.S. Appl. No. 11/582,767), mailed from USPTO on Sep. 15, 2008.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Longest-common-subsequence detection for common synonyms does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Longest-common-subsequence detection for common synonyms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Longest-common-subsequence detection for common synonyms will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2739810

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.