System that automatically identifies key words & key texts from a source document, such as a job description, and apply both (key words & text) as context in the automatic matching with another document, such as a resume, to produce a numerically scored result.

• US 20080222133A1
• Filed: 03/08/2007
• Published: 09/11/2008
• Est. Priority Date: 03/08/2007
• Status: Abandoned Application

• Current Assignee: Anthony Au, Chew-Ming Chiu
• Original Assignee: Anthony Au, Chew-Ming Chiu
• Inventors: Au, Anthony, Chiu, Chew-Ming
• Application Number:
  US11/683,992
• Publication Number:
  US 20080222133A1
• Time in Patent Office: Days
• US Class Current: 707/5
• CPC Class Codes: G06F 16/313 Selection or weighting of terms for indexing
• CPC Class Codes: G06F 16/951 Indexing; Web crawling techniques

Abstract

The present invention relates to a data processing system that automatically identifies key words & key texts from a source document, such as a job description, and apply both (key words & text) as context in the automatic matching with another document, such as a resume, to produce a numerically scored result.

Claims

1. A data processing system for matching two or more documents comprising:

a) building a Key Word Library from a plurality of source documents,

b) building a Key Text Library from a plurality of source documents; and

c) comparing a plurality of incoming document against the Key Text Library and the Key Word Library.

2. A system according to claim 1 in where said Key Word Library is build by identifying key words from a document.

3. A system according to claim 2 where said document is a job description.

4. A system according to claim 3 where said each job description is based on a combination of the industry and job function.

5. A system according to claim 1 which includes the step of compiling a list of pronouns.

6. A system according to claim 1 where each document will be parsed into key words.

7. A system according to claim 6 which includes eliminating all noise words until the amount of key words reaches a saturation state.

8. A system according to claim 7 where said saturation state is reached when no new words are found.

9. A system according to claim 1 where said weights can be locked.

10. A system according to claim 6 where a weight will be assigned to each key word.

11. A system according to claim 10 where said weight is calculated by taking the number of occurrences of each word and dividing it by the total number of words identified.

12. A system according to claim 7 where said weight is calculated by taking the number of occurrences of each word and dividing it by the total number of words identified at saturation.

13. A system according to claim 6 where each key word would be assigned a number.

14. A system according to claim 13 where said number is a hex number.

15. A system according to claim 6 where said Key Text Library is built using said key words.

16. A system according to claim 1 where said incoming documents will be parsed.

17. A system according to claim 16 where said document will be parsed into identify key words.

18. A system according to claim 17 where the key words would be matched with the Key Word Library.

19. A system according to claim 1 where two reference scores are produced.

20. A system according to claim 20 where one reference score is produced by adding the text weight together.