# US 2023/0274083 A1 · Digital rationalization of correspondence

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

- Number: US 2023/0274083 A1
- Document ID: US20230274083A1
- Status: Published application
- Kind: A1
- Application number: 17/681,293
- Filed: 2022-02-25
- Published: 2023-08-31
- Earliest claimed: 2022-02-25
- Assignees: Accenture Global Solutions Limited
- Applicants: Accenture Global Solutions Limited
- Inventors: Neeta Suresh PARVATIKAR; Yathindra VENKATARAMANAPPA; Wajid Mansur GAVANDI; Malvika SAXENA; Ishmeet A. KAUR; John W. RIZZETTO; Karen S. WEIDMAN; Ashna Mausin KAZI; Sanjeev CHATAKONDA
- Web page: https://patentgrep.com/patent/US20230274083A1

## CPC

- G06F 40/186: Templates
- G06F 16/93: Document management systems
- G06F 40/174: Form filling; Merging
- G06F 40/197: Version control (for software G06F8/71)
- G06F 40/30: Semantic analysis
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A system and method for facilitating digital rationalization of a correspondence is disclosed. The system may include a processor including DTRE. The DTRE may receive a plurality of templates from at least one database coupled to the processor. The plurality of templates may pertain to a given correspondence. The DTRE may process the plurality of templates to identify static objects and dynamic objects. The static objects may be indicative of components that may be common across the plurality of templates. The dynamic objects may be indicative of components that may vary across the plurality of templates. The DTRE may generate, at least one rationalized template based on analysis of the identified static and dynamic objects. The at least one rationalized template may optimally represent the given correspondence, and may enable transmission of the given correspondence having content pertaining to any of the plurality of templates.

## Claims

### Claim 1

A system comprising:
a document template rationalization engine, which when executed using
a processor, causes the engine to:
receive, from at least one database, a plurality of templates for a given correspondence;
process the plurality of templates to identify static objects and dynamic objects, wherein the static objects are indicative of components that are common across the plurality of templates, and wherein the dynamic objects are indicative of components that vary across the plurality of templates; and
generate, based on analysis of the identified static and dynamic objects, at least one rationalized template that optimally represents the given correspondence, and enables transmission of the given correspondence having content pertaining to any of the plurality of templates.

### Claim 2 (depends on 1)

The system as claimed in claim 1, wherein processing of the plurality of templates enables further identification of recurring objects that are indicative of components that re-occur across a set of templates of the plurality of templates.

### Claim 3 (depends on 1)

The system as claimed in claim 1, wherein the plurality of templates are stored across multiple document file formats.

### Claim 4 (depends on 1)

The system as claimed in claim 1, wherein the at least one rationalized template is generated by:
determining variances between the dynamic objects;
rationalizing the determined variances; and
merging the rationalized variances with the static objects to generated the at least one rationalized template.

### Claim 5 (depends on 4)

The system as claimed in claim 4, wherein the variances between the dynamic objects are determined based on evaluation of an interstate variance possibility.

### Claim 6 (depends on 1)

The system as claimed in claim 1, wherein the document template rationalization engine is executed across a plurality of stages, each stage of the plurality of stages being based on how the plurality of templates are stored within and/or across one or more legacy systems.

### Claim 7 (depends on 1)

The system as claimed in claim 1, wherein the at least one rationalized template is used to generate multiple forms of the given correspondence based on a set of rules.

### Claim 8 (depends on 1)

The system as claimed in claim 1, wherein a unique identifier is associated with each of the static object and/or the dynamic object.

### Claim 9 (depends on 1)

The system as claimed in claim 1, wherein the at least one rationalized template is indicative of static objects and dynamic objects that are required for generation of the given correspondence having content pertaining to any of the plurality of templates.

### Claim 10 (depends on 1)

The system as claimed in claim 1, wherein the static objects and the dynamic objects are portions of text that form part of the plurality of templates.

### Claim 11 (depends on 1)

The system as claimed in claim 1, wherein the processing further comprises assessing occurrence of each identified object across each template of the plurality of templates, based on which the identified object is determined to be unique, common, or re-occurring.

### Claim 12 (depends on 1)

The system as claimed in claim 1, wherein the document template rationalization engine is operatively coupled with an artificial intelligence (AI) based correspondence rationalization engine, wherein the AI based correspondence rationalization engine, based on the analysis of the identified static and dynamic objects, enables generation of the at least one rationalized template based on AI based paraphrasing and semantic analysis.

### Claim 13 (depends on 12)

The system as claimed in claim 12, wherein the AI based correspondence rationalization engine comprises a learning unit that receives the plurality of templates for the given correspondence and learns from the generated at least one rationalized template for the given correspondence so as to be able to revise the at least one rationalized template upon receipt of another template for the given correspondence based on a AI document classification unit.

### Claim 14 (depends on 12)

The system as claimed in claim 12, wherein the AI based correspondence rationalization engine analyses a second correspondence requiring rationalization and provides recommended groupings of similar correspondences.

### Claim 15 (depends on 1)

The system s claimed in claim 1, wherein a testing framework may be utilized to identify comprehensive testing flows on a pre-defined level for evaluation of performance of the system with respect to the digital rationalization, wherein the pre-defined level may be at least of a template level, generated correspondence level and end-to-end (E2E) level.

### Claim 16

A method for digital rationalization of a correspondence, the method comprising:
receiving, by a processor, a plurality of templates for a given correspondence;
processing, by the processor, the plurality of templates to identify static objects and dynamic objects, wherein the static objects are indicative of components that are common across the plurality of templates, and wherein the dynamic objects are indicative of components that vary across the plurality of templates; and
generating, by the processor, based on analysis of the identified static and dynamic objects, at least one rationalized template that optimally represents the given correspondence, and enables transmission of the given correspondence having content pertaining to any of the plurality of templates.

### Claim 17 (depends on 16)

The method as claimed in claim 16, the processing of the plurality of templates comprising:
identifying, by the processor, recurring objects that are indicative of components that re-occur across a set of templates of the plurality of templates.

### Claim 18 (depends on 16)

The method as claimed in claim 16, the generating of the at least one rationalized template comprising:
determining, by the processor, variances between the dynamic objects;
rationalizing, by the processor, the determined variances; and
merging, by the processor, the rationalized variances with the static objects to generated the at least one rationalized template.

### Claim 19

A non-transitory computer readable medium, wherein the readable medium comprises machine executable instructions that are executable by a processor to:
receive a plurality of templates for a given correspondence;
process the plurality of templates to identify static objects and dynamic objects, wherein the static objects are indicative of components that are common across the plurality of templates, and wherein the dynamic objects are indicative of components that vary across the plurality of templates; and
generate, based on analysis of the identified static and dynamic objects, at least one rationalized template that optimally represents the given correspondence, and enables transmission of the given correspondence having content pertaining to any of the plurality of templates.

### Claim 20 (depends on 19)

The non-transitory computer readable medium as claimed in claim 19, wherein the readable medium comprises machine executable instructions that are executable by a processor to:
determine variances between the dynamic objects;
rationalize the determined variances; and
merge the rationalized variances with the static objects to generated the at least one rationalized template.
