Patent US5564046A successfully refreshed from Google Patents.
← Back to Patent Explorer
US5564046A Expired / Lapsed US ⏱️ 0.0 years remaining

Method and system for creating a database by dividing text data into nodes which can be corrected

Assignee: Canon Inc
•
Filing: 1995-04-07
•
Granted: 1996-10-08
•
Expires: 2015-04-07
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract An apparatus and method in which a data base used in a hypertext is created by dividing given data into nodes and spreading links between the nodes according to a predetermined rule, errors in the process of dividing the data into nodes can be found and corrected before creating links, and links are created with respect to the corrected nodes.

Inventors

  • 👤 Jiro Nemoto
  • 👤 Koichi Masegi
  • 👤 Hiroshi Naito
  • 👤 Youichi Matsuyama
  • 👤 Shinji Yamashita

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-31 15:11
CPC Classifications
G; G06; G06F; G06F16/00; G06F16/90; G06F16/93; G06F16/94; Y; Y10; Y10S; Y10S707/00; Y10S707/99941; Y10S707/99943

Claims Analysis

Total Claims: 12
Claim 1
Independent Claim 197 words
A database creating apparatus, comprising: text data storage means for storing text data representing at least a portion of a document; text division means for dividing the text data stored in said text data storage means at each position of segmentation data in the text data, into a plurality of nodes; node memory means for storing the plurality of nodes obtained by said text division means; display means for displaying the plurality of nodes stored in said node memory means before creating links between the nodes, the plurality of nodes being displayed so that a user can check for errors made by said text division means during the division into the plurality of nodes; correction means for correcting errors in division into the plurality of nodes displayed by said display means by correcting the data corresponding to the plurality of nodes displayed by said display means; correction result memory means for storing the plurality of nodes, including any nodes corrected by said correction means; link creating means for creating links between the nodes, stored in said correction result memory means, including common data; and link memory means for storing the links created by said link creating means.
Claim 2
Dependent Claim 197 words
A database creating apparatus, comprising: text data storage means for storing text data representing at least a portion of a document; text division means for dividing the text data stored in said text data storage means at each position of segmentation data in the text data, into a plurality of nodes; node memory means for storing the plurality of nodes obtained by said text division means; display means for displaying the plurality of nodes stored in said node memory means before creating links between the nodes, the plurality of nodes being displayed so that a user can check for errors made by said text division means during the division into the plurality of nodes; correction means for correcting errors in division into the plurality of nodes displayed by said display means by correcting the data corresponding to the plurality of nodes displayed by said display means; correction result memory means for storing the plurality of nodes, including any nodes corrected by said correction means; link creating means for creating links between the nodes, stored in said correction result memory means, including common data; and link memory means for storing the links created by said link creating means.
Claim 3
Dependent Claim 25 words
A data base creating apparatus according to claim 1, further comprising link creating rule memory means for storing a rule used for creating the links.
Claim 4
Dependent Claim 38 words
A data base creating apparatus according to claim 1, further comprising node creating rule memory means for storing a rule used for dividing the text data stored in said text data storage means into the plurality of nodes.
Claim 5
Dependent Claim 26 words
A data base creating apparatus according to claim 1, wherein said node memory means and said correction result memory means comprise portions of the same memory.
Claim 6
Dependent Claim 67 words
A data base creating apparatus according to claim 1, wherein the text data stored in said text data storage means is text data relating to a dictionary, the plurality of nodes created by said text division means are portions of the dictionary, and each of the links is created between an item explaining a certain portion and a portion having the same contents as the certain portion.
Claim 7
Dependent Claim 51 words
A database constructing apparatus according to claim 1, wherein said text division means provides each node with a respective attribution corresponding to a type of the segmentation data for that node, and wherein said link creation means creates links between the nodes including common data and each having predetermined attributions, respectively.
Claim 8
Independent Claim 143 words
A method of constructing a database having data composed of a plurality of nodes and links for correlating the nodes, said method comprising the steps of: storing text data representing at least a portion of a document; dividing the text data stored in said data storing step at each position of segmentation data in the text data, into a plurality of nodes; storing the plurality of nodes obtained in said dividing step; displaying the plurality of stored nodes before creating links between the nodes, the plurality of nodes being displayed so that a user can check for errors in division into the plurality of nodes occurring during said dividing step; correcting errors occurring in said dividing of the data into the plurality of displayed nodes; storing the plurality of nodes, including any corrected nodes; and creating links between the corrected including common data.
Claim 9
Independent Claim 143 words
A method of constructing a database having data composed of a plurality of nodes and links for correlating the nodes, said method comprising the steps of: storing text data representing at least a portion of a document; dividing the text data stored in said data storing step at each position of segmentation data in the text data, into a plurality of nodes; storing the plurality of nodes obtained in said dividing step; displaying the plurality of stored nodes before creating links between the nodes, the plurality of nodes being displayed so that a user can check for errors in division into the plurality of nodes occurring during said dividing step; correcting errors occurring in said dividing of the data into the plurality of displayed nodes; storing the plurality of nodes, including any corrected nodes; and creating links between the corrected including common data.
Claim 10
Dependent Claim 57 words
A method of constructing database according to claim 7, wherein each of the nodes is provided with a respective attribution corresponding to a type of the segmentation data for that node, in said dividing step, and wherein the links are created between the nodes including common data and each having predetermined attributions, respectively, in said creating step.
Claim 11
Independent Claim 140 words
A method of dividing given dictionary information into a plurality of data, setting the plurality of data into nodes, and creating links for correlating the nodes, said method comprising the steps of: dividing the given dictionary data into entries, and items explaining the entries at each position of segmentation data, and setting each of the divided data as a node; storing the nodes obtained in said dividing step; displaying the stored nodes before creating links between the nodes; correcting the contents of the displayed nodes to correct errors occurring in said dividing step; storing the corrected nodes; and creating, after storing the corrected nodes, a link between a first node corresponding to an item explaining a certain one of the entries and a second node having the same contents as those of the first node and corresponding to another entry.
Claim 12
Independent Claim 140 words
A method of dividing given dictionary information into a plurality of data, setting the plurality of data into nodes, and creating links for correlating the nodes, said method comprising the steps of: dividing the given dictionary data into entries, and items explaining the entries at each position of segmentation data, and setting each of the divided data as a node; storing the nodes obtained in said dividing step; displaying the stored nodes before creating links between the nodes; correcting the contents of the displayed nodes to correct errors occurring in said dividing step; storing the corrected nodes; and creating, after storing the corrected nodes, a link between a first node corresponding to an item explaining a certain one of the entries and a second node having the same contents as those of the first node and corresponding to another entry.

References Cited (Backward Citations)

US4611298A Cited
US5371885A Cited
US5355472A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1999-10-08 2000-04-08 2000-10-08 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2003-10-08 2004-04-08 2004-10-08 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2007-10-08 2008-04-08 2008-10-08 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag