US5323313A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Design and implementation of drafting possible permutations of a set of text
Assignee: ANALYTIC LEGAL PROGRAMS Inc
•
Filing: 1991-04-25
•
Granted: 1994-06-21
•
Expires: 2011-04-25
Abstract
Abstract This invention is a novel document preparation system in which a user is capable of viewing various permutations of a predefined portion of text. With this invention the display of variations in text is performed automatically. This provides a technique by which the developer can more quickly audit the results of his work and on the user's side it permits the user to rapidly see a wide variety of different transactions which is of enormous use to a young associate learning a particular practice area. In one embodiment, the user is provided with a subset of the total number of permutations of a particular portion of text. Various techniques are used to provide only "meaningful" variations of the text, thereby avoiding the need for the user to view what might be an extremely large number of permutations, many of which are of no real import based upon the task at hand.
Inventors
- 👤 Dan Davis
- 👤 Metin Ozisik
- 👤 Stephen Bowles
- 👤 Eric Little
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-26 08:53
CPC Classifications
G; G06; G06F; G06F40/00; G06F40/10; G06F40/166; G06F40/174
Claims Analysis
Total Claims: 14
Claim 1
Independent Claim
188 words
A computer implemented method of automatically preparing a document of text, comprising the steps of: establishing a database of text, said database being capable of being expressed as a block structure; storing a binary representation of said database of text in a computer memory; generating and storing in the computer a plurality of permutations of text including the steps of: obtaining block nodes expressing decision points on said block structure; creating a block tree which expresses relationships between subblocks of said text and from which is derived a block state expression, said block state expression capable of defining the text of any permutation; obtaining a list of questions which includes all of the questions necessary to resolve said block nodes, and from said list of questions creating a question state table which expresses possible combinations of variations of said questions; iterating through said question state table to create a block state associated with each of said question states, and creating a master state table by storing, for each unique block state, a question state-block state pair; and displaying any desired permutation of at least a portion of text.
Claim 2
Dependent Claim
188 words
A computer implemented method of automatically preparing a document of text, comprising the steps of: establishing a database of text, said database being capable of being expressed as a block structure; storing a binary representation of said database of text in a computer memory; generating and storing in the computer a plurality of permutations of text including the steps of: obtaining block nodes expressing decision points on said block structure; creating a block tree which expresses relationships between subblocks of said text and from which is derived a block state expression, said block state expression capable of defining the text of any permutation; obtaining a list of questions which includes all of the questions necessary to resolve said block nodes, and from said list of questions creating a question state table which expresses possible combinations of variations of said questions; iterating through said question state table to create a block state associated with each of said question states, and creating a master state table by storing, for each unique block state, a question state-block state pair; and displaying any desired permutation of at least a portion of text.
Claim 3
Dependent Claim
27 words
A method as in claim 1 wherein said step of creating said master state table stores, at most, a predefined threshold number of question state-block state pairs.
Claim 4
Dependent Claim
31 words
A method as in claim 1 wherein said step of obtaining said list of questions comprises the step of deriving said list of questions from the nodes of said block tree.
Claim 5
Dependent Claim
20 words
A method as in claim 1 wherein said steps of iterating and creating a master state table are performed simultaneously.
Claim 6
Dependent Claim
24 words
A method as in claim 1 which further comprises the step of possibly reducing the number of questions included in said question state table.
Claim 7
Dependent Claim
25 words
A method as in claim 5 wherein said step of possibly reducing comprises the step of defining a preselected portion of said text for analysis.
Claim 8
Dependent Claim
34 words
A method as in claim 6 wherein said step of possibly reducing comprises the step of determining from said preselected portion of text which questions are to be included in said question state table.
Claim 9
Dependent Claim
27 words
A method as in claim 7 wherein said step of determining comprises the step of user selection of questions to be included in said question state table.
Claim 10
Dependent Claim
26 words
A method as in claim 1 which further comprises the step of utilizing said master state table to calculate the number of possible permutations of text.
Claim 11
Dependent Claim
27 words
A method as in claim 1 which further comprises the step of utilizing said master state table to draft at least some of said permutations of text.
Claim 12
Dependent Claim
30 words
A method as in claim 1 which further comprises the step of utilizing said master state table to display a set of answers associated with a specific permutation of text.
Claim 13
Dependent Claim
34 words
A method as in claim 1 step of utilizing said master state table to display a permutation of text including an indication of the changes in text from a selected previous permutation of text.
Claim 14
Dependent Claim
32 words
A method as in claim 1 wherein said step of creating a question state table comprises the step of reducing the size of said question state table by varying unrelated questions simultaneously.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1997-06-20 | 1997-12-20 | 1998-06-21 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2001-06-20 | 2001-12-20 | 2002-06-21 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2005-06-20 | 2005-12-20 | 2006-06-21 | $7700.00 | Window Closed / Lapsed |