JP3933517B2 - DOCUMENT SEARCH METHOD, DOCUMENT SEARCH DEVICE, DOCUMENT SEARCH PROGRAM, AND RECORDING MEDIUM CONTAINING THE PROGRAM - Google Patents

Description

[0001]
BACKGROUND OF THE INVENTION
The present invention relates to a document search method, a document search apparatus, a document search program, and a document search method capable of searching for a document including characters with decorations such as ruby, underline, bold, italic, color, font, and font size. The invention relates to a recording medium on which the program is recorded.
[0002]
[Prior art]
The document has decorations such as ruby, underline, bold, italic, color, font and font size. Ruby is a reading pseudonym added to characters that are difficult to read or easy to read. The underline, bold, italic, color, font, and font size are added to emphasize the character, to display a caution area, or to distinguish it from other characters. The display form of ruby is shown in FIG. In FIG. 8A, a small reading kana is added to the upper part of the character. In FIG. 8B, the characters are added in parentheses after the characters. Some document display devices can select whether or not to display ruby according to the user's preference. In that case, ruby is displayed only when it is selected to display ruby. It is possible to select whether or not decorations such as underline, bold, italic, color, font, and font size are displayed according to the user's preference.
[0003]
In addition, as a form of a data structure for storing ruby in a document, there are a method of adding characters in parentheses after a character, and a method of using a markup language such as HTML (Hyper Text Markup Language) or XML (extensible Markup Language). is there. In the method of adding characters in parentheses after characters, ruby is stored in the same manner as in the display form of FIG. An example of a method using a markup language is shown in FIG. A character string with ruby is surrounded by character strings <ruby> and </ ruby>, and a character string to be further ruby is written between character strings <rb> and </ rb>, and ruby is <rt > And </ rt>.
[0004]
For decorations other than ruby, HTML has the following data structure. Both are used in the form of sandwiching the character you want to decorate.
Underline: <u></u>
Bold: <b></b>
Italic: <i></i>
Color: <font color = "# ff0000"></font>
Font: <font face = "MS Gothic"></font>
Font size: <font size = "7"></font>
* <Font> can specify color, font and size at the same time.
Example: <font color = "# ff0000" face = "MS Gothic" size = "7"> Decorated characters </ font>
Generally, a document creation device and a document display device have a character string search function. This is a function that, when a user designates a certain character string and executes a search function, returns whether or not the designated character string exists in the document. Thus, the user can search for a desired character string from the document. Search is possible even for documents containing ruby. For example, when the character string shown in FIG. 9A exists in the sentence, parentheses and character strings indicating ruby are deleted as shown in FIG. 9B. A method for performing a search on a state is common. A general display form of the search result is shown in FIG. FIG. 11 shows an example of a search result using a character string “Kaietsu”. A method of inverting ruby as shown in FIG. 11A, or a character string with ruby as shown in FIG. 11B. There are a method of inverting and a method of inverting both ruby and a character string with ruby. Searches can be performed for underline, bold, italic, color, font and font size as well as ruby.
[0005]
Japanese Patent Laid-Open No. 5-257939 proposes the following method. The reading kana entered by the kana-kanji conversion method is stored as a document together with the kanji words or idioms converted at the time of kana-kanji conversion, and the reading kana entered when the document is reused is used as a search key. For example, after the operator inputs “Bunsho” from the input means, it is converted to “Document” by Kana-Kanji conversion, and when it is determined, the determined word (document) and the reading Kana (Bunsho) are both stored in the storage means. To do. It is also possible to input the reading pseudonym again and correct it, for example, “Bunsho”. After determining both the converted word and the reading kana, both are stored as documents in the storage means. If this document is searched with “Bunsho” as a reading pseudonym, the word “document” can be obtained as a search result.
[0006]
[Problems to be solved by the invention]
However, the above method has the following problems.
[0007]
When a document including the character string shown in FIG. 9A is searched with “Kaikeitsu”, the character string shown in FIG. 9A can be found. However, since the character string shown in FIG. 9A can be searched for the state shown in FIG. 9B at the time of the search, a character string with ruby such as “solve the problem” or “skill the problem”. Cannot be found by searching with a character string including the characters before and after
[0008]
In addition, as shown in FIG. 10A, ruby may be attached to each of “solution” and “decision” for the idiom “solution”. In this case, since the search is performed on the state of FIG. 10B at the time of the search, it cannot be found even if the search is made with “Kaikeitsu” or “Solution”.
[0009]
The method proposed in JP-A-5-257939 has the same problem. For example, if there is a character string “Means to solve an issue” in the document and a reading name “Kaikets” is registered in the string “Solution”, find it when searching with “Solution” “Kaikets”. However, there is no mention of the results when searching with a character string including the characters before and after the character string with the reading kana such as “solve the problem” and “kick the problem”. Also, when Kana-Kanji conversion is performed, Kana-Kana is stored as a document along with Kanji words, and the Kana-Kana entered when the document is reused is used as a search key. Are registered with the readings of “Kai” and “Ass”. For this reason, it is not possible to search with the reading “Kaikets”.
[0010]
Further, the method of displaying the search result as shown in FIG. 11 has the following problems.
Some document display devices can select whether or not to display ruby according to the user's preference. In that case, ruby is displayed only when it is selected to display ruby. When the search result is displayed as shown in FIG. 11, the search result is well understood when the ruby is displayed, but when the ruby is not displayed, it is difficult to understand what was found, and the user may be confused. . For example, when searching for the sentence in FIG. 9A with “Ike”, a part of the ruby “Kaiketsu” corresponds, and the search result is displayed on the document display device as shown in FIG. In FIG. 12 (a), it is not known at all where it corresponds, and even in FIG. 12 (b), it is difficult to know where it corresponds unless the reading of “Solution” is known.
[0011]
The present invention has been made in view of the above problems, and can search for documents including characters with decorations such as ruby, underline, bold, italic, color, font, font size, etc. The present invention provides a document search method, a document search apparatus, a document search program, and a recording medium on which the program is recorded, which can be easily informed to the user.
[0012]
[Means for Solving the Problems]
In order to achieve the above object, according to one aspect of the present invention, a document search method includes a step in which a storage unit of a computer stores a document in which ruby is added to characters in the document;
The document, and the character storage area character of the document containing the ruby is stored sequentially, or letter of the document is ruby, or a base character ruby is swung, identify whether nor the base character in ruby The computer conversion means converts the data structure to a ruby flag storage area in which a flag to be stored is stored;
Storing a search condition for searching for the character or ruby with the ruby added, and a storage means of a computer;
A search unit of a computer searching for the document converted into the data structure according to the search condition;
Displaying the search result on the display means of the computer,
The converting step includes:
Upon storing the characters in the character storage area, place a ruby of the base character immediately or immediately before the base character,
And a flag to be stored with the characters stored in the character storage area in the Rubifuragu storage area, and store associate with each other,
The searching step includes
Determining a character position in the document to be compared with the search condition;
Comparing the character of the search condition with the character in the document;
If the character in the document that matches as a result of the previous comparison is ruby and the character in the document that matches as a result of the comparison in this time is attached with ruby, and the character in the document that matches as a result of the previous comparison And when the character in the document that matches as a result of the comparison this time is ruby, the search condition character position remains unchanged, and only the character position to be compared in the document is shifted. Features.
[0014]
Preferably, in the document search method according to claim 1, in the step of displaying the search result, the ruby is displayed when the ruby is not displayed before the search and the search result includes the ruby. And a step of highlighting .
[0015]
Preferably, in the document search method according to claim 1, in the step of displaying the search result, ruby is added when ruby is not displayed before the search and the search result includes ruby. The method includes a step of replacing a character being displayed with ruby and highlighting the ruby .
[0016]
According to yet another aspect of the present invention, a document retrieval system, a document storage means for memorize a document ruby is added to the character in the document,
The document, and the character storage area character of the document containing the ruby is stored sequentially, or letter of the document is ruby, or a base character ruby is swung, identify whether nor the base character in ruby conversion means for flag is converted into a data structure composed of a Rubifuragu storage area to be stored to,
A search character storage means for memorize a search condition for searching the character or ruby the ruby is added,
The document has been converted into the data structures and search means for search according to the search condition,
Results include a table Shimesuru display means,
The converting means includes
Upon storing the characters in the character storage area, place a ruby of the base character immediately or immediately before the base character,
And a flag to be stored with the characters stored in the character storage area in the Rubifuragu storage area, and store associate with each other,
The search means includes
Comparison character position determining means for determining a character position in the document to be compared with the search condition;
A comparison means for comparing the character of the search condition with the character in the document;
If the character in the document that matches as a result of the previous comparison is ruby and the character in the document that matches as a result of the comparison in this time is attached with ruby, and the character in the document that matches as a result of the previous comparison And a comparison character position advancing means for shifting only the character position to be compared in the document without changing the search condition character position when the character in the document that matches as a result of the current comparison is ruby. It is characterized by including.
[0018]
According to still another aspect of the present invention, the document search program stores the document in which the ruby is added to the characters in the document in the storage unit of the computer,
The document, and the character storage area character of the document containing the ruby is stored sequentially, or letter of the document is ruby, or a base character ruby is swung, identify whether nor the base character in ruby The computer conversion means converts the data structure to a ruby flag storage area in which a flag to be stored is stored;
Storing a search condition for searching for the character or ruby with the ruby added, and a storage means of a computer;
A search unit of a computer searching for the document converted into the data structure according to the search condition;
A document search program for causing a computer to execute a step of displaying a search result by a display means of the computer,
The converting step includes:
Upon storing the characters in the character storage area, place a ruby of the base character immediately or immediately before the base character,
And a flag to be stored with the characters stored in the character storage area in the Rubifuragu storage area, and store associate with each other,
The searching step includes
Determining a character position in the document to be compared with the search condition;
Comparing the character of the search condition with the character in the document;
If the character in the document that matches as a result of the previous comparison is ruby and the character in the document that matches as a result of the comparison in this time is attached with ruby, and the character in the document that matches as a result of the previous comparison And when the character in the document that matches as a result of the comparison this time is ruby, the search condition character position remains unchanged, and only the character position to be compared in the document is shifted. Features.
[0020]
According to still another aspect of the present invention, a computer-readable recording medium records the document search program according to claim 5 .
[0021]
DETAILED DESCRIPTION OF THE INVENTION
Hereinafter, an example of an embodiment of the present invention will be described using a specific example.
[0022]
As shown in FIG. 1, the document search apparatus according to the embodiment of the present invention includes a computer 1, a keyboard 5 and a mouse 6 for giving instructions to the computer 1, a display 2 for displaying various information, A magnetic disk device 3 for reading a program executed on the computer 1 and a document to be searched, a CD-ROM (Read Only Memory) device 7 and a communication modem 9 are included. Connected to.
[0023]
A program for searching a document and a document to be searched are recorded on a magnetic disk 4 or a CD-ROM 8 that is a recording medium readable by the computer 1, and read by the magnetic disk device 3 or the CD-ROM device 7, respectively. . Alternatively, the data is read by the communication modem 9 via the communication line.
[0024]
The computer 1 includes a CPU (Central Processing Unit) 10 for executing a program read through the magnetic disk device 3, the CD-ROM device 7, or the communication modem 9, and other programs necessary for the operation of the computer 1. ROM (Read Only Memory) 11 for storing data, RAM (Random Access Memory) 12 for storing programs, parameters at the time of program execution, calculation results, etc., and programs, document data, etc. A magnetic disk 13.
[0025]
The document search method of the present invention will be described with reference to FIG.
[0026]
First, a search condition for searching by an operator is input from the keyboard 5. The input search condition is stored in the input character string buffer 21 secured in the RAM 12 (step S1). A document to be searched with decorations added to the document is stored in the search document buffer 22 secured in the RAM 12 (step S2). The document is searched according to the search condition (step S3). The search result is displayed on the display 2 (step S4).
[0027]
The process of step S1 may be other than the keyboard 5. A character string may be input by operating the mouse 6, or may be read from a magnetic disk 13 or the like in which a character string input in advance is stored. Step S1 and step S2 may be reversed in order.
[0028]
In step S4, the search result is displayed on the display 2, but the display 2 may be a CRT (Cathode Ray Tube) display, LCD (Liquid Crystal Display), or the like. Further, instead of the display 2, the search result may be output to an output device such as a printer or a communication device such as FAX. Further, the search result may be written to the magnetic disk 13, FD, magneto-optical disk or the like.
[0029]
With reference to FIG. 3, the process of step S2 of FIG. 2 will be described. FIG. 3 is a diagram for explaining the data structure of the search document buffer 22. The search document buffer 22 includes a character storage area 23 and a decoration flag storage area 24. In the character storage area 23, character strings of documents including decorations to be searched are sequentially stored. The decoration flag storage area 24 stores a flag for identifying whether each character of the document is ruby or a character with a ruby character (hereinafter referred to as a ruby base character) or neither. The For example, if a character string as shown in FIG. 9A is included in a document to be searched, the search document buffer 22 stores the data structure as shown in FIG. Here, the types of decoration flags stored in the decoration flag storage area 24 are 2 for ruby, 1 for ruby base characters, and 0 for non-native characters. Similarly, if a character string as shown in FIG. 10A is included in a document to be searched, it is stored in the search document buffer 22 as shown in FIG. This process is performed on the entire document to be searched. The types of decoration flags used here are the same as those in FIG.
[0030]
For decorations other than ruby, a single character may have multiple decorations, so the flag should be a power of 2 and the sum stored. For example, if 12 is stored, it can be determined that 4 + 8 has underlined and bold decorations. In other words, the decorative base character is 1, the underline is 4, the bold is 8, the italic is 16, the color is 32, the font is 64, the font size is 128, and the character that is neither a decorative character nor an ornament is 0. If you have decorations, store the sum.
[0031]
With reference to FIG. 4, the process of step S3 of FIG. 2 will be described.
[0032]
First, the characters in the input character string buffer 21 and the search document buffer 22 are compared one by one. In the present embodiment, the search start position of the search document buffer 22 is set as the start position of the portion displayed on the display 2, but it may be the start position of the document or may be determined by the user. Then, the input character string buffer 21 is set to the first character and the search document buffer 22 is set to the search start position (step S31).
[0033]
Next, the characters in the input character string buffer 21 and the characters in the search document buffer 22 are compared (step S32). If the characters are not the same, the search start position in the search document buffer 22 is shifted by one character (step S33), and the process is performed again from step S31.
[0034]
If the characters are the same, it is checked whether the comparison target character in the input character string buffer 21 is the first (step S34). If it is the first, the decoration flag corresponding to the character to be compared in the search document buffer 22 compared in step S32 (hereinafter referred to as the current decoration flag) is stored in the decoration flag storage buffer 25 secured in the RAM 12. Then, the comparison target characters in the input character string buffer 21 and the search document buffer 22 are shifted by one character respectively (step S35).
[0035]
If not the first, the current decoration flag and the decoration flag stored in the decoration flag storage buffer 25 (hereinafter referred to as the previous decoration flag) are examined (step S36). If the current decoration flag is ruby and the previous decoration flag is a ruby base character, or if the current decoration flag is a ruby base character and the front decoration flag is ruby, the search document buffer 22 is skipped and the search document buffer 22 is compared. The character is shifted by one character (step S37), and the process of step S32 is performed.
[0036]
If the combination of the current decoration flag and the previous decoration flag is other than that, the process of step S35 is performed. When the process of step S35 is completed, it is checked whether or not there is a character to be compared in the input character string buffer 21 (step S38). If it does not exist, a search is performed to indicate that the input character string was in the search document. Is finished (step S39).
[0037]
If there is still a comparison target character in the input character string buffer 21, it is checked whether or not there is a comparison target character in the search document buffer 22 (step S391). If there is no comparison target character, the input character string was not in the search document. The search is terminated (step S392).
[0038]
If there are still characters to be compared in the search document buffer 22, the process of step S32 is performed. The above processing is repeated until the search is completed.
[0039]
With reference to FIG. 5, the process of step S4 will be described. FIG. 5 shows an example in which a document is displayed on the display 2 of the document search apparatus. This document retrieval apparatus is set so that the user can set whether or not to display ruby and currently does not display ruby. Therefore, in this document, the ruby “Kaikeitsu” is given to the character string “Solution”, but the ruby is not displayed. Here, when the search process shown in FIG. 2 is executed and the character “defeats” is searched in step S1, it is detected including the ruby assigned to “solution” in step S3, and is shown in FIG. Thus, the detected ruby is displayed and the detected character string is inverted. Ruby may be displayed on the ruby base character as shown in FIG. 6A, or ruby may be displayed in parentheses after the ruby base character as shown in FIG. 6B.
[0040]
Further, as shown in FIG. 7, the search result may be displayed by replacing ruby base characters and ruby. In FIG. 7A, ruby base characters are displayed on the ruby. In FIG. 7B, ruby base characters are displayed in parentheses after ruby.
[0041]
Further, the highlighted display of search results is not limited to inversion, and other highlighting methods may be used. For example, the character color may be changed, the underline may be underlined, bolded, italicized, the font may be changed, or the font size may be changed.
[0042]
In the above description, the ruby search is shown as an example. However, the present invention is applicable not only to ruby but also to decorations such as underline, bold, italic, color, font, font size, etc. attached to a document.
[0043]
It should be considered that the embodiments disclosed herein are illustrative and non-restrictive in every respect. The scope of the present invention is defined by the terms of the claims, rather than the description above, and is intended to include any modifications within the scope and meaning equivalent to the terms of the claims.
[0044]
【The invention's effect】
According to the document search method, document search apparatus, document search program, and recording medium on which the program is recorded according to the present invention, decoration such as ruby, underline, bold, italic, color, font, font size, and the like when searched It is possible to find a character string including characters before and after the attached character string. In addition, characters with decorations such as ruby, underline, bold, italic, color, font, font size, etc. in the character string are decorated with ruby, underline, bold, italic, color, font, font size, etc. You can also find it by searching for In addition, even if the idiom ruby, underline, bold, italic, color, font, font size, etc. are decorated in multiple parts, one ruby, underline, bold, italic, color, It can be found as well as decorations such as font and font size.
[0045]
Also, search without decoration such as ruby, underline, bold, italic, color, font, font size, etc., and search results such as ruby, underline, bold, italic, color, font, font size, etc. Even when the decoration is included, the user can easily recognize that the decoration such as ruby, underline, bold, italic, color, font, and font size is found.
[Brief description of the drawings]
FIG. 1 is a hardware configuration diagram of a document search apparatus according to the present invention.
FIG. 2 is a flowchart of a document search method according to the present invention.
FIG. 3 is a diagram illustrating the structure of a search document buffer according to the present invention.
FIG. 4 is a detailed flowchart of step S3 in FIG.
FIG. 5 is a diagram showing an example of a screen on which a document is displayed on the document search device of the present invention.
FIG. 6 is a diagram showing an example of a screen when ruby is included in a search result according to the embodiment of the present invention.
FIG. 7 is a diagram showing an example of a screen when ruby is included in a search result according to the embodiment of the present invention.
FIG. 8 is an example of a general display form of ruby.
FIG. 9 is an example of a mode in which ruby is stored in a document using a markup language.
FIG. 10 is an example of a mode in which ruby is stored in a document using a markup language.
FIG. 11 is an example of a general display form of a search result.
FIG. 12 is an example of a general display form when a search result is ruby in a state where ruby is not displayed.
[Explanation of symbols]
1 Computer 2 Display 9 Communication Modem 10 CPU
11 ROM
12 RAM
13 Magnetic disk 21 Input character string buffer 22 Search document buffer 23 Character storage area 24 Decoration flag storage area 25 Decoration flag storage buffer

