JP2002297574A - System and program for kana putting along side chinese characters - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide an efficient achieving means to automatically put Kana alongside Chinese characters by inputting given document data or document data put Kana by other type set according to pages as a result of type set and conditions of Kana putting to a character string specified by a user. SOLUTION: In a system for Kana putting, a logical section storage means 1 to set and store more than one logical section dividing the document data logically, an extracting means 4 for potential character string of Kana putting to extract potential character strings of Kana putting from the data, a Kana putting judgement means 2 to judge a potential character string appeared firstly as Kana putting subject strings for the strings composed of the same character strings by stored logical section and a Kana putting means 3 to put Kana on the judged subject strings in the data are equipped.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a format control code processing system, and more particularly, to a system for performing a clear copy output process in document processing. The present invention relates to a ruby assigning system that enables automatic ruby assigning in conformity with the typesetting rules, and enables appropriate automatic ruby reassignment in conversion between different basic format documents.

[0002]

2. Description of the Related Art In general, document data, which is output data of a data processing apparatus, includes a character code indicating a character to be actually output, and a so-called "line feed, page break, character size instruction" or the like which indicates the form of the document. It consists of a format control code.

Further, based on the basic format of a document such as the number of lines per page and the number of characters per line (line length), a character code is edited in accordance with a format control code into a form that is actually output, and a printer or the like is used. Data that is converted into data for a display device is called typesetting.

[0004] Format control codes are diversified, and "ruby control codes" for giving "reading" to character strings that are difficult to read are also part of them.

Particularly, it is increasing that difficult classics such as Kojiki are published for elementary and junior high school students, such as "manga ...". In this case, for the difficult reading, ruby (reading) is repeatedly given even if the same character string is used throughout the entire document. As described above, among the ruby typesettings, the ruby typesetting in which ruby is frequently used is generally referred to as “total ruby” typesetting.

FIG. 3 shows an example of ruby-added document data and a ruby control code. In the figure, “●” indicates a character string before and after. (A) is an example in which the reading of the kanji character string "Tachibana-jo" is added to the kanji character string "Tachibana-no-jo". In this case, all the appearing kanji character strings "Tachibana-jo" are added with ruby.

FIG. 2B shows a ruby control code which is input into document data to add ruby. Enter the ruby character string (furigana) "Tachibana no Irazume" with the "ruby control code"("＠ruby;" and "＠") sandwiched between the character strings "Tachibana woman" to add ruby (in this case, kanji) are doing.

In this example, ruby is added to all kanji character strings. However, in actuality, if the character string appears many times on one page, it is added only to the character string appearing at the beginning, so that the overall readability is improved. Is selected in consideration of the character string to be assigned.

[0009]

In order to add ruby to such document data, a ruby control code is added at the time of inputting the document data, an additional character is input during the editing process, In the case of total ruby, it is necessary to manually select whether or not to assign to a column, and in the case of total ruby, the work load is high and a lot of labor is required, and there are problems such as improvement of work quality and work efficiency.

In addition, basic format information such as line length (number of characters per line) and number of lines (number of lines per page) has been changed, for example, in the case of serializing books serialized in newspapers and magazines, and converting books into paperback books. Basically reformat the old basic format to the new basic format. If total ruby is added to such a document, it is necessary to add a new total ruby appropriate for the new typesetting result, and achieving this efficiently is also an issue.

For solving such a problem, see Japanese Patent Application Laid-Open
Japanese Patent Application Publication No. 282050 / “Document Editing Method and Apparatus” discloses a technique for selecting a character string to be assigned to total ruby.

That is, “the appropriate position of the character string to be added with ruby is automatically determined from the same character string existing in the document, and the ruby is displayed at a position that is easy to see without any trouble for the user”. When the ruby setting is specified for an arbitrary character string in the document data, the appearance frequency of the character string in the document is detected, and the ruby display for each of the same character strings in the document is performed based on the appearance frequency information. Hidden is determined. In order to determine the character string that displays ruby according to the frequency of occurrence of the character string in the document, the display interval is determined to be large for character strings with high frequency of appearance, and the display interval is narrow for character strings with low frequency of appearance. It is described that ruby will be displayed in a character string at an appropriate position in a document.

Indeed, if ruby is added to all character strings that appear, as in the case of ruby-added document data shown in FIG. Since it is annoying if rubies are frequently attached, it is desirable that rubies be given at an appropriate frequency, and this has been proposed as a solution to this problem.

