METHOD AND SYSTEM FOR LEXICAL MAPPING BETWEEN DOCUMENT SETS HAVING A COMMON TOPIC

• US 20090292697A1
• Filed: 05/26/2009
• Published: 11/26/2009
• Est. Priority Date: 04/22/2004
• Status: Active Grant

• Current Assignee: Uber Technologies, Inc.
• Original Assignee: Hiromi Oda
• Inventors: Oda, Hiromi
• Granted Patent: US 8,065,306 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/353 into predefined classes
• CPC Class Codes: Y10S 707/99933 Query processing, i.e. searching
• CPC Class Codes: Y10S 707/99935 Query augmenting and refining, e.g. inexact access
• CPC Class Codes: Y10S 707/99945 Object-oriented database structure processing

Abstract

Terms (e.g., words) used in an expert domain that correspond to terms in a naïve domain are detected when there are no vocabulary pairs or document pairs available for the expert and naive domains. Documents known to be descriptions of identical topics and written in the expert and naive domains are collected by searching the Internet. The frequencies of terms that occur in these documents are counted. The counts are used to calculate correspondences between the vocabularies of the expert and naive language expressions.

Claims

1-6. -6. (canceled)

7. A method of detecting (from a first document set and a second document set having a common topic, the document sets having been retrieved on the basis of a term list) (a) terms in the second document set that correspond to specific terms in the first document set, and (b) terms in first document set that correspond to specific terms in the second document set, comprising:

calculating the probability P(A) of the co-occurrence of a specific term pair, which includes a term from the first document set and a term from the second documents set;

calculating the probability P(B) of the lack of co-occurrences of the first term of a term pair in question occurring in the first document set and the second term of said term pair not occurring in the second document set;

calculating a maximum likelihood ratio on the basis of P(A) and P(B);

extracting all term pair combinations having a maximum likelihood ratio that exceeds a predetermined threshold value;

selecting a predetermined number of terms in a descending order of the values of maximum likelihood ratios from the terms in first document set that correspond to a specific term in the second document set, and adopt the selected terms as the candidate terms of the first document set that correspond to specific terms in the second document set; and

selecting a predetermined number of terms in a descending order of maximum likelihood ratios from the terms in the second document set that correspond to a specific term in the first document set, and adopt the selected terms as the candidate terms of the second document set that correspond to the specific terms in the first document set.

16. A document processing system for performing the method of claim 7.

25. A memory or computer readable storage medium for causing a computer to perform the method of claim 7.

8-15. -15. (canceled)

17-24. -24. (canceled)

26-27. -27. (canceled)