JP2808893B2 - Text conversion method - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a text conversion method for converting a plain text used in a computer system into a hierarchically structured hypertext.

[0002]

2. Description of the Related Art Conventionally, as a text conversion method for converting a plain text into a hypertext used in a computer system, 1) a unit text up to a delimiter of a plain text is created as one node for each time. And
This node is manually hierarchically structured to convert the plain text into hypertext. 2) The plain text is modified, and special characters indicating the hierarchy and structure are embedded in appropriate portions of the plain text. There is a method of converting the plain text into hypertext by relying on special characters.

[0003] However, the method 1) basically takes a great deal of time because it is manually made into a hierarchical structure.
In the method 2), the work of embedding the special characters is troublesome, and both methods require a great deal of labor and time.

[0004]

As described above, in the conventional text conversion method for converting plain text to hypertext, it is necessary to modify the hierarchical structure manually or to embed special characters in the plain text. Therefore, converting the plain text to the hypertext was very labor-intensive and time-consuming.

SUMMARY OF THE INVENTION It is an object of the present invention to provide a text conversion method that can easily and simply convert plain text into hypertext in a short time.

[0006]

According to the present invention, in order to achieve the above object, a keyword tree composed of keywords hierarchically structured on a hypertext is created, and a keyword to be converted into a keyword tree of the keyword tree. A keyword included in the unit text read from the original text is compared with a keyword having a deeper hierarchical structure in the keyword tree, and the unit text is linked to a keyword having a deeper hierarchical structure than its own keyword. A link is formed between the unit text and the keyword on condition that there is no unit text, and this operation is repeated for each unit text to convert the plain text into hypertext.

[0007]

According to the present invention, the plain text is automatically converted directly into the hypertext by comparing the keyword tree on the hypertext with the keyword included in the unit text read from the plain text to be converted. The conversion process becomes very easy.

[0008]

FIG. 1 shows an example of a hardware configuration of a system to which a text conversion method according to the present invention is applied. This system is a hypertext database 1
0, a control device 20, a storage device 30, a display 50, a keyboard, and a mouse 70 connected to the control device 20 via the input / output device 40.

The hypertext database 10 stores hierarchically structured hypertexts. The hypertext includes node information which is a block of information and link information indicating a link relationship with each node. The control device 20 controls the hypertext database 1
For example, the processing of the hypertext stored in “0” and the processing of converting plain text to hypertext related to the present invention are executed. The storage device 30 stores plain text to be converted according to the present invention and other various data necessary for controlling the system.
The processing in the control device 20 is executed according to commands input from the keyboard 60 and the mouse 70 via the input / output device 20, and the processing result and the processing state in the control device 20 are displayed on the display 50 via the input / output device 40. You.

Next, the operation of this embodiment will be described with reference to the flowcharts shown in FIGS. 2 and 3 and the specific processing examples shown in FIGS. In this embodiment, the storage device 3
0 is converted into a hierarchically structured hypertext on the hypertext of the hypertext database 10. Here, the plain text stored in the storage device 30 is input from the keyboard 60 via the input / output device 40,
The data is input in advance by another device (not shown) and transferred to the storage device.

First, the hypertext database 10
A keyword tree is created on the hypertext (step 101). This keyword tree is composed of a plurality of keywords structured as shown in FIG. 4, for example. A to A described in each block in FIG.
F represents keywords, and a solid line drawn between the blocks represents a hierarchical relationship between these keywords.

Next, it is determined whether or not the plain text to be converted ends (step 102). Here, the text conversion has just begun, and the plain text to be converted is not the end. Therefore, first, from the plain text to be converted to a predetermined delimiter is read as one unit text (step 10).
3) For the keywords included in the unit text, a backtracking process of the keywords is executed with reference to a keyword tree as shown in FIG. 4 (step 10).
4).

The details of the keyword backtracking process are shown in the flowchart of FIG. In this keyword backtracking process, step 10 in FIG.
Following this keyword tree, priority is given to keywords deep in the hierarchy of the keyword tree created in step 1 and the keywords included in the unit text read from the plain text to be converted are included in the keywords of this keyword tree. Find out if there is a match,
If there is a match, a link is formed between this keyword and the unit text. That is, this will be further described with reference to the keyword tree shown in FIG. 4. In the keyword tree of FIG. 4, the keyword having the deepest hierarchy is the keyword F, and the keywords having the next deeper hierarchy are the keywords D and E. Keywords B and C have the next highest levels, and keyword A has the lowest level. Therefore, in the case of this keyword tree, as shown in FIG. 5, matching of the keyword F is checked first, and then matching is checked in the order of the keywords D, E, B, C and A.