As an example of the above-mentioned prior example, when "the appearance frequency of a character string is three times / page or more, ruby is displayed once on three pages", ruby is applied to one character string. In this case, it is described that ruby is not added to the same character string appearing over the next two pages. Also, an example is shown in which, when the appearance frequency of the user-specified information is equal to or less than a certain value, ruby is added to all character strings that appear.

However, when the document data is typeset on an actual page, a ruby is simply added to each page since photographs and charts take up space and characters of the document data are allocated to other empty spaces. In some cases, a character string cannot be determined only by frequency, and the preceding case does not solve this.

Therefore, in the present invention, based on a page obtained as a result of typesetting and a ruby setting condition for a character string specified by a user, a document to which ruby has been added with given document data or another typesetting. An object of the present invention is to provide an efficient means for automatically adding ruby by inputting data.

[0017]

FIG. 1 is a block diagram of the present invention. The present invention provides a logical division storage unit 1 for setting and storing one or more logical divisions for logically dividing document data;
A ruby-attached candidate character string extracting means 4 for extracting a candidate character string to which ruby is to be added from document data, and a ruby-added candidate character string consisting of the same character string for each of the stored logical divisions. There is provided a ruby addition determining means 2 for determining as a character string to be added, and a ruby adding means 3 for adding ruby to the determined character string for ruby addition in the document data.

Further, when organizing a document in which the number of characters accommodated in each page fluctuates and assigning document data to each page for typesetting, the ruby addition determining means 2 uses logical divisions based on the pages determined by typesetting. The ruby is determined to be given.

Further, the logical partition storage means 1 stores a plurality of types of logical partitions and the priority for each type of logical partition, and the ruby assignment determining means 2 stores the plurality of logical partitions stored in the logical partition storage means 1. The determination of ruby addition is made based on the priority of each logical section.

The input document data is ruby-added document data to which ruby has been added based on the first typesetting. When adding ruby based on a page determined by the second typesetting, the ruby addition determining means 2 Is such that, for the same character string for each of the stored logical divisions, ruby is determined not to be added to a character string other than the character string that appears first, and the ruby adding means 3 determines that the ruby is not added to the document data. No ruby is added to the given character string.

As described above, in the logical partition storage means 1, a page unit or a two-page spread unit is used, or
Various types of logical divisions can be stored, such as a chapter or section as a unit, or in the case of an online document, a line number. One or more of these division units can be stored. At the same time, and if the same character string appears one or more times in each of the enabled sections, ruby is applied only to the first character string.

When a plurality of types of logical divisions are valid, it is possible to control whether both logical divisions are valid or whether the judgment of the higher priority is valid, depending on the difference in priority. .

The actual assignment to a page is determined only when the typesetting is performed, based on the character size of the page, the figure, the amount of the table, and the like. Since the logical division of each page is determined based on the assigned page, In addition, ruby is added according to the progress of typesetting.

Further, in the case of re-formatting, when the logical division is made based on the allocation to the page determined as a result of the already performed type-setting, when the page composition is changed again with a new type, the input data is used. Ruby already touched naturally uses the relationship between the character string given as ruby input and the ruby to be given,
If the character string is not the position of the ruby addition position determined in the logical section, no ruby is added to the character string. That is, if the character string is already attached, the ruby is deleted.

[0025]

FIG. 2 shows a configuration diagram of an embodiment of the present invention. In the present embodiment, a mode realized by a computer program executed on a computer used for general purposes such as a personal computer and a workstation will be described.

The ruby providing system according to the present invention comprises a processing device,
It is realized by executing a computer program on a computer including a main storage device, an auxiliary storage device, an input / output device, and the like. The computer program is provided by being stored in a portable medium such as a floppy (registered trademark) disk or a CD-ROM, or in a main storage device or an auxiliary storage device of another computer connected to a network. The recording medium of the present invention corresponds to the portable medium, the main storage device, and the auxiliary storage device.

The provided computer program is loaded directly from the portable medium to the main storage device of the computer, or once copied or installed from the portable medium to the auxiliary storage device, and then loaded and executed in the main storage device. Also, when provided by being stored in another device connected to a network, it is also copied to an auxiliary storage device, loaded into a main storage device, and executed after receiving from another device via a network.

