US4868733A - Document filing system with knowledge-base network of concept interconnected by generic, subsumption, and superclass relations - Google Patents

Document filing system with knowledge-base network of concept interconnected by generic, subsumption, and superclass relations Download PDF

Info

Publication number
US4868733A
US4868733A US06/844,123 US84412386A US4868733A US 4868733 A US4868733 A US 4868733A US 84412386 A US84412386 A US 84412386A US 4868733 A US4868733 A US 4868733A
Authority
US
United States
Prior art keywords
concept
concepts
information
storing
relations
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Lifetime
Application number
US06/844,123
Other languages
English (en)
Inventor
Hiromichi Fujisawa
Jun'ichi Higashino
Atushi Hatakeyama
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Hitachi Ltd
Original Assignee
Hitachi Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Hitachi Ltd filed Critical Hitachi Ltd
Assigned to HITACHI, LTD., A CORP OF JAPAN reassignment HITACHI, LTD., A CORP OF JAPAN ASSIGNMENT OF ASSIGNORS INTEREST. Assignors: FUJISAWA, HIROMICHI, HATAKEYAMA, ATUSHI, HIGASHINO, JUN'ICHI
Application granted granted Critical
Publication of US4868733A publication Critical patent/US4868733A/en
Priority to US07/430,241 priority Critical patent/US5553226A/en
Priority to US07/831,093 priority patent/US5404506A/en
Priority to US07/947,536 priority patent/US5696916A/en
Priority to US08/141,039 priority patent/US5555408A/en
Priority to US08/663,840 priority patent/US6182062B1/en
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T11/00—Two-dimensional [2D] image generation
    • G06T11/20—Drawing from basic elements
    • G06T11/26—Drawing of charts or graphs
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
    • G06F16/33—Querying
    • G06F16/332—Query formulation
    • G06F16/3329—Natural language query formulation
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
    • G06F16/38—Retrieval characterised by using metadata, e.g. metadata not derived from the content or metadata generated manually
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90—Details of database functions independent of the retrieved data types
    • G06F16/93—Document management systems
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
    • Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10S706/00—Data processing: artificial intelligence
    • Y10S706/902—Application using ai with detail of the ai system
    • Y10S706/934—Information retrieval or Information management
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
    • Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10S707/00—Data processing: database and file management or data structures
    • Y10S707/99931—Database or file accessing
    • Y10S707/99933—Query processing, i.e. searching
    • Y10S707/99935—Query augmenting and refining, e.g. inexact access

