JP3854684B2 - Information processing apparatus and method - Google Patents

Description

[0001]
BACKGROUND OF THE INVENTION
The present invention relates to an information processing apparatus and method for retrieving or managing text data.
[0002]
[Prior art]
In an information processing apparatus such as a full-text search apparatus that searches for document data including a search key given to all text data in the document data, an index of the search target document is used to search a large amount of text data at high speed. Is used in advance, and an index technique for performing a search using an index is used. As an example of the index technique, Japanese Patent Laid-Open No. 4-205560 describes a character position index technique.
[0003]
The basic idea of the character position index technique is to represent the positions of characters and character strings that appear in the searched text data by integers that are incremented by one for each character. Then, for each character and character string, all positions where the character and character string appear are listed using the character and character string as a key. In this index, when a search character string is searched from search target text data, the search character string is decomposed into a character and a character string which are keys of the index. A search is performed by searching for a combination in which the positional relationship between the decomposed character and the character string matches the positional relationship in the search character string.
[0004]
Here, the functional configuration of a conventional information processing apparatus will be described with reference to FIG.
FIG. 10 is a block diagram showing a functional configuration of a conventional information processing apparatus.
In FIG. 10, reference numeral 501 denotes a searched text holding unit that holds searched text data. An index 502 holds the position of the character in the searched text data for each character and character string in the searched text data with respect to the searched text data held in the searched text holding unit 501. An index creation unit to be created. Reference numeral 503 denotes an index holding unit that holds the index created by the index creation unit 502. A search character string holding unit 504 holds a character string to be searched. A search unit 505 searches for a character string in searched text data that matches the search character string held in the search character string holding unit 504 using the index held in the index holding unit 503. Reference numeral 506 denotes a search result holding unit that holds search results obtained by the search unit.
[0005]
Next, an index creation process for creating an index executed by a conventional information processing apparatus will be described with reference to FIG.
FIG. 11 is a flowchart showing an index creation process executed by a conventional information processing apparatus.
First, in step S601, the counter c is initialized. The counter c indicates the position of the character to be processed, and is initialized to 0. In step S602, the pointer p is initialized. The pointer p points to the character to be processed, and is initialized so as to point to the first character of the searched text data.
[0006]
In step S603, it is determined whether or not the pointer p has reached the last character of the searched text data. If it has reached the end (YES in step S603), the index creation process ends. On the other hand, if it has not reached the end (NO in step S603), the process proceeds to step S604.
In step S604, for the character at the position indicated by the pointer p, the value of the counter c is added to the position list of the character in the index. In step S605, the value of the counter c is incremented by one. In step S606, the pointer p is advanced so that the pointer p points to the next character, and the process returns to step S603.
[0007]
By the above index creation processing, for example, an index as shown in FIG. 14 is created for the document shown in FIG. In FIG. 13 and FIG. 14, the display is omitted except for some characters. Each line in FIG. 14 is a list of positions where each character appears. For example, it can be seen that the character “P” appears at positions 3, 15, 36,.
[0008]
Next, search processing for searching for a character string executed by a conventional information processing apparatus will be described with reference to FIG.
FIG. 12 is a flowchart showing search processing executed by a conventional information processing apparatus.
First, in step S701, the length of the search character string held in the search character string holding unit 504 is substituted into the register l. Also, 1 is assigned to the counter n. For example, if the search character string is “C program”, l = 6 and n = 1. In step S702, the index is read for the first character of the search character string held in the search character string holding unit 504. All character positions of the character are read into array 1. FIG. 15 shows the state of the array 1 when the search character string “C program” is searched using the index shown in FIG.
[0009]
In step S703, the contents of register l are compared with the contents of counter n. If the contents of the counter n <the contents of the register l (YES in step S703), the process proceeds to step S704. On the other hand, if the content of the counter n ≧ the content of the register l (NO in step S703), the process proceeds to step S707.
In step S704, the value of the counter n is incremented by one. In step S705, the index is read for the nth character indicated by the content of the search character string counter n held in the search character string holding unit 504. A value obtained by subtracting (n−1) from all character positions of the character is read into the array 2.
[0010]
In step S706, all values existing in both the arrays 1 and 2 are extracted from the arrays 1 and 2, and only these values are newly set as the values of the array 1. Then, the process returns to step S703. FIG. 16 shows the state of the array 1 when n = 3 in the array 1 and the array 2 corresponding to the array 1 shown in FIG.
In step S707, if the array 1 is not empty, 1 is held in the search result holding unit 506 as a value indicating that the search character string has been searched. When the array 1 is empty, 0 is held in the search result holding unit 506 as a value indicating that the search character string has not been searched. Then, the search process ends.
[0011]
When the search character string “C program”, which is the above example, is searched by the above search processing, the text is searched because the character strings are found in lines 1 and 35. In the case of Japanese, since the word break cannot be easily obtained, a search method for searching for text that matches as a character string is effective.
[0012]
[Problems to be solved by the invention]
However, the above-described conventional information processing apparatus has a problem that it is not possible to search only text that matches as a word in a language such as English in which a word is clearly delimited. This is because the white space character in Japanese does not represent a word break, and the index is created by skipping the white space character. Therefore, in the above example, the word “RPC program” is also searched for the search word “C program”.
[0013]
On the other hand, there is a method of searching by creating an index for each word, but this does not always create a correct index in languages that cannot easily separate words, such as Japanese documents. There is a problem that causes errors.
The present invention has been made in view of the above problems, and an object of the present invention is to provide an information processing apparatus and method that can improve text data search accuracy.
[0014]
[Means for Solving the Problems]
In order to achieve the above object, an information processing apparatus according to the present invention comprises the following arrangement. That is,
An information processing apparatus for retrieving text data,
Holding means for holding text data;
Adding means for adding an identification character for identifying the predetermined character string to the predetermined character string in the text data held by the holding means;
Creating means for creating position information regarding the position of each character in the text data added by the adding means;
Position information holding means for holding position information created by the creating means;
An input means for entering search conditions;
The addition unit adds the search condition input by the input unit, and the text data held in the holding unit corresponding to the search condition is referred to the position information held by the position information holding unit. Search means to search
Is provided.
[0015]
Preferably, conversion means for converting the text data by inserting delimiters at both ends of a predetermined character string in the text data held in the holding means,
Further comprising converted text data holding means for holding the text data converted by the converting means,
The position information creating means creates position information related to the position of each character in the text data held in the converted text data holding means.
[0016]
Preferably, the adding means adds the identification character in front of or behind the predetermined character string.
Preferably, search condition conversion means for converting the search condition by inserting delimiters at both ends of the predetermined character string in the search condition input by the input means,
Conversion search condition holding means for holding the search condition converted by the search condition conversion means,
The search means searches for text data held in the holding means corresponding to the search condition held in the conversion search condition holding means.
[0017]
Preferably, a detecting means for detecting the predetermined character string is provided.
In addition.
Preferably, the predetermined character string is a character string in which characters of a predetermined language are continuous.
In order to achieve the above object, an information processing apparatus according to the present invention comprises the following arrangement. That is,
An information processing apparatus for managing text data,
Adding means for adding an identification character for identifying the predetermined character string to the predetermined character string in the text data;
Creating means for creating position information regarding the position of each character in the text data added by the adding means;
Management means for managing the text data in association with the position information created by the creation means;
Is provided.
[0018]
In order to achieve the above object, an information processing method according to the present invention comprises the following arrangement. That is,
An information processing method for retrieving text data,
A holding step of holding the text data in the first storage medium;
An adding step of adding an identification character for identifying the predetermined character string to the predetermined character string in the text data held in the storage medium in the holding step;
A creation step of creating position information regarding the position of each character in the text data added by the addition step;
A position information holding step for holding the position information created in the creating step in a second storage medium;
An input process for entering search conditions;
Addition by the adding step to the search condition input in the input step, and text data held in the first storage medium in the holding step corresponding to the search condition is performed in the position information holding step. A search step of searching by referring to position information held in the second storage medium;
Is provided.
[0019]
In order to achieve the above object, an information processing method according to the present invention comprises the following arrangement. That is,
An information processing method for managing text data,
An adding step of adding an identification character for identifying the predetermined character string to the predetermined character string in the text data;
A creation step of creating position information regarding the position of each character in the text data added by the addition step;
A management step of managing the text data in a storage medium in association with the position information created in the creation step;
Is provided.
[0020]
In order to achieve the above object, a computer readable memory according to the present invention comprises the following arrangement. That is,
A computer readable memory storing program codes for information processing for retrieving text data,
A program code of a holding process for holding the text data in the first storage medium;
A program code of an adding step for adding an identification character for identifying the predetermined character string to the predetermined character string in the text data held in the storage medium in the holding step;
A program code of a creation step for creating position information regarding the position of each character in the text data added by the addition step;
A position information holding step for holding the position information created in the creating step in a second storage medium;
A program code of the input process for inputting the search condition;
Addition by the adding step to the search condition input in the input step, and text data held in the first storage medium in the holding step corresponding to the search condition is performed in the position information holding step. A program code of a search step for searching by referring to position information held in the second storage medium;
Is provided.
[0021]
In order to achieve the above object, a computer readable memory according to the present invention comprises the following arrangement. That is,
A computer readable memory storing a program code for information processing for managing text data,
A program code of an addition step of adding an identification character for identifying the predetermined character string to the predetermined character string in the text data;
A program code of a creation step for creating position information regarding the position of each character in the text data added by the addition step;
In association with the position information created in the creation step, a program code of a management step for managing the text data in a storage medium;
Is provided.
[0022]
DETAILED DESCRIPTION OF THE INVENTION
Hereinafter, preferred embodiments of the present invention will be described in detail with reference to the drawings.
FIG. 1 is a block diagram showing a functional configuration of an information processing apparatus according to an embodiment of the present invention.
In FIG. 1, reference numeral 101 denotes a search text holding unit that holds search text data. Reference numeral 102 denotes a searched text conversion unit that converts searched text data by inserting delimiters at both ends of English words in the searched text data held in the searched text holding unit 101. A converted text holding unit 103 holds the text data converted by the searched text conversion unit. For the converted text data held in the converted text holding unit 103, 104 holds an index listing the positions of the characters in the converted text data for each character in the converted text data. This is an index creation unit.
[0023]
An index holding unit 105 holds the index created by the index creation unit 104. Reference numeral 106 denotes a search key holding unit that holds a character string or a word serving as a search key. Reference numeral 107 denotes a search key conversion unit that converts a search key by inserting delimiters at both ends of English words in the search key held in the search key holding unit 106. A conversion key holding unit 108 holds the conversion key converted by the search key conversion unit 107. Reference numeral 109 denotes a search unit that searches for a character string that matches the conversion key held in the conversion key holding unit 108 using the index held in the index holding unit 105. A search result holding unit 110 holds search results obtained by the search unit 109.
[0024]
Next, the configuration of the information processing apparatus according to the embodiment of the present invention will be described with reference to FIG.
FIG. 2 is a block diagram showing the configuration of the information processing apparatus according to the embodiment of the present invention.
In FIG. 2, 201 is a CPU, which operates according to a program for realizing a procedure to be described later. Reference numeral 202 denotes a RAM which provides a search text holding unit 101, a converted text holding unit 103, a search key holding unit 106, a conversion key holding unit 108, a search result holding unit 110, and a storage area necessary for the operation of the program. . Reference numeral 203 denotes a ROM that holds a program for realizing a procedure to be described later. A disk device 204 implements the index holding unit 105. A bus 205 connects various components of the information processing apparatus to each other.
[0025]
Hereinafter, the processing executed in the embodiment of the present invention to be described is broadly divided into two, index creation processing for creating an index and search processing for retrieving a character string. First, the index creation process will be described with reference to FIG.
FIG. 3 is a flowchart showing index creation processing executed in the embodiment of the present invention.
[0026]
First, in step S301, text data conversion processing is performed. In the text data held in the search text holding unit 101, delimiters “@” are inserted at both ends of English words. An English word is a portion where only alphabet letters (from “A” to “Z” and from “a” to “z”) continue. The converted text holding unit 103 holds the text data in which the delimiter is inserted. For example, when a delimiter is inserted into the document shown in FIG. 13, the result is as shown in FIG. In step S302, the counter c is initialized. The counter c indicates the position of the character to be processed, and is initialized to 0.
[0027]
In step S303, the pointer p is initialized. The pointer p points to the character to be processed, and is initialized so as to point to the first character of the searched text data. In step S304, it is determined whether or not the pointer p has reached the end of the searched text data. If it has reached the end (YES in step S304), the index creation process is terminated. On the other hand, if it has not reached the end (NO in step S304), the process proceeds to step S305.
[0028]
In step S305, for the character at the position indicated by the pointer p, the value of the counter c is added to the position list of the character in the index. In step S306, the value of the counter c is incremented by one. In step S307, the pointer p is advanced so that the pointer p points to the next character, and the process returns to step S304.
By the above index processing, for example, the index shown in FIG. 6 is created for the document shown in FIG. First, each line in FIG. 6 is a list of positions where each character appears. The first line of the list shows the list of positions where the delimiter appears
Next, search processing executed in the embodiment of the present invention will be described with reference to FIG.
[0029]
FIG. 4 is a flowchart showing search processing executed in the embodiment of the present invention.
First, in step S401, search key conversion processing is performed. Of the search keys held in the search key holding unit 106, the delimiter “@” is inserted at both ends of the English word. Here, English words are determined in the same manner as in step S301 in the flowchart of FIG. The search key in which the delimiter is inserted is held in the converted text holding unit 108. For example, when the search key is “C program”, the conversion key is “@ C @ program”.
[0030]
In step S402, the length of the conversion key held in the conversion key holding unit 108 is substituted into the register l. Also, 1 is assigned to the counter n. For example, when the conversion key is “@ C @ program”, l = 8 and n = 1. In step S403, the index is read for the first character of the conversion key held in the conversion key holding unit 108. All character positions of the character are read into array 1.
[0031]
In step S404, the contents of register l are compared with the contents of counter n. If the contents of the counter n <the contents of the register l (YES in step S404), the process proceeds to step S408. On the other hand, if the content of the counter n ≧ the content of the register 1 (NO in step S404), the process proceeds to step S405.
In step S405, the value of the counter n is incremented by one. In step S406, the index is read for the nth character indicated by the content of the conversion key counter n held in the conversion key holding unit 108. A value obtained by subtracting (n−1) from all character positions of the character is read into the array 2.
[0032]
In step S407, all values existing in both the arrays 1 and 2 are extracted from the arrays 1 and 2, and only these values are newly set as the values of the array 1. Then, the process returns to step S404. FIG. 7 shows the state of array 1 when n = 5 in the above-described search string “C program”.
In step S408, if the array 1 is not empty, 1 is stored in the search result storage unit 110 as a value indicating that the search key has been searched. When the array 1 is empty, 0 is held in the search result holding unit 110 as a value indicating that the search key has not been searched. Then, the search process ends.
[0033]
Through the above search processing, the character string inappropriate as the search result including the “RPC program” is not searched for the search key “C program” in the above example.
As described above, according to the present embodiment, it is possible to accurately search only a character string that matches a word in a search for a language with a clear word break such as English.
[0034]
In the present embodiment, the case where the index creation process and the search process are executed by the same information processing apparatus has been described. However, the present invention is not limited to this. The index creation process and the search process may be performed by different information processing apparatuses. The functional configuration of each information processing apparatus in this case will be described with reference to FIGS. Note that the information processing apparatus shown in FIG. 8 and the information processing apparatus shown in FIG. 9 are connected by a network line or the like and are configured to be able to exchange data with each other. Alternatively, the index created by the information processing apparatus of FIG. 8 using a portable storage medium such as a CD-ROM is used by the information processing apparatus of FIG.
[0035]
FIG. 8 is a block diagram showing a functional configuration of an information processing apparatus according to another embodiment of the present invention.
In FIG. 8, reference numeral 1501 denotes a searched text holding unit that holds searched text data. Reference numeral 1502 denotes a searched text conversion unit that converts the searched text by inserting delimiters at both ends of English words in the searched text data held in the searched text holding unit 1501. A converted text holding unit 1503 holds the text data converted by the searched text conversion unit. Reference numeral 1504 holds an index listing the positions of the characters in the converted text data for each character in the converted text data with respect to the converted text data held in the converted text holding unit 1503. This is an index creation unit. An index holding unit 1505 holds the index created by the index creation unit 104.
[0036]
FIG. 9 is a block diagram showing a functional configuration of an information processing apparatus according to another embodiment of the present invention.
In FIG. 9, reference numeral 1601 denotes an index holding unit that holds an index created by the information processing apparatus shown in FIG. Reference numeral 1602 denotes a search key holding unit that holds a character string or a word serving as a search key. A search key conversion unit 1603 converts a search key by inserting delimiters at both ends of English words in the search key connected to the search key text holding unit. A conversion key holding unit 1604 holds the conversion key converted by the search key conversion unit 1603. A search unit 1605 searches for a character string that matches the conversion key stored in the conversion key storage unit 1604 using the index stored in the index storage unit 1601. Reference numeral 1606 denotes a search result holding unit that holds search results from the search unit 1605.
[0037]
Further, in the present embodiment, the description has been given of the case where the index creation process and the search process are performed after performing the conversion for inserting the delimiter character in both the search text data and the search key. However, the present invention is not limited to this. . For example, a delimiter may be inserted during index creation processing or search processing.
Moreover, although the case where the delimiter is actually inserted at both ends of the English word has been described, the present invention is not limited to this. For example, instead of inserting characters, an index for enumerating the positions may be provided to virtually realize delimiters.
[0038]
Moreover, although the case where a search is performed by inserting delimiters at both ends of the English words of the search key has been described, the present invention is not limited to this. For example, if a delimiter is inserted only in front of the search key, a forward matching search is realized. Further, if a delimiter is inserted only behind the search key, a backward match search is realized. If no delimiter is inserted, a partial match search is realized.
[0039]
Moreover, although the case where the delimiter is always inserted at both ends of the English word has been described, the present invention is not limited to this. When English words are continuous, delimiters may be combined into one. For example, “information retrieval” is “@ information @ retrieval @”.
Moreover, although the case where the specific partial character string used as the object which inserts a delimiter character was demonstrated as a continuous character of an alphabet, it is not limited to this. For example, a sequence of characters belonging to an arbitrary character set such as a sequence of numbers or katakana may be used as the specific character string.
[0040]
Moreover, although the case where the continuation of the character which belongs to a character set is made into a specific partial character string was demonstrated, it is not limited to this.
Moreover, although the case where it searches with respect to one text data was demonstrated, it is not limited to this. You may search with respect to several text data. For example, multiple text data can be searched by comparing the searched position and the switching position of each text data by allocating the position consecutively to all the text and holding the information of the position where the text data switches. become.
[0041]
In addition, a case has been described in which the searched text holding unit 101, the converted text holding unit 103, the search key holding unit 106, the conversion key holding unit 108, and the search result holding unit 110 are implemented by a RAM, and the index holding unit 105 is implemented by a disk device. However, the present invention is not limited to this, and any storage medium may be used.
In addition, although the case where each component of the functional configuration of the information processing apparatus is configured on the same information processing apparatus has been described, the present invention is not limited to this, and the configuration is divided into information processing apparatuses distributed on the network. May be.
[0042]
Moreover, although the case where a program is hold | maintained at ROM was demonstrated, it is not limited to this, You may implement | achieve using arbitrary storage media. Further, it may be realized by a circuit that performs the same operation.
Note that the present invention can be applied to a system composed of a plurality of devices (for example, a host computer, an interface device, a reader, a printer, etc.), but a device (for example, a copier, a facsimile machine, etc.) composed of a single device You may apply to.
[0043]
Another object of the present invention is to supply a storage medium storing software program codes for implementing the functions of the above-described embodiments to a system or apparatus, and the computer (or CPU or MPU) of the system or apparatus stores the storage medium. Needless to say, this can also be achieved by reading and executing the program code stored in the.
[0044]
In this case, the program code itself read from the storage medium realizes the functions of the above-described embodiment, and the storage medium storing the program code constitutes the present invention.
As a storage medium for supplying the program code, for example, a floppy disk, a hard disk, an optical disk, a magneto-optical disk, a CD-ROM, a CD-R, a magnetic tape, a nonvolatile memory card, a ROM, or the like can be used.
[0045]
Further, by executing the program code read by the computer, not only the functions of the above-described embodiments are realized, but also an OS (operating system) operating on the computer based on the instruction of the program code. It goes without saying that a case where the function of the above-described embodiment is realized by performing part or all of the actual processing and the processing is included.
[0046]
Further, after the program code read from the storage medium is written in a memory provided in a function expansion board inserted into the computer or a function expansion unit connected to the computer, the function expansion board is based on the instruction of the program code. It goes without saying that the CPU of the function expansion unit or the like performs part or all of the actual processing and the functions of the above-described embodiments are realized by the processing.
[0047]
When the present invention is applied to the above storage medium, program codes corresponding to the flowcharts described above are stored in the storage medium. To briefly describe, the memory map examples in FIGS. Each module shown is stored in a storage medium.
That is, as shown in FIG. 17, it is only necessary to store at least the program codes of each of the “holding module”, “addition module”, “creation module”, “input module”, and “search module” in the storage medium.
[0048]
The “additional module” holds the text data in the first storage medium. The “addition module” adds an identification character for identifying the predetermined character string to the predetermined character string in the stored text data. The “creation module” creates position information related to the position of each character in the added text data. The “position information holding module” holds the created position information in the second storage medium. The “input module” inputs search conditions. The “search module” adds to the input search condition, and the text data held in the first storage medium corresponding to the search condition is referred to the position information held in the second storage medium. Search for.
[0049]
That is, as shown in FIG. 18, at least the program code of each module of “addition module”, “creation module”, and “management module” may be stored in the storage medium.
The “addition module” adds an identification character for identifying the predetermined character string to the predetermined character string in the text data. The “creation module” creates position information related to the position of each character in the added text data. The “management module” manages text data in a storage medium in association with the created position information.
[0050]
【The invention's effect】
As described above, according to the present invention, it is possible to provide an information processing apparatus and method that can improve text data search accuracy.
[Brief description of the drawings]
FIG. 1 is a block diagram showing a functional configuration of an information processing apparatus according to an embodiment of the present invention.
FIG. 2 is a block diagram illustrating a configuration of the information processing apparatus according to the embodiment of this invention.
FIG. 3 is a flowchart showing index creation processing executed in the embodiment of the present invention.
FIG. 4 is a flowchart showing search processing executed in the embodiment of the present invention.
FIG. 5 is a diagram showing an example of converted text data according to the embodiment of the present invention.
FIG. 6 is a diagram illustrating an example of an index according to the embodiment of this invention.
FIG. 7 is a diagram illustrating an example of a state of the array 1 according to the embodiment of this invention.
FIG. 8 is a block diagram showing a functional configuration of an information processing apparatus according to another embodiment of the present invention.
FIG. 9 is a block diagram showing a functional configuration of an information processing apparatus according to another embodiment of the present invention.
FIG. 10 is a block diagram illustrating a functional configuration of a conventional information processing apparatus.
FIG. 11 is a flowchart showing index creation processing executed by a conventional information processing apparatus.
FIG. 12 is a flowchart showing search processing executed by a conventional information processing apparatus.
FIG. 13 is a diagram showing an example of searched text data.
FIG. 14 is a diagram illustrating an example of a conventional index.
FIG. 15 is a diagram illustrating an example of a state of a conventional arrangement 1;
FIG. 16 is a diagram illustrating an example of a state of a conventional arrangement 1;
FIG. 17 is a diagram showing the structure of a memory map of a storage medium that stores program codes for realizing an embodiment of the present invention.
FIG. 18 is a diagram showing the structure of a memory map of a storage medium storing program codes for realizing an embodiment of the present invention.
[Explanation of symbols]
101 Searched text holding part
102 Searched text converter
103 Conversion text holding part
104 Index creation section
105 Index holding unit
106 Search key holding unit
107 Search key converter
108 Conversion key holding unit
109 Search part
110 Search result holding unit

Claims (6)

An information processing apparatus for searching for text data consisting of separated first language and not separated Tei every word second language Ru Tei for each word,
Adding means for adding an identification character for identifying the continuous part as a word to both ends of the part of the text data in which the character of the first language is continuous;
Creating means for creating position information regarding the position of each character in the text data to which the identification character is added by the adding means;
The identification character is added by the adding means to the search condition input by the input means, and the identification character is added by referring to the position information from the text data to which the identification character is added. An information processing apparatus comprising: search means for searching for text data corresponding to a search condition. An information processing apparatus for managing text data of a second language not delimited Tei separated for each word in the first language Ru Tei for each word,
Adding means for adding an identification character for identifying the continuous part as a word to both ends of the part of the text data in which the character of the first language is continuous;
Creating means for creating position information regarding the position of each character in the text data to which the identification character is added by the adding means;
An information processing apparatus comprising: management means for managing the text data in association with the position information created by the creating means. An information processing method for an information processing apparatus partitioned into each word is partitioned into a first language and words Ru Tei search for text data consisting Tei no second language,
An additional step in which the processing unit adds identification characters for identifying the continuous portion as a word to both ends of the portion in which the text of the first language is continuous in the text data held in the storage medium;
In the adding step, the creating step in which the processing unit creates position information regarding the position of each character in the text data to which the identification character is added;
A position information holding step in which the processing unit holds the position information created in the creating step in the storage medium;
For the input search condition, the processing unit adds an identification character for identifying the continuous part as a word at both ends of the part in which the character of the first language is continuous in the search condition, A search step in which the processing unit searches the text data held in the storage medium for text data corresponding to the search condition to which the identification character is added with reference to the position information held in the storage medium. An information processing method for an information processing apparatus, comprising: An information processing method for an information processing apparatus that manages text data separated for each word is partitioned into a first language and words Ru Tei consisting Tei no second language,
An addition step in which a processing unit adds an identification character for identifying the continuous part as a word to both ends of the part of the text data in which the character of the first language is continuous;
A creation step in which the processing unit creates position information regarding the position of each character in the text data added in the addition step;
An information processing method for an information processing apparatus, comprising: a management step in which the processing unit manages text data to which the identification character is added in association with the position information created in the creation step. A computer-readable memory that the information processing program is stored, which are separated in each word being partitioned into first language and words Ru Tei search for text data consisting Tei no second language,
On the computer,
An additional step in which the processing unit adds identification characters for identifying the continuous portion as a word to both ends of the portion in which the text of the first language is continuous in the text data held in the storage medium;
In the adding step, the creating step in which the processing unit creates position information regarding the position of each character in the text data to which the identification character is added;
A position information holding step in which the processing unit holds the position information created in the creating step in the storage medium;
For the input search condition, the processing unit adds an identification character for identifying the continuous part as a word at both ends of the part in which the character of the first language is continuous in the search condition, A search step in which the processing unit searches the text data held in the storage medium for text data corresponding to the search condition to which the identification character is added with reference to the position information held in the storage medium. A computer-readable memory storing a program for realizing and. A computer-readable memory that the information processing program is stored which is separated for each word is partitioned into a first language and words Ru Tei manage text data consisting Tei no second language,
On the computer,
An addition step in which a processing unit adds an identification character for identifying the continuous part as a word to both ends of the part of the text data in which the character of the first language is continuous;
A creation step in which the processing unit creates position information regarding the position of each character in the text data added in the addition step;
A computer-readable memory storing a program that realizes a management step in which the processing unit manages the text data with the identification character added in association with the position information created in the creation step.

Images