JPH0895975A - Preparation method for logically structured document - Google Patents

Abstract

PURPOSE: To easily prepare a logically structured document hierarchically reorganized document data regardlessly of the presence/absence of index symbols in the document data by preparing the logically structured document adding the index mark shown with an element key to the character of a logical unit corresponding to a character key. CONSTITUTION: The logically structured table of a target document is prepared by analyzing the defined contents in a document type data file 100, and the logical unit table of characters dividing the characters consisting of the document data into the logical units with partition symbols is prepared by analyzing the document data in any arbitrary format and stored in a table storage part 104. Then, the logically structured table is retrieved, when any element key is extracted, the index symbol corresponding to that element key is outputted and when any character key is extracted, the character of the logical unit corresponding to that character key is extracted from the logical unit table and outputted after the index mark. Thus, the logically structured division adding the index mark shown with the element key to the character of the logical unit corresponding to the character key is generated.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a method of generating a logically structured document, and particularly to a chapter, section,
The present invention relates to a logical structured document generation method for generating a logical structured document that is reorganized into a tree-like hierarchical structure such as terms.

[0002]

2. Description of the Related Art Conventionally, as a method for generating a logically structured document, as shown in Japanese Unexamined Patent Publication No. 4-175966, the heading symbols corresponding to chapters, sections and sections in the text are analyzed. There is a method for automatically generating a tree-like logical structure.

In this method, document data represented by a character code is input, a headline and a body of each headline are extracted from the document data, a headline symbol is extracted from the extracted headline, and then the meaning of the headline symbol is determined. It analyzes and generates a logical structure of a document expressed by a hierarchical structure of parent-child relationships, and can convert a document file expressed by a one-dimensional string of characters into a hierarchical tree structure. .

[0004]

However, in the above-mentioned prior art, since it is premised that the document data has heading symbols representing chapters, sections, and terms, these heading symbols are present. As for the document data that does not exist, there is a problem that a logical structured document cannot be generated.

Further, when there are a plurality of pieces of document data and there is a variation in the entry mark depending on the respective pieces of document data, there is a problem that the document cannot be logically structured by the same process.

It is an object of the present invention to easily generate a logical structured document in which document data is reorganized into a hierarchical structure regardless of the presence or absence of the index mark in the document data, and a method of describing the index mark. It is an object of the present invention to provide a logically structured document generation method capable of efficiently generating a logically structured document by the same process even if there are variations in the same.

[0007]

In order to achieve the above-mentioned object, the present invention is to associate an element key indicating each element such as a chapter constituting a target document with a character with each element. A character key to be shown is defined in advance in a document type data file in association with a target logical structure, the definition contents of this document type data file are analyzed, and a logical structure table showing the logical structure of the target document. And analyzing the document data of the arbitrary format, and creating a logical unit table of characters obtained by dividing the characters forming the document data into logical units by a predetermined delimiter. Based on the contents of the unit table, a logical structured document in which a heading mark indicated by the element key is added to a character of a logical unit corresponding to the character key is generated. And wherein the door.

[0008]

According to the present invention, the definition contents of the document type data file are analyzed, a logical structure table showing the logical structure of the target document is created, and further the document data of an arbitrary format is analyzed to convert the document data. A logical unit table of characters is created by dividing the constituent characters into logical units by a predetermined delimiter.

Then, the logical structure table is searched, and if the element key is extracted, the heading symbol corresponding to the element key is output. If the character key is further extracted, the logical unit corresponding to the character key is extracted. The process of extracting characters from the logical unit table of characters and outputting after the heading symbol is repeated.

As a result, a logical structured document in which the heading mark indicated by the element key is added to the character of the logical unit corresponding to the character key is generated.

[0011]

Embodiments of the present invention will now be described in detail with reference to the drawings.

FIG. 1 is a system block diagram showing an embodiment of the present invention. A document type data file 100, a document data file 101, a logical structure or document data file 107, an input / output control unit 108, an input device 112, The display device 113 and the output device 114 are included.

Of these, the document operation control unit 102 includes a document type data analysis unit 103, a table storage unit 104, a document data analysis unit 105, and a logical structured document data generation unit 106.
And the input / output control unit 108 is a document output control unit 1.
09, document display control unit 110, user interface 1
It is composed of 11.

In this configuration, the document type data analysis unit 103 analyzes the document type data stored in the document type data file 100, and stores the logical structure table of the elements necessary for generating the logical structured document data in the table storage unit. Create in 104.

Further, the document data analysis unit 105 analyzes the document data stored in the document data file 101,
A logical unit table of characters required for generating logical structured document data is created in the table storage unit 104.

Then, the logical structured document data generation unit 10
Reference numeral 6 extracts a logical structure table of elements and a logical unit table of characters in the table storage unit 104 to generate logical structured document data, and a logical structured document data file 10
Output to 7.