Definitions

  • the present invention relates to an information storage and retrieval system which permits storage, retrieval and display of information such as documents, drawings, photographs and the like in such a manner in which common users can easily manipulate the system for the storage and/or retrieval of information.
  • the file management is performed with the aid of identification names (each composed of ca. 20 characters).
  • identification names each composed of ca. 20 characters.
  • difficulty is often encountered in naming the document or file so that it can be readily recalled.
  • searching the file on the basis of the character string which constitutes the name while inferring the contents from the name is an extremely difficult job even for the user who has prepared the name himself.
  • keywords and classification codes are employed.
  • difficulty is encountered in assigning the keywords or classification codes to the documents upon registration thereof.
  • preparation and allocation of the keywords have heretofore been relied on by those skilled in the art.
  • the retrieval is accompanied by still another problem. Namely, no measures are available for re-examining the old information from the view point of a new concept which has not yet been clearly defined at the time the old information was stored or for retrieving from the new point of view. By way of example, there often occurs such case in which classification is to be modified from the new viewpoint or in a manner specific to the user himself after lapse of several years. In this way, possibility of rearrangement of information as well as alteration of retrieval also provide important factors for enhancing the easy usability of the information storage and retrieval system.
  • An object of the present invention is to solve the problems mentioned above and provide an information storage and retrieval system which allows the user to retrieve the desired document from ambiguous or vague and fragmentary (partial) information in a facilitated and simplified manner while making it easy to enter or register documents and other information.
  • an information storage system in which a mechanism of storing information in the machine is so arranged as to be compatible or comparable to the user's memorization mechanism and thinking process so that the end user can easily understand manipulation of the system to thereby enhance the facilitated usability thereof.
  • the invention contemplates to make it possible to facilitate registration of new information and the inputting of conditions for retrieval, realizing semantically meaningful retrieval, and adapting the retrieval for diversity of viewpoints.
  • knowledge about the concepts "computer”, "company” and others is stored in the storage system, wherein upon addition of new information, the user is given instruction as to what kind of property data should be inputted through dialogical procedure, so that he or she can input the data within a short time without being accompanied with entry of erroneous or false information.
  • the user can input the properties of the concept "George Smith” that differ from the above, e.g. (BIRTHDAY-IS “June 7, 1963”) and (HOBBY-IS “sport”).
  • the retrieval is started from the most important concept and information is sequentially added through dialogical procedure or interaction.
  • the knowledge of the world model conserving the content of the filed documents is stored in the system as is the case with the registration assistance function.
  • the names of properties which can be inputted and the concept (class of things) to which the properties may belong are presented to the user.
  • the system when the "computer" is inputted as the selected subject, the system in turn displays (DEVELOPED-BY ORGANIZATION COMPANY), (RUNS COMPUTER-LANGUAGE), (RUNS-UNDER OS) and others.
  • the user In response thereto, the user will input (RUNS LISP) as the additional condition for retrieval.
  • the computer memory e.g. data base
  • the computer memory stores that item in a concrete name. The gap between the user's fragmentary information and the precise data stored in the computer memory must be bridged.
  • the ambiguity may be generally classified into five varieties mentioned below:
  • Things and concepts are often memorized in terms of concepts of higher rank with the concrete contents being forgotten.
  • Memorization of the is often based on the classification of concept, as exemplified by sayings that "although the name of the company is forgotten, the organization is neither university nor laboratory but a company at any rate", "that was a certain electric machinery manufacturer” or the like.
  • the concepts "ABC Co., Ltd.” and “ELECTRIC-MANUFACTURER” are coupled by a link "IS-A".
  • the link "IS-A” represents a relation defined between the two concepts mentioned above and is referred to as the subsumption relation which is an ordered relation representing a superclass relation between two concepts.
  • the conventional data base stores the corresponding facts in more definite manner such as "Mr. A works at XYZ factory” or "ABC Co., Ltd., is located at Los Angeles". Accordingly, the information stored in the data base can not be retrieved starting from the ambiguous information memorized by the user.
  • relation having directivity is referred to, simply as the relation, while the relation is referred to as the relationship when the direction is not concerned.
  • retrieval condition may be expressed as follows:
  • IS-DEVELOPED-BY represents the relation.
  • this "relation" defined among the concepts is important.
  • conditional statement (4) is considered a "semantic meaningful retrieval condition" according to the invention, because the statement (4) contains relations between "California state” and "company”, “company” and “computer”, and "operating system” and “computer”, respectively, as the information for retrieval.
  • FIG. 1 is a view showing a system arrangement according to an embodiment of the present invention
  • FIG. 2 is a view for illustrating a concept network
  • FIG. 3 is a view illustrating the concept network in a schematic diagram
  • FIG. 4 is a view showing a concept relation model in an Entity-Relation diagram
  • FIGS. 5 to 8 are views illustrating concrete examples of knowledge representation by the concept relation model
  • FIG. 9 is a view illustrating an example of image data management
  • FIG. 10 is a functional block diagram showing software employed according to an embodiment of the invention.
  • FIG. 11 is a view for illustrating a result of character substring matching procedure
  • FIG. 12 is a view showing a menu
  • FIG. 13 is a view for illustrating network traverse procedure based on selection from the menu
  • FIG. 14 is a view showing a concept tree display
  • FIG. 15 is a view showing a hierarcal tree based on the part-whole relationship
  • FIG. 16 is a view for illustrating network traverse procedure based on concept frames
  • FIG. 17 is a view for illustrating method for definition and registration of a new concept
  • FIG. 18 is a view for illustrating concept network edition
  • FIGS. 19 to 22 are views for illustrating dialogical retrieval formula creating procedure
  • FIG. 23 is a view for illustrating semantic retrieval
  • FIG. 24 is a view for illustrating a concept matching procedure
  • FIG. 25 is a view for illustrating functions for displaying concepts in tabular form.
  • FIG. 1 shows a general arrangement of an image information filing system in which an information storage and retrieval system according to an exemplary embodiment of the invention is adopted. Initially, the structure and operation of the whole system will be outlined below.
  • the system is composed of a data processing portion and an image information processing portion.
  • the data processing portion comprises a control unit (also referred to as CPU) 100, a main memory 300, magnetic disk units 400 and a terminal console 200 (which includes a CRT 210, a keyboard 220 and a mouse 230) and an image information processing portion.
  • the image information processing portion comprises an image scanner 700, an image printer 750 an optical disk unit 450, an image buffer memory 350, a high-speed image processor (also referred to as IP) 600 and a high-resolution image display (also referred to as CRT) 500.
  • the data processing portion and the image information processing portion are interconnected through a bus adapter 805.
  • the bibliographic data, physical addresses (pack address, track address and sector address) of the image information in concern on the optical disk unit 450 and properties of the image (size, scan density, type of coding as adopted and the like) are stored in the magnetic disk unit or file unit 420.
  • information about the significance of the document in the world knowledge and the like is stored in the file unit 430.
  • the desired document is identified with the aid of the terminal console 200 through dialogical interacting process described hereinafter to be thereby displayed on the image display CRT 500.
  • this can be outputted from the printer 750.
  • Information about the location of the identified document (such as the physical address of the optical disk unit) is read out from the file unit 420 to be subsequently sent to the optical disk control unit 450 as the control command for reading the optical disk by way of the bus adapter 805.
  • the image information or data thus read out is once stored in the buffer memory 350 and is sequentically decoded through the IP 600 to be displayed.
  • the mouse 230 is capable of designating the display position or location on both the CRTs 210 and 500. Accordingly, the display position of the image on the CRT 500 is designated by the mouse 230.
  • the document images on a plurality of pages can also be displayed at given locations or positions on the CRT in overlapping relation. Furthermore, the document image corresponding to one page can be displayed in a reduced size through the IP 600, for thereby allowing a number of ges to be simultaneously displayed on a single CRT screen. Management of images to be displayed on the CRT is performed by the control unit or CPU 100.
  • Inputs for editing the world knowledge are performed on the terminal 200 by displaying the document on the CRT 500, as it is required.
  • the phrase "world knowledge”, is intended to mean a set of concepts concerning the world or field described in the document and the facts described in terms of relationships among the concepts, which document is to be registered or has already been registered. Further, the term “world knowledge” encompasses these concepts, as well as the interconceptural relationships, in a natural language. Needless to say, the document itself is included as one of the concepts by the term "world”. These knowledges are stored in the file unit 430.
  • the three main functions described above can be arbitrarily called in a modeless manner whenever they are required.
  • information as required can be displayed on the CRT 500 by resorting to the retrieval function in the course of performing the additional editing of the world knowledges. It is also possible to additionally file the knowledge of the contents of a document in the course of performing the registration of the same document.
  • FIG. 2 is a schematic diagram illustrating conceptually these elements in terms of a kind of a semantic network.
  • each node represented by an ellipse represents a concept, wherein the word written within the ellipse is typical word representing that concept. This word is referred to as the name of the concept.
  • Links interconnecting the ellipses i.e. solid and broken lines with respective arrows represent the relationships among the concepts.
  • the link 1005 interconnecting the concepts "X-800" and "UX” differs from the aforementioned generic relationship.
  • This link 1005 represents the individual relation defined between the two concepts linked together. This sort of relation will be referred to as the instance relation or simply as relation. It should however be noted that the relation 1005 is an instance relation of the generic relationship 1004.
  • FIG. 2 tells a fact that the subject matter of an article "ART #018" denoted by a numeral 1018 is the supercomputer X-800 and that an operating system UX runs on the supercomputer X-800. Further, it will be seen that all the concepts are interconnected by longitudinal lines referred to as the links labelled "IS-A" on one hand and interconnected by transverse links referred to as the generic relations and the instance relations, to thereby constitute the conceptual network.
  • C(i) represents the i-th concept
  • S(k, i) represents the fact that a concept C(K) is one variety of the concept C(i)
  • R(m) represents the m-th generic relationship
  • r (m, k, () represents an instance relation of the generic relationship R(m) which is defined between the concepts C(k) and C(l).
  • these four types of data can be represented as an entity relation model in a tabular form, as will be seen in FIG. 4.
  • entity relation model in a tabular form
  • the concept C and the generic relationship R are apprehended to be the entity while the subsumption relation S and the instance relation r are understood to be the relations interlinking the entities.
  • the generic relationship defines a class of the instance relations r and is considered to be the entity. More concrete representations are shown in FIGS. 5 to 8 in the form of a table.
  • FIG. 5 shows a table which lists definitions of words representing the concepts.
  • the table is composed of a column containing identification numbers C# assigned individually to the concepts, a column containing concept names (words or notations) CNAME expressing the concepts, and a column containing indications as to whether the expressions are primary or secondary ones.
  • the concept identified by the number #58 is "computer" which is also expressed in Japanese.
  • FIG. 6 shows a table defining the subsumption relations.
  • the table is composed of a column listing the individual concept identification number C# and a column containing the identification number each assigned to a higher rank or superclass concept subsuming the corresponding or associated concept C#.
  • the superclass concept of the concept "UNIVERSAL” is defined to be “UNIVERSAL”.
  • FIG. 7 shows a table defining the generic relationships R.
  • the table contains a column listing the numbers IS# identifying the generic relationships, a column listing the relationship names RSNAME of the generic relationships, a column listing readings LR which correspond to the readings of the generic relationships from left to right and a column listing readings RL which correspond to the readings of the generic relationships from right to left.
  • "reading from left to right” applies validly only in the basic form in which two concepts interlinked by the associated generic relationship are juxtaposed side by side, the basic form being defined by the instance relation r which will be elucidated by referring to FIG. 8.
  • the name column RSNAME contains "SUBJECT" as the sixteenth generic relationship. This means that the "SUBJECT" is used as the instance relations:
  • FIG. 8 shows a table containing the relations r defined between the concepts.
  • this table both the generic relationships and the instance relations are entered.
  • a column G/I serves to discriminate the generic relationship and the instance relation, wherein G indicates the generic relationship with I indicating the instance relation.
  • the records include the relation identifying number R#, the generic relationship identifying number RS# indicative of the type of the relationships, the left concept identification number CL identifying the concept located on the left side in the basic form, and the right concept identification number CR identifying the concept located on the righthand side in the basic form.
  • relation #724 is an instance relation of the generic relationship #7 and interlinks the concepts #1512 and #1051 with each other. Namely, as will be seen in the table C, relations mentioned below are represented.
  • the four kinds of data (tables C, S, R and r) described above are stored in the file 430 as the knowledge base.
  • the table 9 includes columns for the document identification number D#, concept identification number C#, document size SIZE, compressing code type CODE, image scanning density DENS, physical address PHYSA on the optical disk and the number of recording sectors LENG.
  • the document #98 concerns the concept #313 (i.e. article ART #018, see FIG. 5)
  • the size is A4
  • the scanning is effected at the density of 16 lines/mm
  • the compressing code is the MH code
  • the document is stored at 13 sectors following the address "400207" inclusive, of the optical disk.
  • the table D is stored for management in the file 420 shown in FIG. 1.
  • FIG. 10 illustrates the software structure.
  • the illustrated software is processed by the control unit 100 (FIG. 1) and programs as required are stored in the file 410 (FIG. 1).
  • the software includes a dialogue control module 2001, a search and concept matching module 2001, a query formula generation module 2003, a concept network editor 2004, a network traverse control module 2005, a table manipulation module 2006, and an image display control module 2010.
  • the table manipulation module 2006 serves for manipulation of data of the aforementioned various table formated at a level of high order as well as retrieval of the data.
  • Main functions of the module 2006 be enumerated below. Parenthetically, it should be mentioned that the program is written in LISP language and that S-expression is adopted. Further, for facilitation of the description, variables and functions are represented by small letters while constants are represented by capital letters.
  • create-table As a function for creating a new table, "create-table" function can be mentioned.
  • first argument is the name of the table and the second argument represents the list (set) of the columns' names
  • quotation mark "1" means that the symbol following the mark is not a variable but a constant.
  • a function "update” can be employed for updating the record.
  • the value of the record located in the column RSNAME where the value of the column RS# is can be updated to "THEME" by employing the function "update” as follows:
  • deletion of the record is performed as follows:
  • the record located at the column RSNAME of the table R which partially coincides with a fragmental or partial character string "*SUBJ" is selected. Thereafter, the values of the same record which are located at the columns LR and RL are returned to the list.
  • "smatch" is a predicate function employed for deciding whether the record matching with the fragmental or partial character string exists or not.
  • the conceptual network is composed of the concept nodes and links termed "relation".
  • the system remembers as a current node the concept constituting the key of the subject which the user is interested in.
  • the user in turn is capable of browsing (traversing) in the network by employing the functions mentioned below.
  • browsing or traversing is equivalent to the displacement or movement of the current node.
  • FIG. 11 shows a display of the menu of concepts which coincides with the partical character string "*DATABASE", wherein the seventh concept in the menu has been selected.
  • the mark "*" indicates that a string of characters following the mark is the partial (incomplete) character string.
  • FIG. 12 shows a menu of concepts ranking immediately below the uppermost concept UNIVERSAL with command "l".
  • the hierarchical tree can be followed downwardly by inputting the desired concept numbers in the menus in a manner illustrated in FIG. 13. More specifically, in the case of the example shown in FIG. 13, the concept "organization” has been reached by inputting the numbers "6", "1", “1” and "2" in this order.
  • the concept matching with the partial character string is carried out only for the set of concepts subsumed by the current node (i.e.
  • the concept directly subsumed by the given concept i.e. the concept directly underlying the given concept in the hierarchical tree
  • all the concepts subsumed by the given concept C can be selected.
  • a third browse procedure can be carried out by displaying graphically the conceptual or hierarchical tree on the CRT.
  • FIG. 14 shows a concept tree beginning with a concept "space" down to the second hierarchy.
  • the current node can be moved to the designated node or the portion of the concept tree immediately underlying the designated concept can be displayed.
  • the dialogue control module 2001 Since this module is destined to control the graphic display, the module can memorize what is displayed at which locations on the CRT.
  • control module 2001 in response to the input information of a location, the control module 2001 can identify the concept being displayed at that location on the CRT at the most recent time point. Consequently, the dialogue control module 2001 inputs information of the cursor position and returns the concept name to the network traverse module 2005.
  • FIG. 15 shows a part of hierarchies of the concept "earth" in another conceptual tree configuration.
  • the tree can be browsed, being directed by the part-whole relation in the utterly same manner as the case described above in conjunction with FIG. 14.
  • the "part" concept can be extracted in the manner mentioned below.
  • a set of the generic relationship identification numbers RS# representing the part-whole relations are called from the table R shown in FIG. 7.
  • "2223" is called and memorized temporarily at a variable x.
  • a fourth browse procedure resides in a chain-like traverse with the aid of frame representation. This procedure will be described in detail in conjunction with an example shown in FIG. 16.
  • a partial character string "*sowa" representative of a part of a man's name is inputted.
  • J. F. SOWA is found out.
  • the current node is moved automatically to this concept.
  • the frame for this concept is displayed by a command fr for the frame display (the operand "*" means that the frame for the current node be displayed). From the frame displayed, it is found that "J. F. SOWA” is male “MAN” and that he is the author of "PAPER #0012" and "BOOK #0007".
  • the frame display is performed in the manner described above. Assuming now that the frame for the concept C is to be displayed in accordance with
  • the names of these instance relations correspond to a first column of the frame (FIG. 16). More specifically, when the individual rows of the frame are termed as slots, the names under consideration correspond to the names of the slots, respectively.
  • the second column of the frame contains the slot values representing the second elements x 2i and y 2i of the pairs x i and y i , respectively.
  • a display such as shown in FIG. 16 can be produced. Since the concept is internally coded in terms of the concept identification number, transformation of the concept number to the concept name must be carried out by consulting the table C (FIG. 5) before generation of the display.
  • shift a is made to a succeeding frame by designating the row number (slot number).
  • the rows number slot number
  • the concept network editor serves for maintenance of the knowledge base by performing definition and addition of novel concepts and/or relations, alteration and deletion thereof.
  • FIG. 17 illustrates an example of dialogue or interaction.
  • First "man” is entered through the keyboard, resulting in that the current node is moved to the concept “MAN”, which is followed by registration of a new man “SUPERMAN”.
  • MAN Concept
  • MR. SUPERMAN can be registered at a run below "MAN”. Namely,
  • the system possesses knowledges in the generic form such that "a man devises a novel thing", "a man has an academic title” or "a man has a job of some sort”.
  • the system can display the item to be inputted.
  • inputting of "MR. SUPERMAN” can be prompted in the form:
  • the parenthesized concept "ACADEMIC TITLE” indicates the class of property (a concept in the case of this example) to be inputted.
  • the concept network traverse function is valid at this time point.
  • the current node has been moved to the concept "ACADEMIC-TITLE” at that time point. Consequently, a given traverse function can be employed in order to find out the property to be inputted.
  • the concept name "phd” is directly inputted.
  • Registration of the instance relation can be performed relative to the name relation (property) in the manner mentioned below.
  • rs is the identification number of the generic relationship "ACADEMIC-TITLE”
  • r#max represents the maximum R# in the table r at that time point.
  • Another function of the concept network editor is alteration and/or modification (correction) of the facts and concepts which have already been registered. More specifically, modification or correction of the name of concept, modification (correction) of positions in the conceptual tree (modification of classification), modification (correction) of the instance relation and generic relationship can be performed.
  • FIG. 18 shows an example of modification of the conceptual tree in which the position of a concept "PSYCHOLOGY” is to be changed from a class "SOCIAL-SCIENCE” to a class “NATURAL-SCIENCE”. This change can be realized in accordance with
  • the network browsing function can be employed as desired.
  • the network editor function itself can be recursively employed. In reality there often arises such situation in which another concept is required to be newly entered in the course of registration of the definition of a new concept.
  • the instruction or command "crc” is newly inputted at this time point to thereby allow the concept "AAAI” to be entered.
  • the property of "AAAI” may be registered at that time point under the instruction "crr", if desired.
  • the current node is moved to the concept "ARTICLE” and an instruction q is inputted to start the generation of search (retrieval) formula.
  • the system determines the generic relationships defined for the concept "ARTICLE” inclusive of those inherited from the superclass concept to display them in the frame format, as shown in FIG. 19. More specifically, the frame containing the generic knowledge of ARTICLE IS-PART-OF PUBLISHED MATERIAL", “ARTICLE is -IN-PAGES-OF SO-AND-SO”, “ARTICLE IS-REFERRED-TO-FROM ARTICLE” and others is displayed. Then, the user can add more concrete information than the one being currently displayed, by designating a corresponding slot with the identification number assigned thereto.
  • the fifth slot is selected because the information that the subject of the article is a computer is known to the user.
  • the system moves the current node to the superclass concept (i.e. concept of higher rank) of the item to be entered.
  • the current node is moved to the concept "UNIVERSAL".
  • the user may use the any given network traverse function (refer to FIG. 10).
  • "computer” is directly inputted to thereby move the current node to the concept "COMPUTER”.
  • the user can recall the name of the concept to be inputted (in this case, computer), it can be determined by inputting the incomplete character string displaying the menu.
  • the instruction q is successively inputted in succession to the inputting of "computer".
  • FIG. 20 shows a display content for the dialogue or interaction. It will be seen that the generic relationships concerning the concept "COMPUTER” are displayed in a frame structure. Similarly to the preceding procedure, the slot for the condition to be added (the fourth slot in this case) is selected. Then, it is displayed that the class of item to be inputted is "ORGANIZATION WORKPLACE". At this step, the selection from menu (refer to FIG. 13) can be employed. In the case of the present example however, “company” meaning "a certain company” is solely inputted straightforwardly. Since there exists information to be added for "company”, the instruction q is succeedingly inputted to continue the process of generating the retrieval formula.
  • FIG. 21 illustrates a frame display of the generic relationships for the concept "COMPANY". By selecting the seventh slot, the condition that the company under search is located in California. It should be noted that "CALIFORNIA” is selected by inputting the incomplete character string "CAL”. The concepts ranked lower than the concepts “SPACE”, “PLACE” and “LOCATION” are shown in FIG. 14.
  • FIG. 22 illustrates a case where conditions are again inputted in connection with the concept "COMPUTER” upon completion of inputting the conditions for "COMPANY". At this time, the thirteenth slot is selected to thereby input the information that "the same computer runs under the operating system UNIX".
  • the concept name C i is derived, resulting in that the pairs (Z i C i ) represents the slot name and the slot value.
  • concept matching is performed relative to the set of terminal concepts of the current node (i.e. the concepts corresponding to the leaves of a concept subtree). More specifically, each of the terminal concepts (the most concrete concepts) in compared with "abstract concept" expressed by the retrieval condition formula, resulting in the terminal concept subsumed by the abstract concept.
  • FIG. 23 shows the search in accordance with the retrieval condition 3000 given by the expression (29). It is possible to produce the frame display 3001 of the concepts of an article meeting the condition and the display of a document image 3051. It should be noted that the concept frame of the symbol "ARTICLE #0014" does not coincide with the retrieval condition (29) at all in appearance. Such situation will occur in the information retrieval for the hitherto known data base. More specifically, since the most concrete information is stored in the hitherto known data base, there takes place no coincidence at all when the retrieval condition is abstract. In contrast, according to the teachings of the present invention, the gap between the concrete contents of the concept frame and the abstract expression of the retrieval condition is eliminated by inference based on the world knowledges.
  • FIG. 24 illustrates a process of the concept matching between an abstract concept given by the expression (29) and the concept "ARTICLE #0014".
  • check may be made as to whether or not
  • the concept matching has been elucidated in connection with a concrete example.
  • the process for checking the presence of the subsumption relation between concepts and the process for checking the coincidence between the individual slots are alternately and recursively called for proceeding with the procedure.
  • the procedure adopts the backward-changing inference. Accordingly, the time taken for the searching is basically proportional to the number of the concrete items subjected to search.
  • the present invention also provides means for translating the knowledge expressed by the concept network into tabular form familiar for the user and allowing the retrieval on the table.
  • An example of such means is illustrated in FIG. 25.
  • an instruction "tab” is inputted.
  • the system After the current node has been moved to an abstract concept "NEWS.ARTICLE", an instruction "tab" is inputted.
  • the system After the current node has been moved to an abstract concept "NEWS.ARTICLE", an instruction “tab” is inputted.
  • the system generates internally a concept frame of the terminal concept of the abstract concept.
  • the slot names appearing in the concept frame are presented in the form of a table.
  • the user can select the slots which is to be transformed to columns of the table.
  • the sixth and fifth slots i.e.
  • TITLE-IS and "SUBJECT-IS” are selected, whereby a table including three columns in total is prepared.
  • the user may search out the desired item on the basis of sentences contained in the column "TITLE-IS”.
  • the selected result is set as the current node and an instruction for displaying the document image is inputted. Then, the document image is displayed on the CRT 500.
  • the retrieval system according to the present invention can be applied not only to the document filing but also to more general purpose such as retrieval of data in general and information of facts or actual things.
  • concept matching which is capable of automatically determining the subsumption relation between two concepts is also applicable as an information analyzing technique for examining whether the subsumption relation exists between claims of patents.
  • cluster analysis of concepts is possible by collecting an enourmous amount of concrete concepts and applying the inventive concept matching.
  • the concept registering function is based on the system initiative interaction in which all the slot names are sequentially presented to the user, as illustrated in FIG. 17, it is possible to embody the invention in the user initiative system in which the generic frame such as shown in FIG. 19 is displayed to allow the user to input desired properties at his or her will.
  • the type of interaction is identical with the one adopted in the retrieval formula generation and thus encompassed by the invention.
  • the concept of time can be introduced into the knowledge base. Usually, there takes place frequently such situations in which the time at or for which a fact is "true” is required to be designated.
  • a fact "MR. SUPERMAN IS-MEMBER-OF AAAI” is true from the time when SUPERMAN joined AAAI to the time when he secedes therefrom.
  • Such time concept can be realized by correspondingly extending the table r containing the instance relations.
  • Another extension of the system can be realized in respect to the function for recording the sources of the individual facts.
  • the sources of information such as "who said so", "where it is written” and so forth can be recorded in the table r by correspondingly extending it. Further, an extent of reliability may be added.
  • the present invention is independent of the configuration in which the system is realized. In order to accomplish a high-speed processing, specific hardware may be introduced. Further, when the knowledge base becomes excessively large, variation in implementation such as division of the tables for storing the concepts and relations each into clusters can be made within the coverage of the present invention. When the concepts and others are to be expressed in Japanese, kana (Japanese alphabet)--Chinese character translating function is required. The system incorporating this function is also covered by the present invention.
  • the world knowledge about the subjects to be filed are expreseed in terms of the concept network for realizing the knowledge base, whereby addition of fresh knowledge, edition and dialogical inputting of retrieval conditions can be performed in a much facilitated manner.
  • the knowledge is expressed in the forms of generic relationship and instance relation, the system is imparted with the capability of inferring and displaying, upon inputting of information, what is next to be inputted by the user and to what class the concept should belong on the basis of the generic relationship. This capability or function is architected on the basic principle. Application to new worlds and/or more delicate worlds is possible merely by addition or alteration of the knowledge base expressed by the concept network.
  • the system includes the concept network editor for allowing addition and/or alteration of the knowledge base.
  • the editor is imparted with the function to display the status of the knowledge base having four or more network browsing functions in the form of the concept tree, menu table, frame, or relation data base table.
  • network browsing functions in the form of the concept tree, menu table, frame, or relation data base table.
  • it is also possible to browse from one to another different concepts in a sequential manner.
  • the possibility of such abundant data viewing is due to adoption of the newly devised concept relation model.
  • the function of browsing to different concepts while displaying the conceptual frame is compatible way man's thinking faculty or process. Accordingly, with this function alone, the highly intelligent concept searching can be accomplished.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Databases & Information Systems (AREA)
  • Data Mining & Analysis (AREA)
  • General Engineering & Computer Science (AREA)
  • Mathematical Physics (AREA)
  • Library & Information Science (AREA)
  • General Business, Economics & Management (AREA)
  • Artificial Intelligence (AREA)
  • Human Computer Interaction (AREA)
  • Business, Economics & Management (AREA)
  • Computational Linguistics (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
  • Devices For Executing Special Programs (AREA)
US06/844,123 1985-03-27 1986-03-26 Document filing system with knowledge-base network of concept interconnected by generic, subsumption, and superclass relations Expired - Lifetime US4868733A (en)

Priority Applications (5)

Application Number Priority Date Filing Date Title
US07/430,241 US5553226A (en) 1985-03-27 1989-10-30 System for displaying concept networks
US07/831,093 US5404506A (en) 1985-03-27 1992-02-10 Knowledge based information retrieval system
US07/947,536 US5696916A (en) 1985-03-27 1992-09-21 Information storage and retrieval system and display method therefor
US08/141,039 US5555408A (en) 1985-03-27 1993-10-25 Knowledge based information retrieval system
US08/663,840 US6182062B1 (en) 1986-03-26 1996-08-21 Knowledge based information retrieval system

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
JP60060678A JPS61220027A (ja) 1985-03-27 1985-03-27 文書ファイリングシステム及び情報記憶検索システム
JP60-60678 1985-03-27

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US27638488A Continuation-In-Part 1985-03-27 1988-11-25

Publications (1)

Publication Number Publication Date
US4868733A true US4868733A (en) 1989-09-19

Family

ID=13149215

Family Applications (1)

Application Number Title Priority Date Filing Date
US06/844,123 Expired - Lifetime US4868733A (en) 1985-03-27 1986-03-26 Document filing system with knowledge-base network of concept interconnected by generic, subsumption, and superclass relations

Country Status (4)

Country Link
US (1) US4868733A (fr)
EP (2) EP0196064B1 (fr)
JP (1) JPS61220027A (fr)
DE (2) DE3650736T2 (fr)

Cited By (111)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO1990015386A1 (fr) * 1989-05-31 1990-12-13 Borrey Roland G Identification de document par correspondance de caracteristiques
US4996665A (en) * 1987-08-05 1991-02-26 Hitachi Ltd. Method and device for editing a document having a plurality of headings
US5020019A (en) * 1989-05-29 1991-05-28 Ricoh Company, Ltd. Document retrieval system
US5101345A (en) * 1988-11-29 1992-03-31 International Business Machines Inc. Method of filing stapled documents with a staple relationship involving one or more application programs
US5109508A (en) * 1988-01-29 1992-04-28 Hitachi, Ltd. Data base system including memorandum information and method for managing memorandum information
US5115504A (en) * 1988-11-01 1992-05-19 Lotus Development Corporation Information management system
US5168565A (en) * 1988-01-20 1992-12-01 Ricoh Company, Ltd. Document retrieval system
US5179718A (en) * 1988-11-29 1993-01-12 International Business Machines Corporation Method of filing having a directed relationship through defining a staple relationship within the context of a folder document
US5193185A (en) * 1989-05-15 1993-03-09 David Lanter Method and means for lineage tracing of a spatial information processing and database system
US5214779A (en) * 1988-06-30 1993-05-25 International Business Machines Corporation Variable construct representation embedded in data stream which references definition for dynamically generating data used in processing the data stream
US5255364A (en) * 1989-10-31 1993-10-19 Kabushiki Kaisha Toshiba Electronic filing system wherein the automatic updating of retrieval data is voluntarily inhibited
US5257185A (en) * 1990-05-21 1993-10-26 Ann W. Farley Interactive, cross-referenced knowledge system
US5276885A (en) * 1991-04-18 1994-01-04 Carnegie Group Single step mapping in topological order of the queued class and instance frames of a semantic network to a static working memory
US5293552A (en) * 1991-04-08 1994-03-08 U.S. Philips Corporation Method for storing bibliometric information on items from a finite source of text, and in particular document postings for use in a full-text document retrieval system
US5307266A (en) * 1990-08-22 1994-04-26 Hitachi, Ltd. Information processing system and method for processing document by using structured keywords
US5321609A (en) * 1992-05-27 1994-06-14 Franklin Electronic Publishers, Incorporated Electronic encyclopedia
US5345587A (en) * 1988-09-14 1994-09-06 Digital Equipment Corporation Extensible entity management system including a dispatching kernel and modules which independently interpret and execute commands
US5535304A (en) * 1989-11-22 1996-07-09 Kabushiki Kaisha Toshiba Inference system having a frame structure and method of storing information therein
US5553226A (en) * 1985-03-27 1996-09-03 Hitachi, Ltd. System for displaying concept networks
US5561802A (en) * 1987-12-18 1996-10-01 Hitachi, Ltd. Method for managing programs with attribute information and developing loaded programs
US5568640A (en) * 1993-09-20 1996-10-22 Hitachi, Ltd. Document retrieving method in a document managing system
US5586252A (en) * 1994-05-24 1996-12-17 International Business Machines Corporation System for failure mode and effects analysis
US5594837A (en) * 1993-01-29 1997-01-14 Noyes; Dallas B. Method for representation of knowledge in a computer as a network database system
US5598557A (en) * 1992-09-22 1997-01-28 Caere Corporation Apparatus and method for retrieving and grouping images representing text files based on the relevance of key words extracted from a selected file to the text files
US5644740A (en) * 1992-12-02 1997-07-01 Hitachi, Ltd. Method and apparatus for displaying items of information organized in a hierarchical structure
US5694590A (en) * 1991-09-27 1997-12-02 The Mitre Corporation Apparatus and method for the detection of security violations in multilevel secure databases
US5696916A (en) * 1985-03-27 1997-12-09 Hitachi, Ltd. Information storage and retrieval system and display method therefor
US5720008A (en) * 1994-05-25 1998-02-17 Lucent Technologies Inc. Knowledge base management system with dependency information for procedural tests
US5721902A (en) * 1995-09-15 1998-02-24 Infonautics Corporation Restricted expansion of query terms using part of speech tagging
US5752016A (en) * 1990-02-08 1998-05-12 Hewlett-Packard Company Method and apparatus for database interrogation using a user-defined table
US5761496A (en) * 1993-12-14 1998-06-02 Kabushiki Kaisha Toshiba Similar information retrieval system and its method
US5832494A (en) * 1993-06-14 1998-11-03 Libertech, Inc. Method and apparatus for indexing, searching and displaying data
US5842203A (en) * 1995-12-01 1998-11-24 International Business Machines Corporation Method and system for performing non-boolean search queries in a graphical user interface
US5873056A (en) * 1993-10-12 1999-02-16 The Syracuse University Natural language processing system for semantic vector representation which accounts for lexical ambiguity
US5878406A (en) * 1993-01-29 1999-03-02 Noyes; Dallas B. Method for representation of knowledge in a computer as a network database system
US5909688A (en) * 1993-10-29 1999-06-01 Fujitsu Limited Information management system
US5937400A (en) * 1997-03-19 1999-08-10 Au; Lawrence Method to quantify abstraction within semantic networks
US6029160A (en) * 1995-05-24 2000-02-22 International Business Machines Corporation Method and means for linking a database system with a system for filing data
US6112199A (en) * 1995-10-18 2000-08-29 Nelson; Paul M. Data item values
US6278990B1 (en) 1997-07-25 2001-08-21 Claritech Corporation Sort system for text retrieval
US6282531B1 (en) * 1998-06-12 2001-08-28 Cognimed, Llc System for managing applied knowledge and workflow in multiple dimensions and contexts
US6311176B1 (en) * 1997-08-29 2001-10-30 Ipcentury Ag Method and data structure for the computer-aided management of developments
US20020190610A1 (en) * 1999-12-16 2002-12-19 Philippe Andre Self-powered remote control device, electrical apparatus and installation comprising same
US6513027B1 (en) * 1999-03-16 2003-01-28 Oracle Corporation Automated category discovery for a terminological knowledge base
US6519577B1 (en) 1997-12-19 2003-02-11 Bae Systems Plc Digital signal filter using weightless neural techniques
US6556982B1 (en) * 2000-04-28 2003-04-29 Bwxt Y-12, Llc Method and system for analyzing and classifying electronic information
US20030097357A1 (en) * 2000-05-18 2003-05-22 Ferrari Adam J. System and method for manipulating content in a hierarchical data-driven search and navigation system
US20030115175A1 (en) * 1999-12-14 2003-06-19 Martin Baatz Method for processing data structures
US20030120630A1 (en) * 2001-12-20 2003-06-26 Daniel Tunkelang Method and system for similarity search and clustering
US20030130976A1 (en) * 1998-05-28 2003-07-10 Lawrence Au Semantic network methods to disambiguate natural language meaning
US20030204537A1 (en) * 2002-04-23 2003-10-30 International Business Machines Corporation Content management system and methodology for implementing a complex object using nested/recursive structures
US20030210249A1 (en) * 2002-05-08 2003-11-13 Simske Steven J. System and method of automatic data checking and correction
US6694327B2 (en) 1994-12-15 2004-02-17 Ufil Unified Data Technologies, Ltd. Method and apparatus for binary-oriented set sequencing
US20040049522A1 (en) * 2001-04-09 2004-03-11 Health Language, Inc. Method and system for interfacing with a multi-level data structure
US20040049488A1 (en) * 1998-07-29 2004-03-11 Qwest Communications International Inc. Information organization and navigation by user-generated associative overplays
US20040083062A1 (en) * 2000-07-07 2004-04-29 Maria Athelogou Method for the processing of several different data structures
US6778970B2 (en) * 1998-05-28 2004-08-17 Lawrence Au Topological methods to organize semantic network data flows for conversational applications
US6792430B1 (en) * 1998-07-29 2004-09-14 Qwest Communications International Information organization and navigation by user-generated associative overlays
US20040193514A1 (en) * 2003-03-27 2004-09-30 Kasra Kasravi Data representation for improved link analysis
US20040249829A1 (en) * 2003-03-27 2004-12-09 Kasra Kasravi Knowledge representation using reflective links for link analysis applications
US20050028168A1 (en) * 2003-06-26 2005-02-03 Cezary Marcjan Sharing computer objects with associations
US20050060326A1 (en) * 1999-08-04 2005-03-17 Reuven Bakalash Stand-alone cartridge-style data aggregation server and method of and system for managing multi-dimensional databases using the same
US6871199B1 (en) * 1998-06-02 2005-03-22 International Business Machines Corporation Processing of textual information and automated apprehension of information
US20050114763A1 (en) * 2001-03-30 2005-05-26 Kabushiki Kaisha Toshiba Apparatus, method, and program for retrieving structured documents
US20050149491A1 (en) * 2000-02-28 2005-07-07 Reuven Bakalash Database management system having data aggregation module integrated therein
US20060036451A1 (en) * 2004-08-10 2006-02-16 Lundberg Steven W Patent mapping
US7035864B1 (en) 2000-05-18 2006-04-25 Endeca Technologies, Inc. Hierarchical data-driven navigation system and method for information retrieval
US20060122985A1 (en) * 2004-10-25 2006-06-08 Hewlett-Packard Development Company, L.P. Data structure, database system, and method and computer-readable medium storing program for data management and/or conversion
US20070061276A1 (en) * 2003-07-10 2007-03-15 Akira Sato Device and method for registering a plurality of types of information
US20070083505A1 (en) * 2000-05-18 2007-04-12 Ferrari Adam J Hierarchical data-driven search and navigation system and method for information retrieval
US20070198578A1 (en) * 2005-07-27 2007-08-23 Lundberg Steven W Patent mapping
US20070294229A1 (en) * 1998-05-28 2007-12-20 Q-Phrase Llc Chat conversation methods traversing a provisional scaffold of meanings
US20070294200A1 (en) * 1998-05-28 2007-12-20 Q-Phrase Llc Automatic data categorization with optimally spaced semantic seed terms
US20080008349A1 (en) * 2002-10-15 2008-01-10 Definiens Ag Analyzing pixel data using image, thematic and object layers of a computer-implemented network structure
US20080099831A1 (en) * 2006-10-31 2008-05-01 Oki Electric Industry Co., Ltd. Semiconductor memory device and method for the same
US20080118141A1 (en) * 2006-11-14 2008-05-22 Codonics, Inc. Assembling multiple medical images into a single film image
US20080133213A1 (en) * 2006-10-30 2008-06-05 Noblis, Inc. Method and system for personal information extraction and modeling with fully generalized extraction contexts
US20080137937A1 (en) * 2006-11-16 2008-06-12 Definiens Ag Automatic image analysis and quantification for fluorescence in situ hybridization
US7392248B2 (en) 1999-08-04 2008-06-24 Hyperroll Israel, Ltd. Data aggregation server supporting rapid query response with sparse multi-dimensional data
US20080189268A1 (en) * 2006-10-03 2008-08-07 Lawrence Au Mechanism for automatic matching of host to guest content via categorization
US7428528B1 (en) 2004-03-31 2008-09-23 Endeca Technologies, Inc. Integrated application for manipulating content in a hierarchical data-driven search and navigation system
US20090083200A1 (en) * 2007-09-21 2009-03-26 Noblis, Inc. Method and system for active learning screening process with dynamic information modeling
US7523126B2 (en) * 1997-06-02 2009-04-21 Rose Blush Software Llc Using hyperbolic trees to visualize data generated by patent-centric and group-oriented data processing
US20090125482A1 (en) * 2007-11-12 2009-05-14 Peregrine Vladimir Gluzman System and method for filtering rules for manipulating search results in a hierarchical search and navigation system
US20090150428A1 (en) * 2005-07-22 2009-06-11 Analyse Solutions Finland Oy Data Management Method and System
US7617184B2 (en) 2000-05-18 2009-11-10 Endeca Technologies, Inc. Scalable hierarchical data-driven navigation system and method for information retrieval
US7689629B1 (en) * 1999-03-30 2010-03-30 Definiens Ag Method of the use of fractal semantic networks for all types of database applications
US7716060B2 (en) 1999-03-02 2010-05-11 Germeraad Paul B Patent-related tools and methodology for use in the merger and acquisition process
US20100169299A1 (en) * 2006-05-17 2010-07-01 Mitretek Systems, Inc. Method and system for information extraction and modeling
US7761473B2 (en) 2007-05-18 2010-07-20 Microsoft Corporation Typed relationships between items
US7966328B2 (en) 1999-03-02 2011-06-21 Rose Blush Software Llc Patent-related tools and methodology for use in research and development projects
US8019752B2 (en) 2005-11-10 2011-09-13 Endeca Technologies, Inc. System and method for information retrieval from object collections with complex interrelationships
US20110289549A1 (en) * 2010-05-24 2011-11-24 Datuit, Llc Method and system for a document-based knowledge system
US8542899B2 (en) 2006-11-30 2013-09-24 Definiens Ag Automatic image analysis and quantification for fluorescence in situ hybridization
US8660974B2 (en) 2009-11-03 2014-02-25 Clausal Computing Oy Inference over semantic network with some links omitted from indexes
US8676802B2 (en) 2006-11-30 2014-03-18 Oracle Otc Subsidiary Llc Method and system for information retrieval with clustering
US9135239B1 (en) * 1999-11-01 2015-09-15 Google Inc. Meaning-based advertising and document relevance determination
US9165040B1 (en) 2006-10-12 2015-10-20 Google Inc. Producing a ranking for pages using distances in a web-link graph
US9411905B1 (en) * 2013-09-26 2016-08-09 Groupon, Inc. Multi-term query subsumption for document classification
CN107924417A (zh) * 2015-08-26 2018-04-17 片山成仁 数据库管理装置及其方法
US20190236459A1 (en) * 2005-09-08 2019-08-01 Apple Inc. Method and apparatus for building an intelligent automated assistant
US20190251172A1 (en) * 2018-02-14 2019-08-15 Capital One Services, Llc Utilizing machine learning models to identify insights in a document
US10546273B2 (en) 2008-10-23 2020-01-28 Black Hills Ip Holdings, Llc Patent mapping
US10579662B2 (en) 2013-04-23 2020-03-03 Black Hills Ip Holdings, Llc Patent claim scope evaluator
US10614082B2 (en) 2011-10-03 2020-04-07 Black Hills Ip Holdings, Llc Patent mapping
US10678820B2 (en) 2018-04-12 2020-06-09 Abel BROWARNIK System and method for computerized semantic indexing and searching
US10810693B2 (en) 2005-05-27 2020-10-20 Black Hills Ip Holdings, Llc Method and apparatus for cross-referencing important IP relationships
US10860657B2 (en) 2011-10-03 2020-12-08 Black Hills Ip Holdings, Llc Patent mapping
CN113282689A (zh) * 2021-07-22 2021-08-20 药渡经纬信息科技(北京)有限公司 基于领域知识图谱的检索方法、装置和搜索引擎
US11461862B2 (en) 2012-08-20 2022-10-04 Black Hills Ip Holdings, Llc Analytics generation for patent portfolio management
US11714839B2 (en) 2011-05-04 2023-08-01 Black Hills Ip Holdings, Llc Apparatus and method for automated and assisted patent claim mapping and expense planning

Families Citing this family (29)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2997469B2 (ja) * 1988-01-11 2000-01-11 株式会社日立製作所 自然言語理解方法および情報検索装置
GB2190772A (en) * 1986-05-05 1987-11-25 David Martin Menne Data storage/retrieval
GB2196764A (en) * 1986-10-30 1988-05-05 Apple Computer Hierarchical file system
JPS6474629A (en) * 1987-09-16 1989-03-20 Toshiba Corp Inference device
GB2217488B (en) * 1988-04-14 1992-03-11 Racal Data Communications Inc Network diagnostic and management apparatus providing improved information display
US5309359A (en) * 1990-08-16 1994-05-03 Boris Katz Method and apparatus for generating and utlizing annotations to facilitate computer text retrieval
US5404295A (en) * 1990-08-16 1995-04-04 Katz; Boris Method and apparatus for utilizing annotations to facilitate computer retrieval of database material
JPH04281568A (ja) * 1991-03-11 1992-10-07 Agency Of Ind Science & Technol 検索装置
JPH04281567A (ja) * 1991-03-11 1992-10-07 Agency Of Ind Science & Technol 検索装置
JPH05197756A (ja) * 1991-12-09 1993-08-06 Ricoh Co Ltd 文書検索装置
GB2293667B (en) * 1994-09-30 1998-05-27 Intermation Limited Database management system
GB2302420A (en) * 1995-06-19 1997-01-15 Ibm Semantic network
US5832495A (en) * 1996-07-08 1998-11-03 Survivors Of The Shoah Visual History Foundation Method and apparatus for cataloguing multimedia data
JP3198932B2 (ja) * 1996-08-02 2001-08-13 松下電器産業株式会社 文書検索装置
US6078914A (en) * 1996-12-09 2000-06-20 Open Text Corporation Natural language meta-search system and method
WO1998055937A1 (fr) * 1997-06-04 1998-12-10 Sharp Gary L Structure de base de donnees et gestion associee
US6584464B1 (en) 1999-03-19 2003-06-24 Ask Jeeves, Inc. Grammar template query system
EP1041499A1 (fr) * 1999-03-31 2000-10-04 International Business Machines Corporation Gestionnaire de fichiers ou de bases de données, et systèmes qui se basent sur celui-ci
WO2001004791A1 (fr) 1999-07-09 2001-01-18 Streamline Systems Pty Ltd Methodes d'organisation de l'information
AU2029601A (en) * 1999-12-17 2001-06-25 Si Han Kim Information coding and retrieval system and method thereof
US6792418B1 (en) 2000-03-29 2004-09-14 International Business Machines Corporation File or database manager systems based on a fractal hierarchical index structure
EP1227410A1 (fr) * 2001-01-30 2002-07-31 Bridgewell Incorporated Accès à une base de données en utilisant des attributs définis par l'utilisateur
WO2004097679A1 (fr) * 2003-04-25 2004-11-11 Hewlett-Packard Development Company, L.P. Dispositif de base de donnees, dispositif de recherche de base de donnees et methode associee
CA2465558A1 (fr) 2004-04-22 2005-10-22 Ibm Canada Limited - Ibm Canada Limitee Cadre pour l'extraction et l'affichage de grands ensembles de resultats
US7590658B2 (en) 2004-09-30 2009-09-15 Deloitte Development Llc System, software and method for examining a database in a forensic accounting environment
US9367625B2 (en) 2013-05-03 2016-06-14 Facebook, Inc. Search query interactions on online social networks
US9367536B2 (en) 2013-05-03 2016-06-14 Facebook, Inc. Using inverse operators for queries on online social networks
US9367880B2 (en) 2013-05-03 2016-06-14 Facebook, Inc. Search intent for queries on online social networks
CN109918472B (zh) 2019-02-27 2026-02-27 北京百度网讯科技有限公司 存储和查询数据的方法、装置、设备和介质

Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4298957A (en) * 1979-06-28 1981-11-03 Xerox Corporation Data processing system with character sort apparatus
US4305131A (en) * 1979-02-05 1981-12-08 Best Robert M Dialog between TV movies and human viewers
US4318184A (en) * 1978-09-05 1982-03-02 Millett Ronald P Information storage and retrieval system and method
US4358824A (en) * 1979-12-28 1982-11-09 International Business Machines Corporation Office correspondence storage and retrieval system
US4384329A (en) * 1980-12-19 1983-05-17 International Business Machines Corporation Retrieval of related linked linguistic expressions including synonyms and antonyms
US4420817A (en) * 1979-05-25 1983-12-13 Sharp Kabushiki Kaisha Word endings inflection means for use with electronic translation device
US4497039A (en) * 1981-06-30 1985-01-29 Fujitsu Limited Join operation processing system in relational model
US4575798A (en) * 1983-06-03 1986-03-11 International Business Machines Corporation External sorting using key value distribution and range formation
US4606002A (en) * 1983-05-02 1986-08-12 Wang Laboratories, Inc. B-tree structured data base using sparse array bit maps to store inverted lists
US4611298A (en) * 1983-06-03 1986-09-09 Harding And Harris Behavioral Research, Inc. Information storage and retrieval system and method

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS603056A (ja) * 1983-06-21 1985-01-09 Toshiba Corp 情報整理装置
JPS60254326A (ja) * 1984-05-31 1985-12-16 Fujitsu Ltd 知識表現方式
JPS615344A (ja) * 1984-06-18 1986-01-11 Fujitsu Ltd 知識検索処理方式

Patent Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4318184A (en) * 1978-09-05 1982-03-02 Millett Ronald P Information storage and retrieval system and method
US4305131A (en) * 1979-02-05 1981-12-08 Best Robert M Dialog between TV movies and human viewers
US4420817A (en) * 1979-05-25 1983-12-13 Sharp Kabushiki Kaisha Word endings inflection means for use with electronic translation device
US4298957A (en) * 1979-06-28 1981-11-03 Xerox Corporation Data processing system with character sort apparatus
US4358824A (en) * 1979-12-28 1982-11-09 International Business Machines Corporation Office correspondence storage and retrieval system
US4384329A (en) * 1980-12-19 1983-05-17 International Business Machines Corporation Retrieval of related linked linguistic expressions including synonyms and antonyms
US4497039A (en) * 1981-06-30 1985-01-29 Fujitsu Limited Join operation processing system in relational model
US4606002A (en) * 1983-05-02 1986-08-12 Wang Laboratories, Inc. B-tree structured data base using sparse array bit maps to store inverted lists
US4575798A (en) * 1983-06-03 1986-03-11 International Business Machines Corporation External sorting using key value distribution and range formation
US4611298A (en) * 1983-06-03 1986-09-09 Harding And Harris Behavioral Research, Inc. Information storage and retrieval system and method

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
Avron Barr, The Handbook of Artificial Intelligence, vol. 1, 1981, pp. 180 183. *
Avron Barr, The Handbook of Artificial Intelligence, vol. 1, 1981, pp. 180-183.
William A. Woods, IEEE Computer, vol. 16, No. 10, Oct. 1983, pp. 22 27. *
William A. Woods, IEEE Computer, vol. 16, No. 10, Oct. 1983, pp. 22-27.

Cited By (215)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5553226A (en) * 1985-03-27 1996-09-03 Hitachi, Ltd. System for displaying concept networks
US5696916A (en) * 1985-03-27 1997-12-09 Hitachi, Ltd. Information storage and retrieval system and display method therefor
US4996665A (en) * 1987-08-05 1991-02-26 Hitachi Ltd. Method and device for editing a document having a plurality of headings
US5561802A (en) * 1987-12-18 1996-10-01 Hitachi, Ltd. Method for managing programs with attribute information and developing loaded programs
US5168565A (en) * 1988-01-20 1992-12-01 Ricoh Company, Ltd. Document retrieval system
US5109508A (en) * 1988-01-29 1992-04-28 Hitachi, Ltd. Data base system including memorandum information and method for managing memorandum information
US5214779A (en) * 1988-06-30 1993-05-25 International Business Machines Corporation Variable construct representation embedded in data stream which references definition for dynamically generating data used in processing the data stream
US6438591B1 (en) 1988-09-14 2002-08-20 Compaq Information Technologies Group L.P. Entity management system
US5345587A (en) * 1988-09-14 1994-09-06 Digital Equipment Corporation Extensible entity management system including a dispatching kernel and modules which independently interpret and execute commands
US5608907A (en) * 1988-09-14 1997-03-04 Digital Equipment Corp. Extensible entity management system including an information manager for obtaining, storing and retrieving information from entities
US5557796A (en) * 1988-09-14 1996-09-17 Digital Equipment Corp. Extensible entity management system including a dispatching kernel and modules which independently interpret and execute commands
US5832224A (en) * 1988-09-14 1998-11-03 Digital Equipment Corporation Entity management system
US5475838A (en) * 1988-09-14 1995-12-12 Digital Equipment Corporation Extensible entity management system including rule-based alarms
US5115504A (en) * 1988-11-01 1992-05-19 Lotus Development Corporation Information management system
US5179718A (en) * 1988-11-29 1993-01-12 International Business Machines Corporation Method of filing having a directed relationship through defining a staple relationship within the context of a folder document
US5101345A (en) * 1988-11-29 1992-03-31 International Business Machines Inc. Method of filing stapled documents with a staple relationship involving one or more application programs
US5193185A (en) * 1989-05-15 1993-03-09 David Lanter Method and means for lineage tracing of a spatial information processing and database system
US5020019A (en) * 1989-05-29 1991-05-28 Ricoh Company, Ltd. Document retrieval system
WO1990015386A1 (fr) * 1989-05-31 1990-12-13 Borrey Roland G Identification de document par correspondance de caracteristiques
US5255364A (en) * 1989-10-31 1993-10-19 Kabushiki Kaisha Toshiba Electronic filing system wherein the automatic updating of retrieval data is voluntarily inhibited
US5535304A (en) * 1989-11-22 1996-07-09 Kabushiki Kaisha Toshiba Inference system having a frame structure and method of storing information therein
US5752016A (en) * 1990-02-08 1998-05-12 Hewlett-Packard Company Method and apparatus for database interrogation using a user-defined table
US5257185A (en) * 1990-05-21 1993-10-26 Ann W. Farley Interactive, cross-referenced knowledge system
US5307266A (en) * 1990-08-22 1994-04-26 Hitachi, Ltd. Information processing system and method for processing document by using structured keywords
US5293552A (en) * 1991-04-08 1994-03-08 U.S. Philips Corporation Method for storing bibliometric information on items from a finite source of text, and in particular document postings for use in a full-text document retrieval system
US5276885A (en) * 1991-04-18 1994-01-04 Carnegie Group Single step mapping in topological order of the queued class and instance frames of a semantic network to a static working memory
US5694590A (en) * 1991-09-27 1997-12-02 The Mitre Corporation Apparatus and method for the detection of security violations in multilevel secure databases
US5321609A (en) * 1992-05-27 1994-06-14 Franklin Electronic Publishers, Incorporated Electronic encyclopedia
US5598557A (en) * 1992-09-22 1997-01-28 Caere Corporation Apparatus and method for retrieving and grouping images representing text files based on the relevance of key words extracted from a selected file to the text files
US5644740A (en) * 1992-12-02 1997-07-01 Hitachi, Ltd. Method and apparatus for displaying items of information organized in a hierarchical structure
US5594837A (en) * 1993-01-29 1997-01-14 Noyes; Dallas B. Method for representation of knowledge in a computer as a network database system
US5878406A (en) * 1993-01-29 1999-03-02 Noyes; Dallas B. Method for representation of knowledge in a computer as a network database system
US5832494A (en) * 1993-06-14 1998-11-03 Libertech, Inc. Method and apparatus for indexing, searching and displaying data
US5568640A (en) * 1993-09-20 1996-10-22 Hitachi, Ltd. Document retrieving method in a document managing system
US5873056A (en) * 1993-10-12 1999-02-16 The Syracuse University Natural language processing system for semantic vector representation which accounts for lexical ambiguity
US5909688A (en) * 1993-10-29 1999-06-01 Fujitsu Limited Information management system
US5761496A (en) * 1993-12-14 1998-06-02 Kabushiki Kaisha Toshiba Similar information retrieval system and its method
US5586252A (en) * 1994-05-24 1996-12-17 International Business Machines Corporation System for failure mode and effects analysis
US5720008A (en) * 1994-05-25 1998-02-17 Lucent Technologies Inc. Knowledge base management system with dependency information for procedural tests
US7076501B2 (en) 1994-12-15 2006-07-11 Ufil Unified Data Technologies, Ltd. Method and apparatus for binary-oriented set sequencing
US6694327B2 (en) 1994-12-15 2004-02-17 Ufil Unified Data Technologies, Ltd. Method and apparatus for binary-oriented set sequencing
US20040139055A1 (en) * 1994-12-15 2004-07-15 Ufil Unified Data Technologies, Ltd. Method and apparatus for binary-oriented set sequencing
US20060064433A1 (en) * 1994-12-15 2006-03-23 Ufil Unified Data Technolgies, Ltd. Method and apparatus for binary-oriented set sequencing
US6029160A (en) * 1995-05-24 2000-02-22 International Business Machines Corporation Method and means for linking a database system with a system for filing data
US5721902A (en) * 1995-09-15 1998-02-24 Infonautics Corporation Restricted expansion of query terms using part of speech tagging
US6112199A (en) * 1995-10-18 2000-08-29 Nelson; Paul M. Data item values
US5842203A (en) * 1995-12-01 1998-11-24 International Business Machines Corporation Method and system for performing non-boolean search queries in a graphical user interface
US5937400A (en) * 1997-03-19 1999-08-10 Au; Lawrence Method to quantify abstraction within semantic networks
US7523126B2 (en) * 1997-06-02 2009-04-21 Rose Blush Software Llc Using hyperbolic trees to visualize data generated by patent-centric and group-oriented data processing
US7797336B2 (en) 1997-06-02 2010-09-14 Tim W Blair System, method, and computer program product for knowledge management
US6505198B2 (en) 1997-07-25 2003-01-07 Claritech Corporation Sort system for text retrieval
US6278990B1 (en) 1997-07-25 2001-08-21 Claritech Corporation Sort system for text retrieval
US6311176B1 (en) * 1997-08-29 2001-10-30 Ipcentury Ag Method and data structure for the computer-aided management of developments
US6519577B1 (en) 1997-12-19 2003-02-11 Bae Systems Plc Digital signal filter using weightless neural techniques
US20030130976A1 (en) * 1998-05-28 2003-07-10 Lawrence Au Semantic network methods to disambiguate natural language meaning
US20070294229A1 (en) * 1998-05-28 2007-12-20 Q-Phrase Llc Chat conversation methods traversing a provisional scaffold of meanings
US20100161317A1 (en) * 1998-05-28 2010-06-24 Lawrence Au Semantic network methods to disambiguate natural language meaning
US7711672B2 (en) 1998-05-28 2010-05-04 Lawrence Au Semantic network methods to disambiguate natural language meaning
US20100030723A1 (en) * 1998-05-28 2010-02-04 Lawrence Au Semantic network methods to disambiguate natural language meaning
US20070294200A1 (en) * 1998-05-28 2007-12-20 Q-Phrase Llc Automatic data categorization with optimally spaced semantic seed terms
US8135660B2 (en) 1998-05-28 2012-03-13 Qps Tech. Limited Liability Company Semantic network methods to disambiguate natural language meaning
US8204844B2 (en) 1998-05-28 2012-06-19 Qps Tech. Limited Liability Company Systems and methods to increase efficiency in semantic networks to disambiguate natural language meaning
US20100030724A1 (en) * 1998-05-28 2010-02-04 Lawrence Au Semantic network methods to disambiguate natural language meaning
US6778970B2 (en) * 1998-05-28 2004-08-17 Lawrence Au Topological methods to organize semantic network data flows for conversational applications
US8396824B2 (en) 1998-05-28 2013-03-12 Qps Tech. Limited Liability Company Automatic data categorization with optimally spaced semantic seed terms
US8200608B2 (en) 1998-05-28 2012-06-12 Qps Tech. Limited Liability Company Semantic network methods to disambiguate natural language meaning
US6871199B1 (en) * 1998-06-02 2005-03-22 International Business Machines Corporation Processing of textual information and automated apprehension of information
US6282531B1 (en) * 1998-06-12 2001-08-28 Cognimed, Llc System for managing applied knowledge and workflow in multiple dimensions and contexts
US7930324B2 (en) 1998-07-29 2011-04-19 Qwest Communications International, Inc. Information organization and navigation by user-generated associative overlays
US8312059B2 (en) 1998-07-29 2012-11-13 Qwest Communications International Inc. Information organization and navigation by user-generated associative overlays
US7209928B2 (en) 1998-07-29 2007-04-24 Qwest Communications International Inc. Information organization and navigation by user-generated associative overlays
US20070176947A1 (en) * 1998-07-29 2007-08-02 Qwest Communications International Inc. Information organization and navigation by user-generated associative overlays
US6792430B1 (en) * 1998-07-29 2004-09-14 Qwest Communications International Information organization and navigation by user-generated associative overlays
US20110179092A1 (en) * 1998-07-29 2011-07-21 Qwest Communications International, Inc. Information Organization and Navigation by User-Generated Associative Overlays
US20040049488A1 (en) * 1998-07-29 2004-03-11 Qwest Communications International Inc. Information organization and navigation by user-generated associative overplays
US7966328B2 (en) 1999-03-02 2011-06-21 Rose Blush Software Llc Patent-related tools and methodology for use in research and development projects
US7716060B2 (en) 1999-03-02 2010-05-11 Germeraad Paul B Patent-related tools and methodology for use in the merger and acquisition process
US6513027B1 (en) * 1999-03-16 2003-01-28 Oracle Corporation Automated category discovery for a terminological knowledge base
US7689629B1 (en) * 1999-03-30 2010-03-30 Definiens Ag Method of the use of fractal semantic networks for all types of database applications
US8041670B2 (en) 1999-08-04 2011-10-18 Yanicklo Technology Limited Liability Company Data aggregation module supporting dynamic query responsive aggregation during the servicing of database query requests provided by one or more client machines
US8799209B2 (en) 1999-08-04 2014-08-05 Yanicklo Technology Limited Liability Company Data aggregation module supporting dynamic query responsive aggregation during the servicing of database query requests provided by one or more client machines
US20100185581A1 (en) * 1999-08-04 2010-07-22 Hyperroll, Inc. Data aggregation module supporting dynamic query responsive aggregation during the servicing of database query requests provided by one or more client machines
US20050060326A1 (en) * 1999-08-04 2005-03-17 Reuven Bakalash Stand-alone cartridge-style data aggregation server and method of and system for managing multi-dimensional databases using the same
US8788453B2 (en) 1999-08-04 2014-07-22 Yanicklo Technology Limited Liability Company Data aggregation module supporting dynamic query responsive aggregation during the servicing of database query requests provided by one or more client machines
US7392248B2 (en) 1999-08-04 2008-06-24 Hyperroll Israel, Ltd. Data aggregation server supporting rapid query response with sparse multi-dimensional data
US8463736B2 (en) 1999-08-04 2013-06-11 Yanicklo Technology Limited Liability Company Relational database management system having integrated non-relational multi-dimensional data store of aggregated data elements
US9710825B1 (en) 1999-09-22 2017-07-18 Google Inc. Meaning-based advertising and document relevance determination
US9135239B1 (en) * 1999-11-01 2015-09-15 Google Inc. Meaning-based advertising and document relevance determination
US7437004B2 (en) * 1999-12-14 2008-10-14 Definiens Ag Method for processing data structures with networked semantic units
US7574053B2 (en) 1999-12-14 2009-08-11 Definiens Ag Method for processing data structures
US20030115175A1 (en) * 1999-12-14 2003-06-19 Martin Baatz Method for processing data structures
US20070112823A1 (en) * 1999-12-14 2007-05-17 Definiens Ag Method for processing data structures
US20020190610A1 (en) * 1999-12-16 2002-12-19 Philippe Andre Self-powered remote control device, electrical apparatus and installation comprising same
US8321373B2 (en) 2000-02-28 2012-11-27 Yanicklo Technology Limited Liability Method of servicing query statements from a client machine using a database management system (DBMS) employing a relational datastore and a multi-dimensional database (MDDB)
US7333982B2 (en) 2000-02-28 2008-02-19 Hyperroll Israel, Ltd. Information system having a mode of operation in which queries form one or more clients are serviced using aggregated data retrieved from a plurality of different types of data storage structures for improved query performance
US7315849B2 (en) 2000-02-28 2008-01-01 Hyperroll Israel, Ltd. Enterprise-wide data-warehouse with integrated data aggregation engine
US8473450B2 (en) 2000-02-28 2013-06-25 Yanicklo Technology Limited Liability Company Relational database management system (RDBMS) employing multi-dimensional database (MDDB) for servicing query statements through one or more client machines
US20070233644A1 (en) * 2000-02-28 2007-10-04 Reuven Bakalash System with a data aggregation module generating aggregated data for responding to OLAP analysis queries in a user transparent manner
US8452804B2 (en) 2000-02-28 2013-05-28 Yanicklo Technology Limited Liability Company Database management system (DBMS) employing a relational datastore and a multi-dimensional database (MDDB) for servicing query statements in a manner transparent to client machine
US8170984B2 (en) 2000-02-28 2012-05-01 Yanicklo Technology Limited Liability Company System with a data aggregation module generating aggregated data for responding to OLAP analysis queries in a user transparent manner
US20050149491A1 (en) * 2000-02-28 2005-07-07 Reuven Bakalash Database management system having data aggregation module integrated therein
US8195602B2 (en) 2000-02-28 2012-06-05 Yanicklo Technology Limited Liability Company Relational database management system (RDBMS) employing a relational datastore and a multi-dimensional database (MDDB) for serving query statements from client machines
US6556982B1 (en) * 2000-04-28 2003-04-29 Bwxt Y-12, Llc Method and system for analyzing and classifying electronic information
US7567957B2 (en) 2000-05-18 2009-07-28 Endeca Technologies, Inc. Hierarchical data-driven search and navigation system and method for information retrieval
US7617184B2 (en) 2000-05-18 2009-11-10 Endeca Technologies, Inc. Scalable hierarchical data-driven navigation system and method for information retrieval
US7325201B2 (en) 2000-05-18 2008-01-29 Endeca Technologies, Inc. System and method for manipulating content in a hierarchical data-driven search and navigation system
US7035864B1 (en) 2000-05-18 2006-04-25 Endeca Technologies, Inc. Hierarchical data-driven navigation system and method for information retrieval
US20070083505A1 (en) * 2000-05-18 2007-04-12 Ferrari Adam J Hierarchical data-driven search and navigation system and method for information retrieval
US20030097357A1 (en) * 2000-05-18 2003-05-22 Ferrari Adam J. System and method for manipulating content in a hierarchical data-driven search and navigation system
US7912823B2 (en) 2000-05-18 2011-03-22 Endeca Technologies, Inc. Hierarchical data-driven navigation system and method for information retrieval
US20040083062A1 (en) * 2000-07-07 2004-04-29 Maria Athelogou Method for the processing of several different data structures
US20050114763A1 (en) * 2001-03-30 2005-05-26 Kabushiki Kaisha Toshiba Apparatus, method, and program for retrieving structured documents
US7231386B2 (en) * 2001-03-30 2007-06-12 Kabushiki Kaisha Toshiba Apparatus, method, and program for retrieving structured documents
US20040049522A1 (en) * 2001-04-09 2004-03-11 Health Language, Inc. Method and system for interfacing with a multi-level data structure
US7668737B2 (en) 2001-04-09 2010-02-23 Health Language, Inc. Method and system for interfacing with a multi-level data structure
US20030120630A1 (en) * 2001-12-20 2003-06-26 Daniel Tunkelang Method and system for similarity search and clustering
US6999966B2 (en) * 2002-04-23 2006-02-14 International Business Machines Corporation Content management system and methodology for implementing a complex object using nested/recursive structures
US20030204537A1 (en) * 2002-04-23 2003-10-30 International Business Machines Corporation Content management system and methodology for implementing a complex object using nested/recursive structures
US20030210249A1 (en) * 2002-05-08 2003-11-13 Simske Steven J. System and method of automatic data checking and correction
US20080008349A1 (en) * 2002-10-15 2008-01-10 Definiens Ag Analyzing pixel data using image, thematic and object layers of a computer-implemented network structure
US7801361B2 (en) 2002-10-15 2010-09-21 Definiens Ag Analyzing pixel data using image, thematic and object layers of a computer-implemented network structure
WO2004088546A3 (fr) * 2003-03-27 2007-12-27 Electronic Data Syst Corp Representation de donnees pour analyse de liens amelioree
US20040249829A1 (en) * 2003-03-27 2004-12-09 Kasra Kasravi Knowledge representation using reflective links for link analysis applications
US20040193514A1 (en) * 2003-03-27 2004-09-30 Kasra Kasravi Data representation for improved link analysis
US7593909B2 (en) * 2003-03-27 2009-09-22 Hewlett-Packard Development Company, L.P. Knowledge representation using reflective links for link analysis applications
US7580947B2 (en) 2003-03-27 2009-08-25 Hewlett-Packard Development Company, L.P. Data representation for improved link analysis
US20050028168A1 (en) * 2003-06-26 2005-02-03 Cezary Marcjan Sharing computer objects with associations
US20070061276A1 (en) * 2003-07-10 2007-03-15 Akira Sato Device and method for registering a plurality of types of information
US7428528B1 (en) 2004-03-31 2008-09-23 Endeca Technologies, Inc. Integrated application for manipulating content in a hierarchical data-driven search and navigation system
US11776084B2 (en) 2004-08-10 2023-10-03 Lucid Patent Llc Patent mapping
US20060036451A1 (en) * 2004-08-10 2006-02-16 Lundberg Steven W Patent mapping
US12380525B2 (en) 2004-08-10 2025-08-05 Lucid Patent Llc Patent mapping
US20110072014A1 (en) * 2004-08-10 2011-03-24 Foundationip, Llc Patent mapping
US9697577B2 (en) 2004-08-10 2017-07-04 Lucid Patent Llc Patent mapping
US11080807B2 (en) 2004-08-10 2021-08-03 Lucid Patent Llc Patent mapping
EP1650681A3 (fr) * 2004-10-25 2006-11-22 Hewlett-Packard Development Company, L.P. Structure de données, système de base de données et procédé pour la gestion et/ou la conversion de données
US20060122985A1 (en) * 2004-10-25 2006-06-08 Hewlett-Packard Development Company, L.P. Data structure, database system, and method and computer-readable medium storing program for data management and/or conversion
US12380521B2 (en) 2005-05-27 2025-08-05 Black Hills Ip Holdings, Llc Method and apparatus for cross-referencing important IP relationships
US11798111B2 (en) 2005-05-27 2023-10-24 Black Hills Ip Holdings, Llc Method and apparatus for cross-referencing important IP relationships
US10810693B2 (en) 2005-05-27 2020-10-20 Black Hills Ip Holdings, Llc Method and apparatus for cross-referencing important IP relationships
US20090150428A1 (en) * 2005-07-22 2009-06-11 Analyse Solutions Finland Oy Data Management Method and System
US20160078109A1 (en) * 2005-07-27 2016-03-17 Schwegman Lundberg & Woessner, P.A. Patent mapping
US20120130993A1 (en) * 2005-07-27 2012-05-24 Schwegman Lundberg & Woessner, P.A. Patent mapping
US8161025B2 (en) * 2005-07-27 2012-04-17 Schwegman, Lundberg & Woessner, P.A. Patent mapping
US9659071B2 (en) * 2005-07-27 2017-05-23 Schwegman Lundberg & Woessner, P.A. Patent mapping
US9201956B2 (en) * 2005-07-27 2015-12-01 Schwegman Lundberg & Woessner, P.A. Patent mapping
US20070198578A1 (en) * 2005-07-27 2007-08-23 Lundberg Steven W Patent mapping
US20190236459A1 (en) * 2005-09-08 2019-08-01 Apple Inc. Method and apparatus for building an intelligent automated assistant
US11928604B2 (en) * 2005-09-08 2024-03-12 Apple Inc. Method and apparatus for building an intelligent automated assistant
US8019752B2 (en) 2005-11-10 2011-09-13 Endeca Technologies, Inc. System and method for information retrieval from object collections with complex interrelationships
US7890533B2 (en) 2006-05-17 2011-02-15 Noblis, Inc. Method and system for information extraction and modeling
US20100169299A1 (en) * 2006-05-17 2010-07-01 Mitretek Systems, Inc. Method and system for information extraction and modeling
US20080189268A1 (en) * 2006-10-03 2008-08-07 Lawrence Au Mechanism for automatic matching of host to guest content via categorization
US9165040B1 (en) 2006-10-12 2015-10-20 Google Inc. Producing a ranking for pages using distances in a web-link graph
US9953049B1 (en) 2006-10-12 2018-04-24 Google Llc Producing a ranking for pages using distances in a web-link graph
US20080133213A1 (en) * 2006-10-30 2008-06-05 Noblis, Inc. Method and system for personal information extraction and modeling with fully generalized extraction contexts
US9177051B2 (en) 2006-10-30 2015-11-03 Noblis, Inc. Method and system for personal information extraction and modeling with fully generalized extraction contexts
US7949629B2 (en) 2006-10-30 2011-05-24 Noblis, Inc. Method and system for personal information extraction and modeling with fully generalized extraction contexts
US20080099831A1 (en) * 2006-10-31 2008-05-01 Oki Electric Industry Co., Ltd. Semiconductor memory device and method for the same
US20080118141A1 (en) * 2006-11-14 2008-05-22 Codonics, Inc. Assembling multiple medical images into a single film image
US8565552B2 (en) * 2006-11-14 2013-10-22 Codonics, Inc. Assembling multiple medical images into a single film image
US8019134B2 (en) 2006-11-16 2011-09-13 Definiens Ag Automatic image analysis and quantification for fluorescence in situ hybridization
US8391575B2 (en) 2006-11-16 2013-03-05 Definiens Ag Automatic image analysis and quantification for fluorescence in situ hybridization
US20080137937A1 (en) * 2006-11-16 2008-06-12 Definiens Ag Automatic image analysis and quantification for fluorescence in situ hybridization
US8542899B2 (en) 2006-11-30 2013-09-24 Definiens Ag Automatic image analysis and quantification for fluorescence in situ hybridization
US8676802B2 (en) 2006-11-30 2014-03-18 Oracle Otc Subsidiary Llc Method and system for information retrieval with clustering
US7761473B2 (en) 2007-05-18 2010-07-20 Microsoft Corporation Typed relationships between items
US8126826B2 (en) 2007-09-21 2012-02-28 Noblis, Inc. Method and system for active learning screening process with dynamic information modeling
US20090083200A1 (en) * 2007-09-21 2009-03-26 Noblis, Inc. Method and system for active learning screening process with dynamic information modeling
US7856434B2 (en) 2007-11-12 2010-12-21 Endeca Technologies, Inc. System and method for filtering rules for manipulating search results in a hierarchical search and navigation system
US20090125482A1 (en) * 2007-11-12 2009-05-14 Peregrine Vladimir Gluzman System and method for filtering rules for manipulating search results in a hierarchical search and navigation system
US12361380B2 (en) 2008-10-23 2025-07-15 Black Hills Ip Holdings, Llc Patent mapping
US11301810B2 (en) 2008-10-23 2022-04-12 Black Hills Ip Holdings, Llc Patent mapping
US10546273B2 (en) 2008-10-23 2020-01-28 Black Hills Ip Holdings, Llc Patent mapping
US8660974B2 (en) 2009-11-03 2014-02-25 Clausal Computing Oy Inference over semantic network with some links omitted from indexes
US8931039B2 (en) * 2010-05-24 2015-01-06 Datuit, Llc Method and system for a document-based knowledge system
US20110289549A1 (en) * 2010-05-24 2011-11-24 Datuit, Llc Method and system for a document-based knowledge system
US11714839B2 (en) 2011-05-04 2023-08-01 Black Hills Ip Holdings, Llc Apparatus and method for automated and assisted patent claim mapping and expense planning
US12339880B2 (en) 2011-05-04 2025-06-24 Black Hills Ip Holdings, Llc Automated patent claim scope concept mapping
US11256706B2 (en) 2011-10-03 2022-02-22 Black Hills Ip Holdings, Llc System and method for patent and prior art analysis
US11789954B2 (en) 2011-10-03 2023-10-17 Black Hills Ip Holdings, Llc System and method for patent and prior art analysis
US10860657B2 (en) 2011-10-03 2020-12-08 Black Hills Ip Holdings, Llc Patent mapping
US12505111B2 (en) 2011-10-03 2025-12-23 Black Hills Ip Holdings, Llc Patent mapping
US12380171B2 (en) 2011-10-03 2025-08-05 Black Hills Ip Holdings, Llc Patent mapping
US12189637B2 (en) 2011-10-03 2025-01-07 Black Hills Ip Holdings, Llc Patent claim mapping
US12164532B2 (en) 2011-10-03 2024-12-10 Black Hills Ip Holdings, Llc Systems, methods and user interfaces in a patent management system
US12164533B2 (en) 2011-10-03 2024-12-10 Black Hills IP Holdings, LLC. System and method for patent and prior art analysis
US12147439B2 (en) 2011-10-03 2024-11-19 Black Hills IP Holdings, LLC. Patent mapping
US11360988B2 (en) 2011-10-03 2022-06-14 Black Hills Ip Holdings, Llc Systems, methods and user interfaces in a patent management system
US12135724B2 (en) 2011-10-03 2024-11-05 Black Hills Ip Holdings, Llc Systems, methods and user interfaces in a patent management system
US11803560B2 (en) 2011-10-03 2023-10-31 Black Hills Ip Holdings, Llc Patent claim mapping
US11797546B2 (en) 2011-10-03 2023-10-24 Black Hills Ip Holdings, Llc Patent mapping
US11714819B2 (en) 2011-10-03 2023-08-01 Black Hills Ip Holdings, Llc Patent mapping
US10614082B2 (en) 2011-10-03 2020-04-07 Black Hills Ip Holdings, Llc Patent mapping
US11775538B2 (en) 2011-10-03 2023-10-03 Black Hills Ip Holdings, Llc Systems, methods and user interfaces in a patent management system
US11048709B2 (en) 2011-10-03 2021-06-29 Black Hills Ip Holdings, Llc Patent mapping
US11461862B2 (en) 2012-08-20 2022-10-04 Black Hills Ip Holdings, Llc Analytics generation for patent portfolio management
US12008670B2 (en) 2012-08-20 2024-06-11 Black Hills IP Holdings, LLC. Analytics generation for patent portfolio management
US10579662B2 (en) 2013-04-23 2020-03-03 Black Hills Ip Holdings, Llc Patent claim scope evaluator
US11354344B2 (en) 2013-04-23 2022-06-07 Black Hills Ip Holdings, Llc Patent claim scope evaluator
US9411905B1 (en) * 2013-09-26 2016-08-09 Groupon, Inc. Multi-term query subsumption for document classification
US20230045330A1 (en) * 2013-09-26 2023-02-09 Groupon, Inc. Multi-term query subsumption for document classification
US20170031927A1 (en) * 2013-09-26 2017-02-02 Groupon, Inc. Multi-term query subsumption for document classification
US11403331B2 (en) * 2013-09-26 2022-08-02 Groupon, Inc. Multi-term query subsumption for document classification
US9652527B2 (en) * 2013-09-26 2017-05-16 Groupon, Inc. Multi-term query subsumption for document classification
US10726055B2 (en) * 2013-09-26 2020-07-28 Groupon, Inc. Multi-term query subsumption for document classification
CN107924417A (zh) * 2015-08-26 2018-04-17 片山成仁 数据库管理装置及其方法
CN107924417B (zh) * 2015-08-26 2022-04-15 片山成仁 数据库管理装置及其方法
US11861477B2 (en) 2018-02-14 2024-01-02 Capital One Services, Llc Utilizing machine learning models to identify insights in a document
US12242942B2 (en) 2018-02-14 2025-03-04 Capital One Services, Llc Utilizing machine learning models to identify insights in a document
US11227121B2 (en) 2018-02-14 2022-01-18 Capital One Services, Llc Utilizing machine learning models to identify insights in a document
US20190251172A1 (en) * 2018-02-14 2019-08-15 Capital One Services, Llc Utilizing machine learning models to identify insights in a document
US10489512B2 (en) * 2018-02-14 2019-11-26 Capital One Services, Llc Utilizing machine learning models to identify insights in a document
US10678820B2 (en) 2018-04-12 2020-06-09 Abel BROWARNIK System and method for computerized semantic indexing and searching
CN113282689A (zh) * 2021-07-22 2021-08-20 药渡经纬信息科技(北京)有限公司 基于领域知识图谱的检索方法、装置和搜索引擎

Also Published As

Publication number Publication date
JPH0584538B2 (fr) 1993-12-02
EP0638870B1 (fr) 1999-12-29
DE3650736T2 (de) 2000-06-08
EP0196064A3 (en) 1989-11-15
JPS61220027A (ja) 1986-09-30
DE3650417T2 (de) 1996-05-15
DE3650417D1 (de) 1995-11-23
DE3650736D1 (de) 2000-02-03
EP0196064A2 (fr) 1986-10-01
EP0196064B1 (fr) 1995-10-18
EP0638870A1 (fr) 1995-02-15

Similar Documents

Publication Publication Date Title
US4868733A (en) Document filing system with knowledge-base network of concept interconnected by generic, subsumption, and superclass relations
US6182062B1 (en) Knowledge based information retrieval system
US5555408A (en) Knowledge based information retrieval system
Chu Information representation and retrieval in the digital age
Chang et al. A survey of web information extraction systems
US7139977B1 (en) System and method for producing a virtual online book
Richards et al. Computing in qualitative analysis: a healthy development?
KR100638695B1 (ko) 구조화 문서의 데이터를 검색하는 장치 및 방법
US20080027933A1 (en) System and method for location, understanding and assimilation of digital documents through abstract indicia
Golovchinsky Queries? Links? Is there a difference?
Pedersen A browser for bibliographic information retrieval, based on an application of lattice theory
Reich et al. New roles for machine learning in design
Rus et al. Customizing information capture and access
Ouaret et al. AuMixDw: Towards an automated hybrid approach for building XML data warehouses
JPH0727532B2 (ja) 情報検索方法及びシステム
KR102593884B1 (ko) 문서 자동 작성 시스템 및 방법, 컴퓨터로 독출 가능한 기록 매체
WO2001029709A1 (fr) Systeme et procede de localisation, de comprehension et d'assimilation de documents numeriques par des indices de resumes
Nargesian et al. Optimizing organizations for navigating data lakes
Chander et al. An expert system to aid cataloging and searching electronic documents on digital libraries
JP3579945B2 (ja) 階層項目検索装置および階層項目検索方法
Ellmer et al. Neural network technology to support view integration
Tansley The multimedia thesaurus: An aid for multimedia information retrieval and navigation
Nargesian et al. Data lake organization
AU3785499A (en) Method and apparatus for collecting, organizing and analyzing data
El Amrani et al. Coping with information retrieval problems on the web: Towards personal web weaver agents

Legal Events

Date Code Title Description
AS Assignment

Owner name: HITACHI, LTD., 6, KANDA SURUGADAI 4-CHOME, CHIYODA

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST.;ASSIGNORS:FUJISAWA, HIROMICHI;HIGASHINO, JUN'ICHI;HATAKEYAMA, ATUSHI;REEL/FRAME:004533/0092

Effective date: 19860313

STCF Information on status: patent grant

Free format text: PATENTED CASE

FEPP Fee payment procedure

Free format text: PAYOR NUMBER ASSIGNED (ORIGINAL EVENT CODE: ASPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

FPAY Fee payment

Year of fee payment: 4

FPAY Fee payment

Year of fee payment: 8

FPAY Fee payment

Year of fee payment: 12