GENERATING DATA RECORDS BASED ON PARSING

• US 20140279864A1
• Filed: 12/30/2013
• Published: 09/18/2014
• Est. Priority Date: 03/14/2013
• Status: Abandoned Application

• Current Assignee: Google LLC (Alphabet Inc.), Everdisplay Optonics (Shanghai) Limited
• Original Assignee: Google Inc. (Alphabet Inc.)
• Inventors: Lopyrev, Mikhail, Jain, Gaurav, Lou, Jinan, Narayan, Bote Deepak, Repeshko, Vitaly, Chan, Chengling
• Application Number:
  US14/143,835
• Publication Number:
  US 20140279864A1
• Time in Patent Office: Days
• US Class Current: 707/609
• CPC Class Codes: G06F 16/258 Data format conversion from or to a database
• CPC Class Codes: G06F 40/205 Parsing

Abstract

Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for receiving a first document, the first document being associated with a user, executing a plurality of parsers, each parser of the plurality of parsers processing the first document to provide one or more first data values, merging the one or more first data values provided from the plurality of parsers to populate a data record having one or more data fields, the data record being specific to the user, and storing the data record in computer-readable memory.

Claims

1. A computer-implemented method executed using one or more processors, the method comprising:

receiving, by the one or more processors, a first document, the first document being associated with a user;

executing, by the one or more processors, a plurality of parsers, each parser of the plurality of parsers processing the first document to provide one or more first data values;

merging, by the one or more processors, the one or more first data values provided from the plurality of parsers to populate a data record having one or more data fields, the data record being specific to the user; and

storing the data record in computer-readable memory.

2. The method of claim 1, wherein executing the plurality of parsers comprises:

identifying that two or more of the plurality of parsers have provided conflicting first data values corresponding to a common data field of the data record;

ranking the two or more parsers providing the conflicting first data values; and

selecting the first data values provided by the highest ranked parser as the first data values provided from the plurality of parsers.

3. The method of claim 1, wherein executing the plurality of parsers comprises:

identifying one or more unpopulated data fields among the one or more data fields in the data record;

defining a search query based on the one or more unpopulated data fields;

executing a search based on the search query, the search providing at least one search result that is responsive to the search query and descriptive of data values for one or more of the one or more unpopulated data fields; and

providing the search result as the data values to populate the one or more unpopulated data fields.

4. The method of claim 1, further comprising:

receiving a second document, the second document being associated with the user;

executing the plurality of parsers, each parser of the plurality of parsers processing the second document to provide one or more second data values;

merging the second data values provided from the plurality of parsers to update the data record;

detecting, based on one or more of the first data values and one or more of the second data values, that the first document and the second document correspond to the data record; and

storing the data record in computer-readable memory.

5. The method of claim 1, wherein one or more of the plurality of parsers is a generic parser.

6. The method of claim 1, wherein one or more of the plurality of parsers is a pre-defined parser.

7. The method of claim 1, wherein one or more of the plurality of parsers is a template-based parser.

8. A system comprising:

a data store for storing data; and

one or more processors configured to interact with the data store, the one or more processors being further configured to perform operations comprising;

receiving, by the one or more processors, a first document, the first document being associated with a user;

executing, by the one or more processors, a plurality of parsers, each parser of the plurality of parsers processing the first document to provide one or more first data values;

merging, by the one or more processors, the one or more first data values provided from the plurality of parsers to populate a data record having one or more data fields, the data record being specific to the user; and

storing the data record in computer-readable memory.

9. The system of claim 8, wherein executing the plurality of parsers comprises:

identifying that two or more of the plurality of parsers have provided conflicting first data values corresponding to a common data field of the data record;

ranking the two or more parsers providing the conflicting first data values; and

selecting the first data values provided by the highest ranked parser as the first data values provided from the plurality of parsers.

10. The system of claim 8, wherein executing the plurality of parsers comprises:

identifying one or more unpopulated data fields among the one or more data fields in the data record;

defining a search query based on the one or more unpopulated data fields;

executing a search based on the search query, the search providing at least one search result that is responsive to the search query and descriptive of data values for one or more of the one or more unpopulated data fields; and

providing the search result as the data values to populate the one or more unpopulated data fields.

11. The system of claim 8, the operations further comprising:

receiving a second document, the second document being associated with the user;

executing the plurality of parsers, each parser of the plurality of parsers processing the second document to provide one or more second data values;

merging the second data values provided from the plurality of parsers to update the data record;

detecting, based on one or more of the first data values and one or more of the second data values, that the first document and the second document correspond to the data record; and

storing the data record in computer-readable memory.

12. The system of claim 8, wherein one or more of the plurality of parsers is a generic parser.

13. The system of claim 8, wherein one or more of the plurality of parsers is a pre-defined parser.

14. The system of claim 8, wherein one or more of the plurality of parsers is a template-based parser.

15. A computer readable medium storing instructions that, when executed by one or more processors, cause the one or more processors to perform operations comprising:

receiving, by the one or more processors, a first document, the first document being associated with a user;

executing, by the one or more processors, a plurality of parsers, each parser of the plurality of parsers processing the first document to provide one or more first data values;

merging, by the one or more processors, the one or more first data values provided from the plurality of parsers to populate a data record having one or more data fields, the data record being specific to the user; and

storing the data record in computer-readable memory.

16. The computer readable medium of claim 15, wherein executing the plurality of parsers comprises:

identifying that two or more of the plurality of parsers have provided conflicting first data values corresponding to a common data field of the data record;

ranking the two or more parsers providing the conflicting first data values; and

selecting the first data values provided by the highest ranked parser as the first data values provided from the plurality of parsers.

17. The computer readable medium of claim 15, wherein executing the plurality of parsers comprises:

identifying one or more unpopulated data fields among the one or more data fields in the data record;

defining a search query based on the one or more unpopulated data fields;

executing a search based on the search query, the search providing at least one search result that is responsive to the search query and descriptive of data values for one or more of the one or more unpopulated data fields; and

providing the search result as the data values to populate the one or more unpopulated data fields.

18. The computer readable medium of claim 15, the operations further comprising:

receiving a second document, the second document being associated with the user;

executing the plurality of parsers, each parser of the plurality of parsers processing the second document to provide one or more second data values;

merging the second data values provided from the plurality of parsers to update the data record;

detecting, based on one or more of the first data values and one or more of the second data values, that the first document and the second document correspond to the data record; and

storing the data record in computer-readable memory.

19. The computer readable medium of claim 15, wherein one or more of the plurality of parsers is a generic parser.

20. The computer readable medium of claim 15, wherein one or more of the plurality of parsers is a pre-defined parser or a template-based parser.