The input device 112 gives an instruction to the document operation control unit 102 through the user interface 111 of the input / output control unit 108. Also, the input / output control unit 10
In response to an instruction from the input device 112, the display device 8 outputs a display output to the display device 113 through the document display control unit 110 and a print output to the output device 114 through the document output control unit 109.

Next, the operation of generating a logical structure table of elements in document type data in the document type data analysis unit 103 will be described with reference to the flowchart of FIG.

First, in step 200, a key for representing a document type is designated.

For example, "document type:" or "DOCTYPE" is used as a key indicating the document type. Next, in step 201, a key for representing the element is designated. For example, a key such as "element:" or "ELEMENT" is used as a key representing an element.

Next, at step 202, a key for representing character data is designated.

For example, keys such as "#character data" and "#PCDATA" are used as keys representing the character data.

Next, in step 204, a logical structure of elements is generated until there is no document type data.

The step 204 will be described in detail. First, in step 205, it is determined whether or not the document type key can be extracted, in step 206, the document type name is extracted, and in step 207, the document type name is registered in the table storage unit 104 as the top element. To do.

Further, it is determined in step 208 whether or not the element key can be extracted, the element name is extracted in step 209, and it is registered in the table storage unit 104 as an element in step 210. Then, in step 211, the content model corresponding to the element name is extracted, and in step 212, the subordinate element, the connection relationship, and the number of appearances are registered in the table storage unit 104.

FIG. 3 is a diagram showing an example of the document type data 300 before processing and the logical structure 311 of the element after processing in the document type data analysis unit 103.

Here, "document type:" is the document type key 30.
The document type name 302 is 1, and the “standard” that appears next is 1. The "standard" of this document type name is the highest level element.

"Element:" is the element key 303, and "standard" that appears next is the element name 304. The next "title" is the lower element name 305, and "," is the connection relation 306.

Here, the symbols representing the connection relation 306 include ",", "|", and "&".

"," Is used to specify that all elements must appear in the same order that they appeared in the content model, and "|" must appear in only one element in the content model. Used to specify that it must be
"&" Is used to specify that all elements in the content model must appear, but in no particular order.

Next, the "chapter" is the lower element name 307,
“+” Designates the number of appearances 308.

Here, the number of appearances 308 is "?",
There are "+" and "*".

"?" Is used to specify an optional selection (0 times or 1 time), "+" is used to specify an essential repetition (1 or more times), and "*" is an optional repetition (0 times). Used more than once). Also, when mandatory (one time) is designated, the number of appearances “?”, “+”, And “*” are not used. The content model 309 is enclosed by "(" and ")" from the element name 305 to the appearance count 308.

Further, “#character data” is the character data key 310. This document type key 310 is the content model 30.
When the element name that appears repeatedly in 9 is described, it is designated for each element name. That is, in the example of FIG.
The element name in the content model 309 is "Title" 305,
Although it is a "chapter" 307, the "chapter" 307 appears repeatedly one or more times, and since it is specified that it is composed of "chapter title", "paragraph", and "section", the character data key In the latter part of 310, character data keys representing “chapter title” and “paragraph” are described further hierarchically.

As a result of analyzing the document type data expressed in this way, the logical structure table 3 of the elements as shown in FIG.
11 is created.

In this logical structure table 311,
"Standard" 312 is "Title" 313 and "Chapter" 315
The “title” 313 is composed of zero or more “# character data” 314. Also, "chapter" 315 is 1
It consists of 320 or more "chapter titles" 316, "paragraphs" 318 and "sections", "chapter title" 316 consists of 0 or more "# character data" 317, and "paragraphs" 318 contains 0 or more. It is composed of "# character data" 319, "section" 320 is composed of one or more "paragraphs" 321, and "paragraph" 321 is composed of 0 or more "# character data" 323.

