×

Universal computer assisted diagnosis

  • US 6,021,404 A
  • Filed: 08/18/1997
  • Issued: 02/01/2000
  • Est. Priority Date: 08/18/1997
  • Status: Expired due to Fees
First Claim
Patent Images

1. A method of creating a computer searchable data base for use with a computer having a display screen, input device, and processor, for ultimately diagnosing a condition or event from a large plurality of possible conditions or events or events that may exist in a particular art, said method comprising the steps of:

  • (a) determining what key words describe the characteristic features of each of the possible conditions or events of the large plurality of possible conditions or events;

    (b) creating in computer searchable form a master map for each of the large plurality of possible conditions or events using the key words from step (a) that accurately describe each of the conditions or events, to provide a data base containing all the master maps; and

    (c) providing search access to the master maps data base in the computer so that by a user manipulating the input device to provide a narrative containing some of the key words from step (a), the computer processor will compare the key words input to the key words associated with each master map to determine what conditions or events represented by master maps have the highest degree of similarity with the narrative input, and display those conditions or events on the display screen;

    wherein step (a) is practiced by dividing the key words into three different classifications of words, main words that describe the most important feature of a sentence that accurately describes an aspect of a condition or event, descriptor words that further describe a main word by adding a qualification, and complements that further describe a descriptor by adding a qualification; and

    wherein step (b) is practiced by providing a plurality of distinctly searchable elements for each condition or event, each element including at least a main word, and where they accurately exist, a descriptor and complement associated with that main word; and

    wherein step (b) is further practiced by assigning to each of the elements one of at least two possible logics, a first logic that requires a main and at least a descriptor to also be present before the element is recognized by the processor when searching the data base, and a second logic that requires only the main to be present, but recognizes a descriptor and complement if present.

View all claims
  • 1 Assignment
Timeline View
Assignment View
    ×
    ×