In the flowchart of FIG. 3, first,
It is checked whether there are any more keywords in the keyword tree, that is, if any of the keywords in the keyword tree have not yet been checked for matching. Here, as shown in FIG. 5, keyword matching is performed with priority given to keywords having a deeper hierarchy in the keyword tree. Therefore, when matching of the keyword having the lowest hierarchy (keyword A in FIG. 5) is completed, In step 201, it is determined that there is no keyword in the keyword tree to be referred to. Since there are still keywords in the keyword tree to be referred to here, matching between the keywords in the keyword tree and the keywords included in the unit text is performed (step 202). In this matching, when it is determined that the keyword in the keyword tree matches the keyword included in the unit text (step 2).
03) Then, it is checked whether the unit text is already linked to its own child, that is, a keyword deeper than itself (step 204). If the keyword is not linked to a keyword deeper than the user, the unit text is used as a node to form a link with the keyword, that is, a keyword matched in the keyword tree (step 205), and the process returns to step 201.
Note that if the keyword in the keyword tree does not match the keyword included in the unit text in step 203, or if the unit text is already linked to one's own child, that is, a keyword deeper than oneself, step 201 is also performed. Return.

This operation is repeated until it is determined in step 201 that there is no keyword in the keyword tree.

In this operation, for example, it is assumed that the unit text read in step 102 of FIG. 2 includes three keywords B, F, and C as shown in FIG. In this case, considering the keyword tree of FIG. 5, first, the keyword F is matched,
This unit text is linked to the keyword F. Next, it matches with keyword B. However, as for the keyword B, since the unit text is already linked to the child of the keyword B, that is, the keyword F which is deeper than the keyword B, the "Y" in step 204 of FIG.
Therefore, the unit text and the keyword B are not linked. After that, it matches the keyword C. Here, since the child of the keyword C and the unit text are not linked, “N” is determined in step 204 in FIG.

When matching with the keyword having the shallowest hierarchy in the keyword tree is completed, and it is determined in step 201 in FIG. 3 that there is no keyword in the keyword tree, the backtracking process for this keyword is terminated.

When the keyword backtracking process is completed, the process returns to step 102 in FIG. 2 and the following process is repeated.

When the reading of the unit text from the plain text to be converted has been completed and the end of the text is determined in step 102 of FIG. 2,
The process of converting the plain text to the hypertext is completed.

As described above, according to this embodiment, the process of converting plain text into hypertext can be automated, and hypertext can be directly created very simply and in a short time.

In the above-described embodiment, a simple keyword is used as a keyword in the keyword tree. In addition, a configuration may be adopted in which a complicated keyword can be specified. Also, the keywords AND, OR, N
An abbreviation may be allowed in the specification of the OT and the keyword.

[0022]

As described above, according to the present invention,
A structured keyword tree is formed on the hypertext, and the plain text is automatically converted directly to the hypertext by matching the keywords of the keyword tree with the keywords contained in the unit text read from the plain text to be converted. Converting to text makes converting to hypertext much easier.

[Brief description of the drawings]

FIG. 1 is a block diagram showing a hardware configuration of a system to which the present invention is applied.

FIG. 2 is a flowchart illustrating the operation of one embodiment of the present invention.

FIG. 3 is a flowchart illustrating details of a keyword backtracking process in the flowchart shown in FIG. 2;

FIG. 4 is a diagram showing an example of a keyword tree for explaining the operation of this embodiment.

FIG. 5 is a view for explaining the order of keyword matching in the keyword tree shown in FIG. 4;

FIG. 6 is an exemplary view for explaining an example of a unit text read in the embodiment.

[Explanation of symbols]

 Reference Signs List 10 hypertext database 20 control device 30 storage device 40 input / output device 50 display 60 keyboard 70 mouse

Continuation of the front page (56) References JP-A-2-178877 (JP, A) JP-A-59-38846 (JP, A) Tomohiko Terada, Mamoru Sato, Kotaro Mano, "Using image information and hypertext structure" Prototype of Information Storage and Index System, "Proc. Of the 40th Annual Meeting of the Information Processing Society of Japan (above, 1990), pp. 644-645 (March, 1990). WLSON, "CASES FO R JUSTUS: PREPARING A CASE DATABASE F OR A HYPERTEXT INF ORMATION RETRIEVAL SYSTEM", LITERARYH & LINGUISTIC COMP UTING VOL5, NO2 (1990), 119-128 PICHARD POLLARD, "HYPERTEXT PRESENTA TION OF THESAURI U SED IN ONLINE SEA CHING ", ELECTRONIC PUBLISHING ORIGINA TION DISSEMINATION AND DESIGN PP36-49, WILEY (1990) (58) Fields investigated (Int. Cl. ⁶ , DB name) G06F 17/30

Claims (1)

(57) [Claims] 1. A keyword tree composed of keywords hierarchically structured on a hypertext is created, and a keyword in the keyword tree is compared with a keyword contained in a unit text read from a plain text to be converted. Priority is given to a keyword having a deep hierarchical structure of the keyword tree, and a link between the unit text and the keyword is provided on condition that the unit text is not linked to a keyword having a deeper hierarchical structure than the own keyword. A text conversion method, wherein the plain text is converted into hypertext by forming and repeating this operation for each unit text.