Here, the number of appearances of the rectangle 324 is "?".
(0 or 1), the number of appearances of the rectangle 325 is “*” (0
The number of appearances is "" (one), and the rectangle 327 indicates that the number of appearances is "+" (one or more).

Next, the operation of generating the logical unit table 502 of characters from the document data stored in the document data file 101 in the document data analysis unit 105 will be described with reference to FIG.

First, in step 400, a character for indicating a delimiter is designated. For example, a character such as "line feed character", "tab character", or "space" is designated as a character representing a delimiter.

Next, in step 402, the logical unit table 5 of characters is used until there is no document data in step 401.
02 is generated.

Explaining step 402 in detail, first, in step 403, it is judged whether or not the delimiter character can be extracted, and in step 404, the document data up to the delimiter character is extracted, and in step 405 it is used as a character logical unit table 502. Register in the table storage unit 104.

FIG. 5 is a diagram showing a specific example of the document data 500 before processing and the logical unit table 502 of characters after processing in the document data analysis unit 105.

In this example, "line feed character" 501 is used as a delimiter.

First, "patent" 503 is the character of the first logical unit. "Chapter 1 Title of Invention" 504 is the character of the second logical unit. "Method of generating logical structured document"
Reference numeral 505 is a character of the third logical unit.

"Chapter 2 Claims" 506 is the character of the fourth logical unit. Further, “1. based on document type data ...” 507 is a character of the fifth logical unit.
Furthermore, “2. For existing document data ...” 508
Is the character of the sixth logical unit, and “3. Mark.” 509 is the character of the seventh logical unit.

FIG. 6 shows the logical structured document data generation unit 10
6 is a flowchart showing a procedure for generating the logical structured document of No. 6. The operation of generating a logical structured document will be described below based on this flowchart.

First, in step 600, a marking method is designated. Marking methods include sequential marking, mandatory marking, key-based sequential marking, and key-based mandatory marking. Next, in step 201, start / end marks are designated.

For example, "numerical value." Or "<element name>" is used as the start mark. Also, a mark such as "</ element name>" is used as the end mark.

Next, in step 602, a logical structured document is generated. That is, in step 603, the start mark of the highest element is output.

In step 604, it is determined whether or not the current logical structure element satisfies the condition of the marking method specified in step 605 until the next logical structure element becomes the uppermost element, and in step 606, It is determined how many times the logical structuring element has appeared in the structure. If it is an even number, the end mark of the current logical structuring element is output in step 607.

However, if it is the odd number, the start mark of the current logical structure element is output in step 608, and step 60
In step 9, it is determined whether or not there is a character in a logical unit that does not correspond to the element. In step 610, it is determined whether or not there is # character data in the lower element of the current logical structure element. Output characters. Then, in step 612, the end mark of the top element is output.

FIG. 7 is a diagram showing a specific example of the logical structured document data 700 generated by the sequential marking method.

Here, "<standard>" is the start mark 70.
1, and “</ title>” is the end mark 702. When "sequential mark" is designated as the mark designation method shown in FIG. 6 from the document type data 300 shown in FIG. 3 and the document data 500 shown in FIG. 5, a logical structured document as shown in FIG. Data (sequential mark) 700
Becomes

Hereinafter, such logical structured document data 7 will be described.
00 will be described with reference to the logical structure table 311 of the elements of FIG. 3, the logical unit table 502 of characters of FIG. 5, and the diagram showing the order of appearance of the elements in the logical structure table of FIG. .

Note that 900 in FIG. 8 indicates the appearance order of elements, and 901 indicates output characters.

First, the top element is read from the element logical structure table 311. Then the top element is "standard"
Since it is 312, the start mark “<standard>” of “standard” 312 is output.

Next, the lower element of the "standard" 312 is read from the element logical structure table 311. The lower element is “title” 313.

Since the "title" 313 appears for the first time, the start mark "<title>" is output. Next, the lower element of the “title” 313 is read from the element logical structure table 311.

The lower element is “#character data” 314. Since the lower element is “#character data” 314, the character “patent” 503 of the logical unit that does not correspond to the element is output from the character logical unit table 502.

Next, the lower element of "#character data" 314 is read from the element logical structure table 311. In the example of FIG. 3, there are no subordinate elements.

Next, the peer element of "#character data" 314 is read from the element logical structure table 311. There is no peer element.

Next, the upper element of "#character data" 314 is read from the element logical structure table 311. The upper element is “title” 313.

Since the "title" 313 appears for the second time, the end mark "</ title>" is output.

Next, the sibling element of the "title" 313 is read from the element logical structure table 311.

The peer element is “chapter” 315. "Chapter" 3
Since 15 is the first appearance, the start mark "<chapter>" is output. Next, the lower element of the “chapter” 315 is read from the element logical structure table 311.

The lower element is the "chapter title" 316.
Since the "chapter title" 316 is the first appearance, the start mark "<chapter title>" is output. Next, the lower element of the "chapter title" 316 is read from the logical structure (table) 311 of the element.

The lower element is “#character data” 317. Since the lower element is “#character data” 317, the character “Chapter 1 Invention name” 504 of the logical unit that does not correspond to the element is read from the character logical unit table 502 and output.

Next, the lower element of "#character data" 317 is read from the element logical structure table 311. There are no subelements.

Next, the peer element of "#character data" 317 is read from the element logical structure table 311. There is no peer element.

Next, the upper element of "#character data" 317 is read from the element logical structure table 311. The upper element is “chapter title” 316.

Since the "chapter title" 316 appears for the second time, the end mark "</ chapter title>" is output.

Next, the sibling elements of the "chapter title" 316 are read from the element logical structure table 311.

The peer element is “paragraph” 318. Since the “paragraph” 318 is the first appearance, the start mark “<
Paragraph> ”is output. Next, the element logical structure table 3
The lower element of “paragraph” 318 is read from 11.

The lower element is “#character data” 319. Since the lower element is “#character data” 319, the character “logical structured document generation method (apparatus)” 5 of the logical unit that does not correspond to the element from the logical unit table 502 of the character 5
05 is read and output.

Next, the lower element of "#character data" 319 is read from the element logical structure table 311. There are no subelements.

Next, the peer element of "#character data" 319 is read from the element logical structure table 311. There is no peer element. Next, the logical structure (table) 3 of the element
The upper element of “#character data” 319 is read from 11. The upper element is “paragraph” 318.

Since the "paragraph" 318 is the second appearance, the end mark "</ paragraph>" is output. Next, the peer element of the "paragraph" 318 is read from the element logical structure table 311. The peer element is a “section” 320.

Since the "section" 320 is the first appearance,
The start mark "<section>" is output.

Next, the lower element of the "section" 320 is read from the element logical structure table 311. The lower element is “paragraph” 321.

Since the "paragraph" 321 is the first appearance, the start mark "<paragraph>" is output. Next, the lower element of the "paragraph" 321 is read from the element logical structure table 311.

The lower element is “#character data” 323. Since the lower element is “#character data” 323, the character “Chapter 2 Claims” 506 of the logical unit that does not correspond to the element is read and output from the logical unit table 502 of the character.

Next, the lower element of "#character data" 323 is read from the element logical structure table 311. There are no subelements. Next, the element logical structure table 311
Then, the same element of “#character data” 323 is read. There is no peer element.

Next, the upper element of “#character data” 323 is read from the element logical structure table 311. The upper element is “paragraph” 321.

Since the "paragraph" 321 appears for the second time, the end mark "</ paragraph>" is output.

Next, the peer element of the "paragraph" 321 is read from the element logical structure table 311.

Since the “paragraph” 321 has one or more occurrences, the peer element is the “paragraph” 321. "Paragraph" 3
Since 21 is the third appearance, the start mark “<paragraph>” is output.

Next, the lower element of the "paragraph" 321 is read from the element logical structure table 311. The lower element is "#
Character data ”323. Since the lower element is “#character data” 323, the character logical unit table 502
The character "1. Based on document type data ..." 507 in a logical unit that does not correspond to an element is read and output.

Next, the lower element of "#character data" 323 is read from the element logical structure table 311. There are no subelements. Next, the element logical structure table 311
Then, the same element of “#character data” 323 is read. There is no peer element.

Next, the upper element of “#character data” 323 is read from the element logical structure table 311. The upper element is “paragraph” 321. Since the “paragraph” 321 is the fourth appearance, the end mark “</ paragraph>” is output.

Next, the peer element of the "paragraph" 321 is read from the element logical structure table 311. "Paragraph" 321
Since the appearance frequency is 1 or more, the peer element is “paragraph” 321. Since the “paragraph” 321 is the fifth appearance, the start mark “<paragraph>” is output.

Next, the lower element of the "paragraph" 321 is read from the element logical structure table 311. The lower element is "#
Character data ”323. Since the lower element is “#character data” 323, the character logical unit table 502
The character "2. For existing document data ..." 508 in a logical unit that does not correspond to an element is read and output.

Next, the lower element of "#character data" 323 is read from the element logical structure table 311. There are no subelements.

Next, the peer element of "#character data" 323 is read from the element logical structure table 311. There is no peer element.

Next, the upper element of "#character data" 323 is read from the element logical structure table 311. The upper element is “paragraph” 321. Since the “paragraph” 321 is the sixth appearance, the end mark “</ paragraph>” is output. “Paragraph” 321 from the logical structure table 311 of the element
Read the peer elements of.

Since the “paragraph” 321 has one or more occurrences, the peer element is the “paragraph” 321. Since the “paragraph” 321 is the seventh appearance, the start mark “<
Paragraph> ”is output.

Next, the lower element of the "paragraph" 321 is read from the element logical structure table 311. The lower element is "#
Character data ”323. Since the lower element is “#character data” 323, the character logical unit table 502
The logical unit character "3. Mark." 509 that does not correspond to the element is read and output.

Next, the lower element of “#character data” 323 is read from the element logical structure table 311. There are no subelements. Next, the element logical structure table 311
Then, the same element of “#character data” 323 is read. There is no peer element.

Next, the upper element of “#character data” 323 is read from the element logical structure table 311. The upper element is “paragraph” 321. Since the “paragraph” 321 is the eighth appearance, the end mark “</ paragraph>” is output.

Next, the peer element of the "paragraph" 321 is read from the element logical structure table 311. "Paragraph" 321
Since the appearance frequency is 1 or more, the peer element is “paragraph” 321. However, since the characters of the logical unit of the logical unit table 502 of characters correspond to all the elements, the “paragraph” 321 does not satisfy the condition. In FIG. 8, the “paragraph” 321 at this time is indicated by reference numeral 902.

Next, the peer elements of the "paragraph" 321 other than the "paragraph" 321 are read from the element logical structure table 311. There is no peer element. Next, the upper element of the “paragraph” 321 is read from the element logical structure table 311. The upper element is “section” 320.

Since the "section" 320 is the second appearance,
Outputs the end mark "</ section>".

Next, the peer element of the "section" 320 is read from the element logical structure table 311. The number of occurrences of "section" 320 is 0 or more, so the peer element is "section".
320.

However, since all the characters of the logical unit of the logical unit table 502 of characters correspond to the elements, "section" 3
20 does not satisfy the condition.

Next, the peer elements of the "section" 320 other than the "section" 320 are read from the element logical structure table 311. There is no peer element.

Next, the upper element of the "section" 320 is read from the element logical structure table 311. The upper element is "chapter"
315. Since the "chapter" 315 is the second appearance, the end mark "</ chapter>" is output.

Next, the peer element of the "chapter" 315 is read from the element logical structure table 311.

Since the number of appearances of the “chapter” 315 is one or more, the peer element is the “chapter” 315. But,
Since all the characters in the logical unit of the logical unit table 502 of characters correspond to the elements, the “chapter” 315 does not satisfy the condition.

Next, the peer elements of the "chapter" 315 other than the "chapter" 315 are read from the element logical structure table 311. There is no peer element.

Next, the upper element of the "chapter" 315 is read from the element logical structure table 311. The upper element is “standard” 312. Since the “standard” 312 is the highest-level element, the end mark “</ standard>” is output and the process ends.

FIG. 9 is a diagram showing a specific example of the logical structured document data 800 generated by the essential marking method.

The logical structure of FIG. 9 will now be described based on the document type data 300 shown in FIG. 3, the document data 500 shown in FIG. 5, and the diagram showing the order of appearance of elements in the logical structure table 311 shown in FIG. A process of generating the converted document data 800 will be described.

In FIG. 10, 1000 indicates the appearance order of elements, and 1001 indicates output characters in order.

First, the highest-level element is read from the element logical structure table 311. The top element is “standard” 312. The start mark “<standard>” of “standard” 312 is output.

Next, the lower element of "standard" 312 is read from the element logical structure table 311. The lower element is “title” 313. The “title” 313 has one appearance count, satisfies the indispensable condition, and since it is the first appearance, the start mark “<title>” is output.

Next, the lower element of the "title" 313 is read from the element logical structure table 311. The lower element is “#character data” 314.

Since the lower element is "#character data" 314, the logical unit character "patent" 503 which does not correspond to the element is output from the character logical unit table 502.

Next, the lower element of "#character data" 314 is read from the element logical structure table 311. There are no subelements.

Next, the peer element of "#character data" 314 is read from the element logical structure table 311. There is no peer element. Next, the element logical structure table 311
The upper element of “#character data” 314 is read. The upper element is “title” 313.

Since the "title" 313 has one appearance count and satisfies the essential condition, and is the second appearance, the end mark "</ title>" is output.

Next, the sibling element of the "title" 313 is read from the element logical structure table 311. The peer element is “chapter” 315.

The "chapter" 315 has the number of appearances of 1 or more, satisfies the essential condition, and is the first appearance. Therefore, the start mark "<chapter>" is output. Next, the lower element of the “chapter” 315 is read from the element logical structure table 311. The lower element is “chapter title” 316.

The "chapter title" 316 has one appearance, satisfies the essential condition, and is the first appearance. Therefore, the start mark "<chapter title>" is output. Next, from the element logical structure table 311, "chapter title"
Read the lower element of 316. The lower element is “#character data” 317.

Since the lower element is "#character data" 317, the character "Chapter 1 Invention name" 504 of the logical unit which does not correspond to the element is read from the character logical unit table 502 and output.

Next, the lower element of "#character data" 317 is read from the element logical structure table 311. There are no subelements. Next, the element logical structure table 311
The same element of “#character data” 317 is read. There is no peer element.

Next, the upper element of "#character data" 317 is read from the element logical structure table 311. The upper element is “chapter title” 316.

Since the "chapter title" 316 has one appearance count and satisfies the indispensable condition and is the second appearance, the end mark "</ chapter title>" is output.

Next, the peer element of the "chapter title" 316 is read from the element logical structure table 311. The peer element is “paragraph” 318.

The “paragraph” 318 has one occurrence,
Since it meets the essential conditions and is the first appearance,
The start mark "<paragraph>" is output. Next, the lower element of the “paragraph” 318 is read from the element logical structure table 311. The lower element is “#character data” 319.

Since the lower element is "#character data" 319, the character "logical structured document generation method (apparatus)" 505 of the logical unit that does not correspond to the element is read from the character logical unit table 502 and output. .

Next, the lower element of "#character data" 319 is read from the element logical structure table 311. There are no subelements. Next, the element logical structure table 311
Then, the same element of “#character data” 319 is read. There is no peer element.

Next, the upper element of "#character data" 319 is read from the element logical structure table 311. The upper element is “paragraph” 318.

The "paragraph" 318 has one occurrence,
Since it meets the essential conditions and is the second appearance,
Output the end mark "</ paragraph>". Next, the peer element of the "paragraph" 318 is read from the element logical structure table 311. The peer element is a “section” 320.

The “section” 320 has the number of occurrences of 0 or more, and does not satisfy the essential condition. Next, the peer elements of the “section” 320 other than the “section” 320 are read from the element logical structure table 311. There is no peer element.

Next, the upper element of the "section" 320 is read from the element logical structure table 311. The upper element is "chapter"
315.

Since the "chapter" 315 has the number of appearances of 1 or more and satisfies the indispensable condition and is the second appearance, the end mark "</ chapter>" is output. Next, the peer element of the "chapter" 315 is read from the element logical structure table 311. Since the “chapter” 315 has one or more occurrences, the peer element is the “chapter” 315.

The "chapter" 315 has the number of appearances of 1 or more, satisfies the essential condition, and is the third appearance. Therefore, the start mark "<chapter>" is output. Next, the lower element of the “chapter” 315 is read from the element logical structure table 311. The lower element is “chapter title” 316.

Since the "chapter title" 316 has one appearance count and satisfies the indispensable condition and is the third appearance, the start mark "<chapter title>" is output. Next, from the element logical structure table 311, "chapter title"
Read the lower element of 316. The lower element is “#character data” 317.

Since the lower element is “#character data” 317, the character of the logical unit which does not correspond to the element from the character logical unit table 502 is “Chapter 2 Claims” 50.
6 is read and output.

Next, the lower element of "#character data" 317 is read from the element logical structure table 311. There are no subelements.

Next, the peer element of "#character data" 317 is read from the element logical structure table 311. There is no peer element. Next, the element logical structure table 311
The upper element of “#character data” 317 is read. The upper element is “chapter title” 316.

Since the "chapter title" 316 has one appearance count and satisfies the indispensable condition and is the fourth appearance, the end mark "</ chapter title>" is output. Next, from the element logical structure table 311, "chapter title"
Read 316 peer elements. Same element is “paragraph” 31
8

The "paragraph" 318 has one occurrence,
Since it meets the essential conditions and is the third appearance,
The start mark "<paragraph>" is output. Next, the lower element of the “paragraph” 318 is read from the element logical structure table 311. The lower element is “#character data” 319.

Since the lower element is “#character data” 319, the character “1. Based on document type data ...” 507 of the logical unit which does not correspond to the element is read from the character logical unit table 502. To output.

Next, the lower element of "#character data" 319 is read from the element logical structure table 311. There are no subelements.

Next, the peer element of "#character data" 319 is read from the element logical structure table 311. There is no peer element. Next, the element logical structure table 311
The upper element of “#character data” 319 is read. The upper element is “paragraph” 318.

The “paragraph” 318 has one occurrence,
Since it meets the essential conditions and is the fourth appearance,
Output the end mark "</ paragraph>". Next, the peer element of the "paragraph" 318 is read from the element logical structure table 311. The peer element is a “section” 320.

The “section” 320 has 0 or more occurrences, and does not satisfy the essential condition. Next, the peer elements of the “section” 320 other than the “section” 320 are read from the element logical structure table 311. There is no peer element.

Next, the upper element of the "section" 320 is read from the element logical structure table 311. The upper element is "chapter"
315.

The "chapter" 315 has the number of appearances of 1 or more, satisfies the indispensable condition, and since it is the fourth appearance, the end mark "</ chapter>" is output. Next, the peer element of the "chapter" 315 is read from the element logical structure table 311.

Since the “chapter” 315 has one or more occurrences, the peer element is the “chapter” 315. The “chapter” 315 has the number of appearances of 1 or more, satisfies the essential condition, and is the fifth appearance, so the start mark “<chapter>” is output.

Next, the lower elements of the "chapter" 315 are read from the element logical structure table 311. The lower element is “chapter title” 316.

The "chapter title" 316 has one appearance count, satisfies the essential condition, and is the fifth appearance. Therefore, the start mark "<chapter title>" is output. Next, from the element logical structure table 311, "chapter title"
Read the lower element of 316. The lower element is “#character data” 317.

Since the lower element is “#character data” 317, the character “2. For existing document data ...” 508 of the logical unit which does not correspond to the element is read from the character logical unit table 502. Output.

Next, the lower element of "#character data" 317 is read from the element logical structure table 311. There are no subelements. Next, the element logical structure table 311
The same element of “#character data” 317 is read. There is no peer element.

Next, the upper element of "#character data" 317 is read from the element logical structure table 311. The upper element is “chapter title” 316.

Since the "chapter title" 316 has one appearance count, satisfies the essential condition, and is the sixth appearance, the end mark "</ chapter title>" is output. Next, from the element logical structure table 311, "chapter title"
Read 316 peer elements. Same element is “paragraph” 31
8

The “paragraph” 318 has one occurrence,
Since it meets the essential conditions and is the fifth appearance,
The start mark "<paragraph>" is output. Next, the lower element of the “paragraph” 318 is read from the element logical structure table 311. The lower element is “#character data” 319.

Since the lower element is "#character data" 319, the character "3. Mark is added" of the logical unit which does not correspond to the element from the character logical unit table 502.
509 is read and output.

Next, the lower element of "#character data" 319 is read from the element logical structure table 311. There are no subelements. Next, the element logical structure table 311
Then, the same element of “#character data” 319 is read. There is no peer element.

Next, the upper element of "#character data" 319 is read from the element logical structure table 311. The upper element is “paragraph” 318.

The "paragraph" 318 has one occurrence,
Since it meets the essential conditions and is the sixth appearance,
Output the end mark "</ paragraph>". Next, the peer element of the "paragraph" 318 is read from the element logical structure table 311. The peer element is a “section” 320.

The “section” 320 has the number of occurrences of 0 or more, and does not satisfy the essential condition. Next, the peer elements of the “section” 320 other than the “section” 320 are read from the element logical structure table 311. There is no peer element.

Next, the upper element of the "section" 320 is read from the element logical structure table 311. The upper element is "chapter"
315.

The "chapter" 315 has the number of appearances of 1 or more, satisfies the indispensable condition, and is the sixth appearance. Therefore, the end mark "</ chapter>" is output. Next, the peer element of the "chapter" 315 is read from the element logical structure table 311. The peer element is “paragraph” 318.

The "paragraph" 318 has one appearance count,
Since it meets the essential conditions and is the fifth appearance,
The start mark "<paragraph>" is output. Next, the lower element of the “paragraph” 318 is read from the element logical structure table 311. The lower element is “#character data” 319.

Since the lower element is "#character data" 319, the logical unit character "3. Mark is added" of the logical unit which does not correspond to the element from the character logical unit table 502.
509 is read and output.

Next, the lower element of "#character data" 319 is read from the element logical structure table 311. There are no subelements. Next, the element logical structure table 311
Then, the same element of “#character data” 319 is read. There is no peer element.

Next, the upper element of “#character data” 319 is read from the element logical structure table 311. The upper element is “paragraph” 318.

The "paragraph" 318 has one appearance count,
Since it meets the essential conditions and is the sixth appearance,
Output the end mark "</ paragraph>". Next, the peer element of the "paragraph" 318 is read from the element logical structure table 311. The peer element is a “section” 320.

The "section" 320 has the number of appearances of 0 or more, and does not satisfy the essential condition. Next, the peer elements of the “section” 320 other than the “section” 320 are read from the element logical structure table 311. There is no peer element.

Next, the upper element of the "section" 320 is read from the element logical structure table 311. The upper element is "chapter"
315.

The "chapter" 315 has the number of appearances of 1 or more, satisfies the indispensable condition, and since it is the sixth appearance, the end mark "</ chapter>" is output. Next, the sibling elements of the "chapter" 315 are read from the element logical structure table 311. Since the “chapter” 315 has one or more occurrences, the peer element is the “chapter” 315.

However, since all the characters of the logical unit of the logical unit table 502 of characters correspond to the elements, "chapter" 3
No. 15 does not satisfy the condition. Next, the peer elements of “chapter” 315 other than “chapter” 315 are read from the element logical structure table 311. There is no peer element.

Next, the upper element of the "chapter" 315 is read from the element logical structure table 311. The upper element is “standard” 312.

Since "standard" 312 is the highest level element,
The end mark “</ standard>” is output and the process ends.

As described above, in the present embodiment, in the method of generating a logical structured document for obtaining a tree-like hierarchical structure of chapters, sections, terms, etc. of document data, document type data indicating document constituent elements and Document data of an arbitrary format is analyzed, and tables 311 and 502 required to generate a logical structured document are generated from the analysis results.

This document type data analysis and table 31
The generation of 1 is performed by the document type data analysis unit 103. The document type data analysis unit 103 first designates a key for indicating a document type, a key for indicating an element, and a key for indicating character data.

Next, it is judged whether or not the character key can be extracted, and if so, the name is extracted. Then, it is registered in the table 311 as the highest element. Furthermore, it is determined whether the element key has been extracted, and if it has been extracted, its name is extracted. Then, it is registered in the table 311 as an element, and the content model for the name of the element is extracted.

Finally, the lower element, the connection relation and the number of appearances are also registered in the table 311 from the contents. The above processing is repeated until there is no document type data, and the document type data is analyzed and the table 311 is generated.

On the other hand, the document data analysis unit 105 analyzes the document data and creates the table 502. The document data analysis unit first specifies a character for indicating a delimiter. Next, it is determined whether the delimiter has been extracted, and if so, the document data up to the delimiter is extracted. Then, it is registered in a table 502 different from the document type data table 311. The above processing is repeated until there is no document data, and the document data is analyzed and the table 502 is generated.

In this way, after the tables of the document type data and the document data are created, the document data is marked based on the contents of those tables. This marking is performed by the logical structured document data generation unit 106.

The logical structured document data generation unit 106 first specifies the marking method and the form of the start / end mark. Next, the start mark of the top element is output. Then, it is determined whether the current logical structuring element satisfies the condition of the specified marking method until the next logical structuring element becomes the highest level. It is determined how many times it appears on the structure, and if it is an even number, the end mark of the current logical structure element is output.

On the other hand, if it is an odd number, the start mark of the current logical structure element is output. Further, it is determined whether or not there is a character of a logical unit that does not correspond to the element, and if there is, it is determined whether or not there is # character data in the lower element of the current logical structured element. # If there is character data, output the characters divided into logical units.

Finally, the end mark of the top element is output. It should be noted that this mark is added regardless of whether or not there is a caption mark in the document data.

Therefore, it is possible to easily generate a logically structured document in which the document data is reorganized into a hierarchical structure regardless of the presence or absence of the index mark in the document data, and further, regardless of the way of describing the index mark. Instead, a logically structured document obtained by reorganizing document data into a hierarchical structure can be easily generated by the same process.

Although the sequential marking method and the essential marking method have been described in the present embodiment, it is needless to say that the logical structured document can be easily generated by the key corresponding sequential marking method and the key corresponding essential marking method. Yes.

[0187] In the key-corresponding sequential mark-up method, a heading symbol corresponding to an element is first designated, and the element and the character are associated with each other using the designation. After that, the remaining elements and characters that have not been dealt with are dealt with sequentially according to the marking method. It means to generate a logical structured document by the above method.

Further, the key-corresponding essential marking method is
First, the heading symbol corresponding to the element is specified, and with that as a key, the element is associated with the character. After that, the remaining elements and characters that have not been dealt with are dealt with according to the mandatory marking method. It means to generate a logical structured document by the above method.

The key-corresponding markup method improves the legitimacy with respect to the logical structuring of a document in which a heading symbol corresponding to an element is unique.

[0190]

As described above, according to the method for generating a logical structured document of the present invention, an element key indicating each element such as a chapter constituting a target document and a character for each element are assigned. Analyze the definition contents of the document type data file defined by associating the character key indicating the correspondence with the target logical structure, create a logical structure table indicating the logical structure of the target document, and The document data of the format is analyzed, a logical unit table of characters obtained by dividing the characters constituting the document data into logical units by a predetermined delimiter is created, and based on the contents of the logical structure table and the logical unit table of characters, Since the logical structured document in which the heading mark shown by the element key is added to the character of the logical unit corresponding to the character key is generated, It is possible to easily generate a logically structured document in which document data is reorganized into a hierarchical structure regardless of the presence or absence of a start symbol, and the document data is reorganized into a hierarchical structure regardless of how the heading symbols are written. The organized logical structured document can be easily generated by the same process.

Therefore, it is extremely effective in constructing a document database having a unified logical structure.

[Brief description of drawings]

FIG. 1 is a system block diagram showing an embodiment of the present invention.

FIG. 2 is a flowchart showing an operation of generating a logical structure table of elements of a document type data analysis unit.

FIG. 3 is an explanatory diagram showing a specific example of the logical structure of document type data before processing and elements after processing in the document type data analysis unit.

FIG. 4 is a flowchart showing an operation of generating a logical unit table of characters by the document data analysis unit.

FIG. 5 is an explanatory diagram showing a specific example of a logical unit of document data before processing and a character after processing in the document data analysis unit.

FIG. 6 is a flowchart showing an operation of generating a logical structured document by a logical structured document data generation unit.

FIG. 7 is an explanatory diagram showing a specific example of logical structured document data by a sequential marking method.

FIG. 8 is an explanatory diagram showing the order of appearance of elements in the sequential marking method.

FIG. 9 is an explanatory diagram showing a specific example of logical structured document data according to a mandatory marking method.

FIG. 10 is an explanatory diagram showing the order of appearance of elements in the essential marking method.

[Explanation of symbols]

Reference numeral 100 ... Document type data file, 101 ... Document data file, 103 ... Document type data analysis unit, 105 ... Document data analysis unit, 106 ... Logical structured document data generation unit, 1
07 ... Logical structured document data file, 300 ... Document type data, 311 ... Element logical structure table, 500 ... Document data, 502 ... Character logical unit table.

Claims (2)

[Claims] 1. A logical structured document generation method for generating a logical structured document by reorganizing a tree-like hierarchical structure of chapters, sections, terms, etc. from document data of an arbitrary format, and constructing a target document. An element key indicating each element such as a chapter and a character key indicating that a character is associated with each element are defined in advance in a document-type data file in association with a target logical structure. After analyzing the definition contents of the type data file and creating a logical structure table that shows the logical structure of the target document, analyze the document data in any of the above formats, and use the specified delimiters to identify the characters that make up the document data. A logical unit table of characters divided into logical units is created, and based on the contents of the logical structure table and the logical unit table of characters, the logical unit statement corresponding to the character key is created. Method of generating a logical structure of documents and generates a logical structured document added with the heading mark indicated by the element key for. 2. The method for generating a logical structured document according to claim 1, wherein the heading mark is added according to a method selected and designated from among a plurality of marking methods.