# US 2012/0254166 A1 · Signature Detection in E-Mails

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2012/0254166 A1
- Document ID: US20120254166A1
- Status: Published application
- Kind: A1
- Application number: 13/219,864
- Filed: 2011-08-29
- Published: 2012-10-04
- Earliest claimed: 2011-03-30
- Assignees: Google Inc.
- Inventors: Gaurav AGARWAL; Shailesh Kumar
- Web page: https://patentgrep.com/patent/US20120254166A1

## CPC

- G06Q 10/107: Computer-aided management of electronic mailing [e-mailing]
- G06F 16/353: into predefined classes
- G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

In an electronic discovery search tool, non-substantive information, such as signatures in e-mail, can bias a search tool and add processing time. A method and system for identifying recurring non-substantive text in documents has been developed so that non-substantive text may be processed or ignored by the search tool, as needed.

## Claims

### Claim 1

A method of identifying non-substantive text in a document, comprising:
capturing, by a processor, one or more blocks of text from each document in a set of documents;
determining, by the processor, the frequency of occurrence for each captured block of text in the set of documents;
identifying, by the processor one or more blocks of text in the set of documents as non-substantive text when the frequency of occurrence is above a received threshold; and
tagging, by the processor, the non-substantive text in each document in the set of documents.

### Claim 2 (depends on 1)

The method of claim 1, wherein the block of text is one or more lines of a document.

### Claim 3 (depends on 1)

The method of claim 1, further comprising filtering, by the processor, a corpus of documents in accordance with specified criteria to create the set of documents.

### Claim 4 (depends on 1)

The method of claim 1, wherein the set of documents is a first set of documents, and further comprising tagging non-substantive text in a second set of documents when the text is identified as non-substantive in the first set of documents.

### Claim 5 (depends on 1)

The method of claim 1, wherein the step of determining the frequency of occurrence for each captured block in the set of documents comprises:
generating a checksum for each captured block of text in the set of documents; and
determining the frequency of occurrence for each checksum in the set of documents.

### Claim 6 (depends on 5)

The method of claim 5, wherein the checksum is an MD5 checksum.

### Claim 7 (depends on 5)

The method of claim 5, wherein the frequency is determined by the percentage of e-mails in which the checksum occurs.

### Claim 8 (depends on 5)

The method of claim 5, wherein generating a checksum comprises generating a checksum for each unit of text in each document in a first set of documents, and tagging comprises tagging blocks of text in a second set of documents.

### Claim 9 (depends on 8)

The method of claim 8, wherein the first set of documents is a subset of the second set of documents.

### Claim 10

A system for identifying non-substantive text in a document, comprising:
a capturer to capture one or more blocks of text from each document in a set of documents;
a generator that generates a checksum for each captured block of text;
a calculator to calculate a frequency of occurrence of each checksum in the set of documents; and
a tagger for tagging blocks of text as non-substantive when a frequency of occurrence is above a threshold.

### Claim 11 (depends on 10)

The system of claim 10, wherein the block of text is one or more lines of a document.

### Claim 12 (depends on 10)

The system of claim 10, further comprising a filter module that filters a corpus of documents in accordance with specified criteria to create the set of documents.

### Claim 13 (depends on 10)

The system of claim 10, wherein the generated checksum is an MD5 checksum.

### Claim 14 (depends on 10)

The system of claim 10, wherein the calculated frequency of occurrence is determined by the percentage of documents in which the checksum occurs.

### Claim 15

A system, comprising:
a processor; and
a memory, the memory having instructions stored thereon that, when executed by the processor, cause the processor to perform a method of identifying non-substantive text in a document, the method comprising:
capturing one or more blocks of text from each document in a set of documents;
determining the frequency of occurrence for each captured block of text in the set of documents;
identifying one or more blocks of text in the set of documents as non-substantive text when the frequency of occurrence is above a received threshold; and
tagging the non-substantive text in each document in the set of documents.

### Claim 16 (depends on 15)

The system of claim 15, wherein the block of text is one or more lines of a document.

### Claim 17 (depends on 15)

The system of claim 15, the method further comprising filtering a corpus of documents in accordance with specified criteria to create the set of documents.

### Claim 18 (depends on 15)

The system of claim 15, wherein the set of documents is a first set of documents, and wherein the method further comprises tagging non-substantive text in a second set of documents when the text is identified as non-substantive in the first set of documents.

### Claim 19 (depends on 15)

The system of claim 15, wherein the step of determining the frequency of occurrence for each captured block in the set of documents comprises:
generating a checksum for each captured block of text in the set of documents; and
determining the frequency of occurrence for each checksum in the set of documents.

### Claim 20 (depends on 19)

The system of claim 19, wherein the checksum is an MD5 checksum.

### Claim 21 (depends on 19)

The system of claim 19, wherein the frequency is determined by the percentage of documents in which the checksum occurs.

### Claim 22 (depends on 19)

The system of claim 19, wherein the step of generating a checksum comprises generating a checksum for each unit of text in each document in a first set of documents, and the step of tagging comprises tagging blocks of text in a second set of documents.

### Claim 23 (depends on 18)

The system of claim 18, wherein the first set of documents is a subset of the second set of documents.