According to the embodiment of the present invention, a document string is input by adding a ruby control code and a ruby character to a character string that appears for the first time when the document data is input, or a document created by adding ruby. 1 shows an automatic total ruby typesetting device that typesets a total ruby document based on set ruby conversion rules and typesetting conditions by using as input the document data extracted leaving only control codes related to ruby.

First, The configuration of the device will be described based on FIG. Reference numeral 201 denotes a document data and ruby input mechanism. This is a device in which a user inputs document data as a character string read from a manuscript. At this stage, when a character string that requires ruby appears for the first time, the ruby is input together with the ruby control code. I keep it. As will be understood from the following description of the configuration and operation of the present apparatus, ruby can be additionally input as necessary without specifying it when it first appears.

The document data section 205 is a buffer for storing input document data. Here, from the old document input mechanism denoted by reference numeral 202, document data that has been formatted and configured as a document in a certain format has already been converted into the old document data section 203.
Then, the document data extracted by leaving only the ruby control code except for the control code added variously at the time of typesetting by the inverse conversion mechanism 206 is also converted to 205 in the same format as the document data input from 201. It can be stored and used as input data.

A typesetting processing mechanism 208 is a basic mechanism of the present apparatus, and sequentially inputs document data from 205, and sets a basic format of a basic format table 207 set by inputting from a basic format designating mechanism 204 for typesetting. This is a mechanism for performing typesetting processing based on. For the typesetting, the input document data is formatted as a document, various control codes are added, and the output is sequentially output to the typesetting result output data unit 210.

A mechanism for adding the ruby control code to the formatted output result data to which the control code corresponding to the format is added and the pages are allocated will be described below.

Incidentally, as an example of the format control code,
As a condition for forming a page, a character string indicating the same content according to the number of lines per page, the number of characters per line, a font type indicating what kind of character size is to be used, a layout condition of photographs and drawings, and the like. The layout at the time of printing or display output is different, and the control codes of the layout include a line feed control code, a control code of the first character position, a font control code, and the like.

As described above, the conditions for determining the structure of the page are given, and the character string of the document data corresponding to each page is determined according to the conditions. In the present apparatus, a description will be mainly given of a case where a character string to be given ruby can be determined only after the assignment of the character string to this page is determined. In other cases, this device handles ruby character strings regardless of the page configuration. When document data is divided into chapters, sections, paragraphs, etc., these are used as units. This is the case when ruby is applied only to a character string that first appears there.

If the number of pages is used as a unit for ruby preserving the page, for example, if the same character string appears several times in one page unit, the character string that appears first in the page Only ruby. Also, in units of two pages,
The same applies to a unit of three pages. Two-page spread is used as ruby pretending to be aware of how to bind pages of a printed document.
It is practical to use a page as a unit. That is, the spread is a range that can be seen at a glance, and unlike the case where ruby appears only once every two pages, the effect that the ruby is touched when first appearing on the two pages that appear open has a large effect of making it easier to read. The right page and left page are different depending on the case where the page is touched from the right in vertical writing and the case where the page is touched from the left in horizontal writing, but the two pages of the two-page spread are viewed in order from the page with the smallest page number. It's the first time.

Also, ruby pretending, which depends on the page configuration but is not controlled on a page basis, is also included in the processing of the present apparatus. This is a case where a ruby-added character string determination method using the number of lines as a unit is adopted. In particular, in the case of electronic document data, the document data is often displayed by scrolling on the screen without dividing the page into pages. In such a case, a character string to be added with ruby is determined in units of the number of lines. A similar effect can be obtained by using the number of characters as a unit.

The ruby conversion rule instructing mechanism 209 is a mechanism for instructing a rule relating to ruby addition. The ruby conversion rule input and instructed by the user is stored in the ruby conversion rule table 2.
11 is stored. The ruby target character string extracting mechanism 212 refers to the ruby conversion rule table 211 and determines and extracts a character string to be ruby based on the ruby conversion rule table 211.

In the ruby conversion rule table, for example, there is designation of a unit for adding ruby. That is, this is specified when ruby is applied only to a character string that first appears for the same character string within the range of this unit, and a plurality of characters can be specified redundantly. This unit includes, for example, pages, facing pages, chapters, and the like. In addition, combinations that can be specified redundantly include combinations such as chapters and facing pages.