Claims (6)

A step in which a storage means of a computer stores a document in which ruby is added to characters in the document;
The document, and the character storage area character of the document containing the ruby is stored sequentially, or letter of the document is ruby, or a base character ruby is swung, identify whether nor the base character in ruby The computer conversion means converts the data structure to a ruby flag storage area in which a flag to be stored is stored;
Storing a search condition for searching for the character or ruby with the ruby added, and a storage means of a computer;
A search unit of a computer searching for the document converted into the data structure according to the search condition;
Displaying the search result on the display means of the computer,
The converting step includes:
Upon storing the characters in the character storage area, place a ruby of the base character immediately or immediately before the base character,
And a flag to be stored with the characters stored in the character storage area in the Rubifuragu storage area, and store associate with each other,
The searching step includes
Determining a character position in the document to be compared with the search condition;
Comparing the character of the search condition with the character in the document;
If the character in the document that matches as a result of the previous comparison is ruby and the character in the document that matches as a result of the comparison in this time is attached with ruby, and the character in the document that matches as a result of the previous comparison And when the character in the document that matches as a result of the comparison this time is ruby, the search condition character position remains unchanged, and only the character position to be compared in the document is shifted. Characteristic document search method.   The step of displaying the search result includes a step of displaying and highlighting ruby when ruby is not displayed before the search and ruby is included in the search result, The document search method according to claim 1.   In the step of displaying the search result, when the ruby is not displayed before the search and the ruby is included in the search result, the character to which the ruby is added is replaced with the ruby and the ruby is highlighted. The document search method according to claim 1, further comprising a step of: A document storage means for memorize a document ruby is added to the character in the document,
The document, and the character storage area character of the document containing the ruby is stored sequentially, or letter of the document is ruby, or a base character ruby is swung, identify whether nor the base character in ruby conversion means for flag is converted into a data structure composed of a Rubifuragu storage area to be stored to,
A search character storage means for memorize a search condition for searching the character or ruby the ruby is added,
The document has been converted into the data structures and search means for search according to the search condition,
Results include a table Shimesuru display means,
The converting means includes
Upon storing the characters in the character storage area, place a ruby of the base character immediately or immediately before the base character,
And a flag to be stored with the characters stored in the character storage area in the Rubifuragu storage area, and store associate with each other,
The search means includes
Comparison character position determining means for determining a character position in the document to be compared with the search condition;
A comparison means for comparing the character of the search condition with the character in the document;
If the character in the document that matches as a result of the previous comparison is ruby and the character in the document that matches as a result of the comparison in this time is attached with ruby, and the character in the document that matches as a result of the previous comparison And a comparison character position advancing means for shifting only the character position to be compared in the document without changing the search condition character position when the character in the document that matches as a result of the current comparison is ruby. A document retrieval apparatus comprising: A step in which a storage means of a computer stores a document in which ruby is added to characters in the document;
The document, and the character storage area character of the document containing the ruby is stored sequentially, or letter of the document is ruby, or a base character ruby is swung, identify whether nor the base character in ruby The computer conversion means converts the data structure to a ruby flag storage area in which a flag to be stored is stored;
Storing a search condition for searching for the character or ruby with the ruby added, and a storage means of a computer;
A search unit of a computer searching for the document converted into the data structure according to the search condition;
A document search program for causing a computer to execute a step of displaying a search result by a display means of the computer,
The converting step includes:
Upon storing the characters in the character storage area, place a ruby of the base character immediately or immediately before the base character,
And a flag to be stored with the characters stored in the character storage area in the Rubifuragu storage area, and store associate with each other,
The searching step includes
Determining a character position in the document to be compared with the search condition;
Comparing the character of the search condition with the character in the document;
If the character in the document that matches as a result of the previous comparison is ruby and the character in the document that matches as a result of the comparison in this time is attached with ruby, and the character in the document that matches as a result of the previous comparison And when the character in the document that matches as a result of the comparison this time is ruby, the search condition character position remains unchanged, and only the character position to be compared in the document is shifted. Characteristic document search program. A computer-readable recording medium on which the document search program according to claim 5 is recorded.

Images