When such a designation is made, ruby is added to a character string that appears for the first time in the designated unit of the formatted result output data, but ruby is not added to the same character string that appears again in the same unit. To When a plurality of units are specified, it is determined whether to give or not to give according to the priority order. For example, when the unit of chapter and facing page is specified, if the priority of facing page is high, even if the chapter changes in the facing page, the character string already rubyed on the facing page will be replaced by a new chapter. Even if it appears, you will not attach ruby to it.

When a character string to be newly added with ruby is determined when a large number of ruby control codes are already applied, as in the case of re-composing an existing type-composed old document, a character string not to be added For, it is also possible to delete the already assigned ruby control code.

When the ruby target character string extraction mechanism 212 extracts the ruby target character string, it stores it in the ruby target character string data section 214 and the document data section 2.
If the ruby control code has already been added when the ruby character string is stored in the ruby character string registration mechanism 213, the ruby character string is stored in the ruby conversion table 215 in correspondence with the target character string. It is possible to extract a ruby character string to be added to a character string that is set to be ruby.

The ruby target character string stored in the ruby target character string data section 214 is converted into a ruby control code based on the correspondence between the ruby character string and the ruby character stored in the ruby conversion table 215 by the ruby conversion mechanism 217. Are sequentially given. If there is no ruby target character string in the ruby conversion table 215, the ruby character string conversation input mechanism 21
6, the ruby conversion mechanism 217 can add a ruby control code upon receiving an input from the user. At this time, the correspondence is newly stored in the ruby conversion table 215 so that it can be used in the subsequent ruby conversion of the same character string. The document data added with the ruby control code by the ruby conversion mechanism 217 is stored in the document data unit 205 as ruby-added document data. The document data to which the ruby is added is printed together as a document or used for display.

When the ruby object character string extraction mechanism 212 has stored the ruby object character string data section so as to positively delete ruby, the ruby conversion code 217 deletes the ruby control code that has already been added. Output.

Now, a more detailed structure and operation of the automatic total ruby typesetting apparatus having the above-described configuration will be described below. FIG. 4 is an explanatory diagram of an example of a logical division of ruby addition. When judging whether or not a character string is to be given a ruby, the same character string is used only for the first character string within the range of the delimiter. This delimiter is set in units of N pages, two facing pages, chapters, and M lines determined when the typesetting is performed. These are collectively called logical divisions.

This will be described with reference to the example of FIG. In the center of the figure, pages of a document such as a book are imagined from top to bottom. That is, the contents are Chapter 1, Chapter 2, Chapter 3, ...
・ It can be seen that each page is separated. Charts are also arranged on page 2 as contents. In the column of the document data structure, the page number corresponding to each page is 1,
2, 3, 4, 5,... The row numbers are indicated at 1 to 18... At the left end.

In each page, the size of characters, the number of lines, and the number of characters in each line are set in advance as a basic format according to the purpose of printing or displaying a document. In addition to these basic formats, formatting uses special fonts such as large fonts, indentation at the beginning of lines, insertion of figures and tables, photographs, line breaks in paragraphs, etc. Therefore, even if the document data is represented by a character string, the positional relationship within the page is determined after the typesetting.

The right side of the figure shows an example of the logical division of ruby addition. For one page, ruby addition is determined for each page number. Also, it is assumed that the addition of ruby when there is the same character string in the range divided into every two pages from the top for the one with two pages first appears. In the case of two-page spreads, it is possible to compare two pages starting with an even-numbered page as a unit, unlike a two-page unit, using arrows indicating the range of the figure.

In the case where the chapter is used as the unit of division, unlike a physical page, the unit of the chapter is recognized by detecting the division of the chapter in the contents of the document data. As shown by the arrows in the figure, the first line of page 1 to the second line of page 3 are the first line.
Chapter and then Chapter 2. Such a break may be used for judging ruby in combination with a break related to a page which is a physical break.

In the example in which the ten lines shown at the right end of the figure are used as a delimiter unit, when lines are counted from the beginning of the document to indicate the position of the document as indicated by the line numbers at the left end of the figure, the number of lines is specified. To indicate the range, and it is determined that the ruby is provided within the range. This is effective for a document in a format that is sequentially displayed on a screen. In the case where there is no page break, ruby is added to the first character string that appears within a certain number of lines.

As described above, there are various ranges for judging ruby as shown in FIG. 4, but the unified judging range is regarded as a logical division. The ruby is controlled so that the same character string is assigned only to the character string that first appears in the unit of the logical division. FIG. 5 shows an example of adding ruby on a page basis or on a double-page spread.

Before describing the ruby adding operation, the structure of the ruby target character string data section for controlling the addition in units of logical divisions when extracting the ruby adding character string will be described with reference to FIG. As an example, “chapters” and “spread pages” are also described as ruby assignment logical divisions. It does not make sense to set these independently, but they can also be specified at the same time, in which case a different character string is determined as the target character string depending on which logical section has higher priority. We decide how to recruit. Here, the higher the number, the higher the priority.

The character string to be assigned is composed of a character string to be subjected to ruby and a position where the character string is generated by a page number and a line number. Next, a specific example will be described. A, B, C,
D and E indicate character strings to which ruby is added. P and L enclosed in parentheses after each character string indicate a page number and a line number.

In this case, as the typesetting progresses, the range of 4 pages and 5 pages is processed for the "two-page spread" as a logical division, and the processing has just been performed on the third line of the fifth page. The logical chapter "chapter" is also processing the fifth page in a state where a new chapter has been started from what line of the fourth page.

First, assuming that only a two-page spread, which is generally specified, proceeds with the character strings A, A on the fourth page, which is the first page of the two-page spread.
B, C, and D appear at least once. That is, in the range of the two pages, the character string A appears on the first line of the fourth page. After that, even if the character string A appears, ruby is not performed in the range of these two pages, so that it is not recorded in the ruby target character string data portion.
It can be seen that the positions of the other character strings B, C, and D are recorded as if they had already appeared on the fourth page. It is recorded that the character string E first appears on the second line of page 5.

Thereafter, the process proceeds from the third line on the fifth page, and when a target to which some new ruby is to be added is detected, the ruby target character string data portion is searched to find that the same character string is already in ruby. It will be checked whether it has been granted. If ruby has already been added, the process proceeds as it is. The character string that appears for the first time in this logical division is newly recorded in this ruby character string data section together with the position where it appears.

Similarly, an example is shown in which “chapter” is a logical division. Although the same document data is targeted, since the logical division “chapter” starts from the middle line of page 4 as described above, the character string A appearing on the first to third lines of page 4 B and C are not recorded as the previous chapter. The character string D on the fourth line and the fifth line is recorded as appearing for the first time at the same position as that recorded when the facing page is set as the logical division. Page 5 of 1
The character string C on the fourth line has already appeared on the third line on the fourth page, and is recorded as the position where it first appeared in the double-page spread example, but this is the first time for this chapter and the position on the fifth page is the first time. Is recorded.

The character string E is the same as the double-page spread. Since the character string A first appears as a chapter on the third line of the fifth page, it also appears on the first line of the fourth page, but is recorded on the fifth page.

In the above description, the case where only one logical section is set is described. However, when these two logical sections are set at the same time as the logical section for judging the character string to be added with ruby, the priority order in this explanatory diagram is changed to a chapter. Is given priority in addition to the ruby-added character in the case where a double-page spread is used as a logical division, and the added character string of the logical division in units of chapters is superimposed. In a specific example, a character string C on the first line of page 5 and a character string A on the third line of page 5 are added to the assignment determination character string of the double-page spread.

The operation of determining the ruby-added character string in the apparatus having the above configuration will be described with reference to the flowchart. FIG. 7 is a flowchart illustrating the operation of the total ruby addition.

In the block diagram of the embodiment of the present invention shown in FIG. 2, a basic format and ruby conversion rules are set,
In step 08, the document data is input from the document data unit 205, the document is formatted based on the set basic format, and output to the formatted result output data unit 210. An operation of sequentially inputting ruby conversion based on the ruby conversion rule using the output of the typesetting result will be described.

Although the initial setting is not shown, a pointer indicating which part of the data input from the typesetting result output data section 210 is to be processed is set to an initial value when the processing is advanced. I have.

That is, the pointer indicates the character position at which the character string of the data is to be extracted, the line on which page of the formatted result is being processed, the line number from the beginning of the formatted document data, and the document. Are counted and managed. These pieces of position information are collectively called a pointer.

In step S702, the formatted document data is sequentially scanned from the pointer position to extract a character string. Although a logical division is set as a unit for determining a character string to be added as ruby conversion rules, it is determined in step S705 whether or not the set logical division has changed with the movement of the pointer when sequentially extracting character strings. I try to detect. For example, when the line number changes and exceeds the line number set as a logical division, or when the page number changes, if the logical division is two-page spread, the page may change from an odd page to an even page. For example, it is determined that the logical division has changed.

If there is no change in step S705, a character string is cut out from the formatted document data in step S708. This is a method of recognizing and cutting out a series of words by a normal document processing technique, for example, using a kanji character string or a foreign language character string to which a reading is added as a unit.

In step S710, it is determined whether or not the cut-out character string is already registered in the logical segment indicated by the current pointer in the ruby target character string data section 214. At this time, when a plurality of logical divisions are specified as the conversion rule for adding ruby, the search order is determined according to the priority between the logical divisions.

If not registered, in step S711, a character string and its position are registered for each logical division of the ruby target character string data section 214.

In step S713, it is determined whether a ruby control code has already been added to the extracted character string. The reason why the ruby control code has already been added is that a character string to be added with ruby is added when inputting document data, or that the old document data is input from the old document input mechanism 202 and the ruby is included in the structure of the document. This is the case when the character string is touched.

If the ruby control code has not been added yet, in step S 715, it is checked by searching whether or not the target cut-out character string is in the ruby conversion table 215. If it is in the ruby conversion table 215, the process moves to step S712.

If not registered, step S
At 716, the user is prompted to enter what ruby is to be added.

In step S712, the already registered or newly input ruby is added to the document data as a ruby control code.

In step S714, the character string that has not been registered as ruby is registered in the ruby conversion table. This allows
When the same character string is detected, the same ruby can be played.

If the ruby control code is added in step S713, the data is reflected in the ruby conversion table in step S714, and the process returns to step S702.

If it is determined in step S710 that the character string has already been provided with ruby in the logical section, it is checked whether or not the ruby control code has already been added to the character string cut out in step S701. If the ruby control code has not been added, the process proceeds to step S702, and a new character string is cut out from the next document data.

If the ruby control code has already been assigned, the ruby conversion rule must prevent ruby from being attached to a character string for which no ruby is to be assigned, and the ruby control code must be deleted. .
That is, in step S704, the already assigned ruby control code is deleted, and the process returns to step S702.

In step S705, when a new character string is searched and the logical division changes,
In step 706, the registered character string in the changed logical section is reset. As a result, for the changed new section, the character string cut out from the document data does not have the character string stored as having appeared so far, and the character string that first appeared from this point is added with ruby. When a plurality of logical sections are subject to ruby addition determination, the character strings stored in the logical sections that have not changed are continuously used for ruby addition determination.

If it is confirmed in step S709 that the end of the document data has been completed, the ruby adding process ends. If it is in the middle, the process returns to step S702 to advance the pointer, take out the next character string, and continue the ruby adding process.

As described above, the ruby is added to the entire document by assigning one or more logical divisions to the formalized document data by adding the ruby to the character string at an appropriate position. You can see that it can be done. (Supplementary Note 1) Logical division storage means for setting and storing one or more logical divisions for logically dividing document data, and ruby adding candidate character string extracting means for extracting a candidate character string to add ruby from the document data For each of the stored logical divisions, for a candidate character string consisting of the same character string, a ruby addition determining unit that determines a candidate character string that appears first as a ruby addition target character string, and the determined ruby addition of the document data. A ruby providing system, comprising: a ruby providing means for adding ruby to a target character string. (Supplementary Note 2) When organizing a document in which the number of characters accommodated in each page fluctuates and assigning document data to each page for typesetting, the ruby addition determination unit uses the logical division based on the page determined by typesetting to determine the ruby. The ruby providing system according to claim 1, wherein the ruby is provided. (Supplementary Note 3) The logical partition storage means stores a plurality of types of logical partitions and the priority for each type of each logical partition, and the ruby addition determining unit stores a plurality of types of logical partitions stored in the logical partition storage means. 3. The ruby providing system according to any one of supplementary notes 1 and 2, wherein a ruby is determined based on the priority of the ruby. (Supplementary Note 4) The input document data is ruby-attached document data to which ruby has been added based on the first typesetting. When adding ruby based on a page determined by the second typesetting, the ruby addition determining means stores For the same character string for each of the logical divisions, ruby is determined not to be added to a character string other than the character string that appears first, and the ruby adding means determines the character of the document data that has been determined to be non-ruby. The ruby providing system according to any one of supplementary notes 1 to 3, wherein ruby is not provided to the columns. (Supplementary Note 5) A logical division storage means for setting and storing one or more logical divisions for logically dividing document data in a computer, and extracting a ruby addition candidate character string for extracting a candidate character string to which ruby is to be added from the document data Means, for each of the stored logical divisions, for a candidate character string consisting of the same character string, ruby addition determining means for determining a candidate character string appearing first as a character string to be added with ruby, and the above determined ruby addition of document data A program that functions as ruby adding means for adding ruby to a target character string. (Supplementary Note 6) Logical division storage means for setting and storing one or more logical divisions for logically dividing document data, and extracting a ruby addition candidate character string for extracting a candidate character string for adding ruby from the document data Means, for each of the stored logical divisions, for a candidate character string consisting of the same character string, ruby addition determining means for determining a candidate character string appearing first as a character string to be added with ruby, and the above determined ruby addition of document data A computer-readable recording medium that records a program that functions as ruby adding means for adding ruby to a target character string. (Supplementary Note 7) When organizing a document in which the number of characters accommodated for each page fluctuates and assigning document data to each page for typesetting, the logical section storage means stores the pages determined by typesetting as logical sections. 3. The ruby providing system according to claim 1, wherein (Supplementary Note 8) When organizing a document in which the number of characters accommodated in each page fluctuates and assigning document data to each page for typesetting, the logical division storage means stores two facing spread pages determined by typesetting as logical divisions. 3. The ruby providing system according to claim 1, wherein

[0078]

As described above, in accordance with the state in which the physical arrangement of the document is determined by the typesetting of the document data, at the intervals and positions that are easy for the reader of the document to read, the ruby that is useful for reading the character string is provided. Can be arranged and applied over the entire document, so that readers can improve the document reading efficiency, that is, improve the quality of various business processes by improving the accuracy of document reading comprehension. It is possible to achieve an effect that productivity of document creation can be improved by easily realizing creation without mistake with a small number of man-hours.

[Brief description of the drawings]

FIG. 1 is a block diagram of the present invention.

FIG. 2 is a configuration diagram of an embodiment of the present invention.

FIG. 3 shows an example of ruby-added document data and ruby control code

FIG. 4 is an explanatory diagram of an example of logical division of ruby addition

[Fig. 5] Example of adding ruby in page units and spread pages

FIG. 6 is an explanatory diagram of a configuration example of a ruby target character string data section.

FIG. 7 is a flowchart illustrating an operation of providing total ruby.

[Explanation of symbols]

 DESCRIPTION OF SYMBOLS 1 Logical division storage means 2 Ruby addition determination means 3 Ruby addition means 4 Ruby addition candidate character string extraction means

Continued on the front page F term (reference) 5B009 MJ04

Claims (5)

[Claims] 1. A logical division storage means for setting and storing one or more logical divisions for logically dividing document data, and a ruby addition candidate character string extraction means for extracting a candidate character string to which ruby is to be added from the document data And for each of the stored logical divisions, for a candidate character string consisting of the same character string, ruby addition determining means for determining a candidate character string that appears first as a ruby addition target character string; A ruby providing system, comprising: a ruby providing unit for adding ruby to a character string to be provided. 2. The method according to claim 1, further comprising: when organizing a document in which the number of characters accommodated in each page varies and allocating document data to each page for typesetting, a ruby addition determination unit uses a logical division based on the page determined by typesetting. 2. The ruby providing system according to claim 1, wherein the determination is made. 3. The logical partition storage means stores a plurality of types of logical partitions and a priority for each type of logical partition, and the ruby assignment determining means stores the plurality of types of logical partitions stored in the logical partition storage means. The ruby adding system according to claim 1, wherein the ruby adding is determined based on the priority of each ruby. 4. The document data to be input is ruby-added document data to which ruby has been added based on the first typesetting. When adding ruby based on a page determined by the second typesetting, the ruby adding determining means includes: With respect to the same character string for each of the stored logical divisions, ruby is determined not to be added to a character string other than the character string that first appears, and the ruby adding means is determined to be the above-described non-ruby addition of the document data. 4. The ruby providing system according to claim 1, wherein ruby is not added to the character string. 5. A logical division storage means for setting and storing one or more logical divisions for logically dividing document data, a ruby addition candidate character string for extracting a candidate character string for adding ruby from the document data. Extracting means, for each of the stored logical divisions, for a candidate character string consisting of the same character string, ruby addition determining means for determining a candidate character string that appears first as a ruby addition target character string, A program that functions as ruby providing means for adding ruby to a character string to be provided.