JP2011210001A - Information processing apparatus, conversion candidate extraction method, and program - Google Patents

Abstract

PROBLEM TO BE SOLVED: To achieve the output of conversion candidates with respect to input in the Roman alphabet without increasing the scale of an index.SOLUTION: An information processing apparatus 100 which obtains an input Roman alphabetic string and extracts conversion candidates corresponding to the Roman alphabetic string, includes: a Roman alphabet correspondence index storage part 113 for storing an index including a KANA character string including KANA with one or more characters and a Roman alphabetic string with one or more characters which follows the KANA character string and does not satisfy a KANA conversion rule and conversion candidates corresponding to the index; a KANA conversion part 107 for performing KANA conversion on an input series of Roman alphabetic string from the front part of the Roman alphabetic string based on the KANA conversion rule; and an input candidate index extraction part 103 for retrieving an index from the Roman alphabet correspondence index storage part 113 based on the character string converted by the KANA conversion part 107, and for extracting the conversion candidates corresponding to the retrieved index from the Roman alphabet correspondence index storage part 113.

Description

  The present invention relates to an information processing apparatus that acquires an input Roman character string and searches for information for extracting conversion candidates corresponding to the Roman character string.

Conventionally, when a document is created by using a client terminal such as a personal computer, when the first few characters of reading are input for a predetermined word, the corresponding candidate word is displayed to assist the user's input. An input support method is used.
For example, an index that associates a character string composed of kana characters with a converted character string that is a candidate after conversion corresponding to the character string is created, and a character string composed of kana characters input by the user is analyzed An input support method is known (for example, Patent Document 1). According to such an input support method, the user's input can be supported by analyzing a character string composed of kana characters inputted by the user and displaying candidate character strings such as kanji.

JP 2000-215198 A

However, the above-described conventional input support method has the following problems. That is, in the input support method described above, when a character string composed of Roman characters is input without switching to the kana-kanji conversion mode, such as a malfunction of the client terminal or a user operation error, a candidate character string can be displayed. There is a problem that you can not.
On the other hand, a method of creating an index that associates input candidates with a character string consisting of Roman characters is also conceivable, but since there are multiple standards for kana conversion rules from Roman characters, an index that covers all the standards is used. If created, there is a problem that the amount of data becomes enormous.

  Therefore, the present invention has been made in view of such a situation, and an object of the present invention is to realize conversion candidate output for input composed of Roman characters without enlarging an index.

  In order to solve the problems described above, the present invention has the following features. First, the first feature of the present invention is that information that acquires an input Roman character string (Roman character string 153) and extracts a conversion candidate (kana-kanji conversion candidate 170 or Roman character conversion candidate 171) corresponding to the Roman character string. A processing apparatus (information processing apparatus 100) that includes a kana character string (kana character string 163) composed of one or more kana characters, and one or more roman characters that follow the kana character string and do not satisfy the kana conversion rules Storage means (Roman character correspondence index storage unit 113) for storing an index (Roman character correspondence index 161) composed of a string (non-convertible character string 165) and a conversion candidate (Roman character conversion candidate 171) corresponding to the index; Kana conversion means (kana conversion) that converts a series of input Roman characters from the front of the Roman alphabet based on the kana conversion rules A conversion unit 107) and an extraction unit that retrieves the index from the storage unit based on the character string converted by the kana conversion unit and extracts the conversion candidate corresponding to the retrieved index from the storage unit (Input candidate index extraction unit 103).

  Such an information processing apparatus includes a storage unit, a kana conversion unit, and an extraction unit. The kana conversion means converts the input series of Roman characters into a kana based on a kana conversion rule. That is, the kana conversion means performs kana conversion of a Roman character string input according to different input rules according to a plurality of standards.

The storage means includes a kana character string composed of one or more kana characters, an index composed of one or more roman character strings that follow the kana character string and do not satisfy the kana conversion rules, and conversion candidates corresponding to the indexes. Remember.
That is, the storage unit stores the character string converted by the kana conversion unit as an index and stores conversion candidates corresponding to the index.

  For this reason, the storage means can store an index in which input candidates are associated with character strings composed of Roman characters without enlarging the amount of data in order to cover all the standards of Roman character input.

  Further, the extraction means searches the index from the storage means based on the character string converted by the kana conversion means, and extracts the conversion candidates corresponding to the searched index from the storage means.

  With this index, the information processing apparatus can output conversion candidates even when a Roman character string input according to different input rules is input. Therefore, the information processing apparatus can realize conversion candidate output for input composed of Roman characters without enlarging the index.

  The second feature of the present invention relates to the first feature of the present invention, and is a Roman character conversion means (Roman character conversion unit 121) for converting a pre-registered character string (query 151) into a Roman character string based on a Roman character conversion rule. And the Roman character string converted by the Roman character conversion means at an arbitrary position from the beginning, and the Roman character string up to the divided position is converted based on a kana conversion rule, thereby creating the index. (Index creation unit 125), and the storage unit stores the previously registered character string as a conversion candidate in association with the index created by the index creation unit.

  A third feature of the present invention relates to the second feature of the present invention, in which the Roman character conversion means converts the input character string (query 151) based on each of a plurality of Roman character conversion rules having different conversion rules. The gist is to convert it into a Roman character string (for example, a Roman character string candidate 157a, a Roman character string candidate 157b, and a Roman character string candidate 157n).

  A fourth feature of the present invention relates to the first to third features of the present invention, and is summarized in that the storage unit stores an input query as a conversion candidate.

  According to a fifth aspect of the present invention, there is provided a conversion candidate extraction method for a computer that acquires an input Roman character string and extracts conversion candidates corresponding to the Roman character string, wherein the computer performs the input series of Roman characters. A step of converting a string from the front of the Roman character string based on a kana conversion rule (step S305), and a computer, based on the converted character string, a kana character string consisting of one or more kana characters, The index is searched from storage means for storing an index consisting of one or more Roman characters that follow the kana character string and does not satisfy the kana conversion rule, and conversion candidates corresponding to the index, and the searched Extracting the conversion candidate corresponding to the index from the storage unit (step S311). To.

  A sixth feature of the present invention is a program for acquiring an input Roman character string and extracting conversion candidates corresponding to the Roman character string, the kana character string consisting of one or more kana characters, and the kana character A step of storing an index consisting of one or more Roman character strings that follow the sequence and do not satisfy the kana conversion rule, and conversion candidates corresponding to the index; and the input sequence of Roman characters A kana conversion step from the front of the kana conversion rule based on the kana conversion rule, and the index is searched from the storage unit based on the character string converted by the kana conversion unit, and the conversion candidate corresponding to the searched index And a step of causing a computer to execute the step of extracting the information from the storage means.

  According to the present invention, it is possible to realize conversion candidate output for input composed of Roman characters without enlarging the index.

1 is an overall schematic configuration diagram of an information processing system 1 according to an embodiment of the present invention. It is a functional block diagram of information processor 100 concerning an embodiment of the present invention. It is a figure which shows an example of the information memorize | stored in the information processing apparatus 100 which concerns on embodiment of this invention. It is a conceptual diagram for demonstrating operation | movement of the information processing apparatus 100 which concerns on embodiment of this invention. It is a figure showing an example of information memorized by information processor 100 concerning an embodiment of the present invention. It is. It is a conceptual diagram for demonstrating operation | movement of the information processing apparatus 100 which concerns on embodiment of this invention. It is a conceptual diagram for demonstrating operation | movement of the information processing apparatus 100 which concerns on embodiment of this invention. It is a sequence diagram which shows conversion candidate extraction and search processing operation | movement of the information processing apparatus 100 which concerns on embodiment of this invention. It is a flowchart which shows the detail of the extraction process operation | movement of the conversion candidate of the information processing apparatus 100 which concerns on embodiment of this invention. It is a flowchart which shows the detail of the creation process operation | movement of the index of the information processing apparatus 100 which concerns on embodiment of this invention.

  Next, embodiments of the present invention will be described with reference to the drawings.

  In the following description of the drawings, the same or similar parts are denoted by the same or similar reference numerals. Further, the drawings are schematic, and the ratio of each dimension is different from the actual one.

  Therefore, specific dimensions and the like may be determined in consideration of the following description, and include portions where the relationship and ratio of the dimensions are different between the drawings.

  In the following embodiments, (1) the overall configuration of the information processing system 1, (2) the detailed configuration of the information processing apparatus 100, (3) the operation of the information processing system 1, (5) actions and effects, and (6) Other embodiments will be described.

(1) Overall Configuration of Information Processing System 1 FIG. 1 is an overall schematic configuration diagram of an information processing system 1 according to this embodiment.

  An information processing system 1 illustrated in FIG. 1 includes a user terminal 10, a user terminal 30, and an information processing apparatus 100. In the present embodiment, the user terminal 10, the user terminal 30, and the information processing apparatus 100 are connected via a communication network 50 (such as the Internet) and can perform data communication with each other.

  In the present embodiment, the user terminal 10 and the user terminal 30 have the same functions except that the user terminal 10 is a mobile communication terminal device and the user terminal 30 is a so-called PC. In the description, the user terminal 10 is mainly described. Therefore, the user terminal 30 has the same function as the user terminal 10, but detailed description thereof will be omitted as appropriate.

  The information processing system 1 exchanges the query 151, the Roman alphabet conversion candidate 171, and the search page between the user terminal 10, the user terminal 30, and the information processing apparatus 100.

  The information processing apparatus 100 acquires the Roman character string 153 input from the user terminal 10 as the query 151, extracts the kana-kanji conversion candidate 170 or the Roman character conversion candidate 171 corresponding to the Roman character string 153, and sends it to the user terminal 10. Send. In the following embodiment, “Zip code”, “Post office”, “Postal”, “Postal charge” are selected as Roman character conversion candidates 171 corresponding to the Roman character string 153 based on the query 151 including the Roman character string 153 “yuubin”. As an example of extracting “

  The user terminal 10 is a device that acquires a search page from the information processing device 100 via the communication network 50. The user terminal 10 is a PC (Personal Computer), a mobile communication terminal device (a mobile phone or a smartphone), a car navigation system, or the like used by the user, such as a wireless LAN, near field communication (Bluetooth (registered trademark), infrared communication, or the like). ) Or wired communication (USB (Universal Serial Bus) cable connection or the like) is connected to the information processing apparatus 100 via the communication network 50. The user terminal 10 includes an input device such as a key button or a touch panel, an output device such as a liquid crystal display, and a general browser in addition to hardware resources included in the information processing apparatus 100. The browser is a function for requesting, acquiring and displaying page data described in a language such as HTML (Hyper Text Markup Language), transmitting form data, etc., in accordance with HTTP (Hyper Text Transfer Protocol), which is a standard protocol of the Internet. have.

  In the user terminal 10, a query input field 260 (see FIG. 2) in which characters, numbers, and the like are input from the user as a query 151, and a search button 270 for executing a search based on the query in the query input field 260 (FIG. 2). And a conversion candidate column 280 for displaying the romaji conversion candidate 171 to the user. The user terminal 10 transmits the query 151 being sequentially input to the information processing apparatus 100 based on the input to the query input field 260 of the user. The user terminal 10 may transmit the query 151 to the information processing apparatus 100 in accordance with the user's operation on the search button 270. The process in which the user terminal 10 sequentially transmits the query input in the query input field 260 to the information processing apparatus 100 can be realized by, for example, a program such as JavaScript embedded in a web page.

  In addition, the user terminal 10 sequentially acquires the Romaji conversion candidates 171 from the information processing apparatus 100 and displays the Romaji conversion candidates 171 to the user via the conversion candidate column 280. That is, the user terminal 10 sequentially acquires Roman character conversion candidates 171 from the information processing apparatus 100 for the query 151 being input, and displays them to the user.

(2) Detailed Configuration of Information Processing Apparatus 100 FIG. 2 is a functional block diagram of the information processing apparatus 100 according to the present embodiment.

  The information processing apparatus 100 includes a computer (single or plural) having hardware resources such as a control device such as a CPU, a storage device such as a memory and an HDD, and a communication device such as a communication I / F that communicates with the communication network 50. The The following blocks included in the information processing apparatus 100 are realized by executing a computer program using hardware resources such as the computer control apparatus described above. These blocks and means do not have to be arranged on a single computer, and a configuration in which they are distributed as necessary may be adopted.

  The information processing apparatus 100 includes a query acquisition unit 101, an input candidate index extraction unit 103, an input candidate index storage unit 105, a kana conversion unit 107, a converted character string determination unit 109, a Roman character corresponding index extraction unit 111, and a Roman character corresponding index storage unit 113. , Input candidate transmission unit 115, query log acquisition unit 117, query log storage unit 119, Romaji conversion unit 121, kana conversion dictionary storage unit 123, and index creation unit 125. These functional units are constituted by so-called computers, and are related to a CPU (Central Processing Unit) as an arithmetic / control device, a RAM (Random Access Memory) and a ROM (Read Only Memory) as a storage medium, a communication interface, and the like. It is realized with. Hereinafter, each functional unit will be described.

(2.1) Query acquisition unit 101
The query acquisition unit 101 acquires a query 151 from the user terminal 10 via the communication network 50. Specifically, the query acquisition unit 101 sequentially acquires the query 151 being input from the user terminal 10 via the communication network 50. For example, the query acquisition unit 101 sequentially acquires a query 151 including “yuubin” from the user terminal 10 with input.

(2.2) Input candidate index extraction unit 103
FIG. 3 is a diagram illustrating an example of information stored in the input candidate index storage unit 105 of the information processing apparatus 100.
The input candidate index extraction unit 103 searches the input candidate index storage unit 105 based on the query 151 acquired by the query acquisition unit 101 and extracts a corresponding kana-kanji conversion candidate 170. That is, the query 151 corresponds to the kana-kanji correspondence index 160, and the corresponding kana-kanji conversion candidate 170 is extracted by searching the kana-kanji correspondence index 160 that substantially matches the query 151.

  In this embodiment, the input candidate index extraction unit 103 does not search the kana-kanji corresponding index 160 from the input candidate index storage unit 105 because the query 151 including “yuubin” is not stored as the kana-kanji corresponding index 160. The kana-kanji conversion candidate 170 cannot be extracted.

  Further, the input candidate index extraction unit 103 searches the input candidate index storage unit 105 based on the converted character string 169 obtained by converting the query 151 based on the kana conversion rule by the kana conversion unit 107, and corresponding kana kanji. A conversion candidate 170 is extracted.

  As illustrated in FIG. 3, for example, the input candidate index extraction unit 103 reads “yubin” from the input candidate index storage unit 105 when the query or conversion character string 169 acquired by the query acquisition unit 101 is “yubin”. The kana-kanji correspondence index 160 corresponding to is searched, and “postal code”, “post office”, “postal”, and “postage” are extracted as kana-kanji conversion candidates 170 corresponding to the searched “Yubin”.

(2.3) Input candidate index storage unit 105
As shown in FIG. 3, the input candidate index storage unit 105 includes one or more kana-kanji characters and a kana-kanji corresponding index 160 made up of a character string that does not include roman characters, and conversion candidates corresponding to the kana-kanji corresponding index 160. The kana-kanji conversion candidate 170 is stored.

  Specifically, the input candidate index storage unit 105 stores the input query 151 as the kana-kanji corresponding index 160 when the input query 151 includes a kana-kanji and a character string that does not include a roman character. To do. Further, the input candidate index storage unit 105 stores the kana / kanji conversion candidate 170 in association with the kana / kanji correspondence index 160.

  The kana-kanji correspondence index 160 is an index for assigning the kana-kanji conversion candidates 170 based on the query 151, and is composed of character strings such as hiragana, katakana, kanji, and numbers, or a combination thereof. The kana-kanji conversion candidate 170 is a conversion candidate for the query 151 displayed in the conversion candidate column 280 of the user terminal 10. That is, the kana-kanji conversion candidate 170 is composed of a character string such as hiragana, katakana, kanji, numerals, romaji, or a combination thereof.

  For example, the input candidate index storage unit 105 uses “Yu”, “Yubi”,... “Yu”, “Yubin” etc. as the kana-kanji corresponding index 160, and the corresponding “postal code”, “post office”, “Postal”, “postal charge”, etc. are stored as kana-kanji conversion candidates 170.

(2.4) Kana conversion unit 107
FIG. 4 is a conceptual diagram for explaining the operation of the kana conversion unit 107 of the information processing apparatus 100.

  As illustrated in FIG. 4, when the input query 151 includes a series of Roman character strings 153, the kana conversion unit 107 converts the query 151 from the front of the Roman character string 153 based on the kana conversion rules. . Specifically, the kana conversion unit 107 converts the query 151 from the front of the Roman character string 153 into the converted character string 169 based on the kana conversion rule. Note that the conversion character string 169 is composed of only a kana character string 163 composed of one or more kana characters (FIG. 4 (a)) by a series of input Roman character strings 153, and from one or more kana characters. A kana character string 163, and a non-convertible character string 165 that is one or more Roman characters that follow the kana character string 163 and do not satisfy the kana conversion rules (FIG. 4B). There is.

  For example, as illustrated in FIG. 4A, when the query 151 is “yuubin”, the kana conversion unit 107 converts “yuubin” into “yubin” as a conversion character string 169. Also, as illustrated in FIG. 4B, when the query 151 is “yuub”, the kana conversion unit 107 converts “yuub” into “yu b” as the conversion character string 169.

(2.5) Conversion character string determination unit 109
The conversion character string determination unit 109 includes a kana character whose conversion character string 169 includes a kana character string 163 and a non-convertible character string 165 that follows the kana character string 163, or a kana composed of one or more kana characters. It is determined whether only the character string 163 is included.

  Specifically, the conversion character string determination unit 109 extracts the kana-kanji conversion candidate 170 from the input candidate index storage unit 105 when it is determined that the conversion character string 169 includes only the kana character string 163. Determine.

  Further, when the conversion character string determination unit 109 determines that the conversion character string 169 includes the kana character string 163 and the non-convertible character string 165 that follows the kana character string 163, the conversion character string candidate 171 Is extracted from the Roman alphabet corresponding index storage unit 113.

(2.6) Romaji corresponding index extraction unit 111
FIG. 5 is a diagram illustrating an example of information stored in the Roman alphabet corresponding index storage unit 113 of the information processing apparatus 100.

  As illustrated in FIG. 5, the Roman alphabet corresponding index extracting unit 111 includes a conversion character string 169 that includes a kana character string that includes one or more kana characters, and a single character that does not satisfy the kana conversion rules after the kana character string. When composed of the above Roman character strings, the Roman character conversion candidates 171 are extracted from the Roman character correspondence index storage unit 113.

Specifically, the Roman alphabet corresponding index extraction unit 111 searches the Roman alphabet corresponding index 161 from the Roman alphabet corresponding index storage unit 113 based on the character string converted by the kana conversion unit 107, and the searched Roman alphabet corresponding index 161. The corresponding Roman character conversion candidate 171 is extracted from the Roman character correspondence index storage unit 113.
For example, when the converted character string 169 converted by the kana conversion unit 107 is “Yu b”, the Romaji corresponding index extraction unit 111 reads the Romaji corresponding index corresponding to “Yu b” from the Romaji corresponding index storage unit 113. 161 is retrieved, and “zip code”, “post office”, “mail”, and “postage” are extracted from the Roman character correspondence index storage unit 113 as Roman character conversion candidates 171 corresponding to the retrieved “Yu b”.

(2.7) Roman letter correspondence index storage unit 113
As illustrated in FIG. 5, the Roman alphabet corresponding index storage unit 113 includes a kana character string 163 including one or more kana characters, and one or more roman character strings that follow the kana character string 163 and do not satisfy the kana conversion rules. Romaji corresponding index 161 that is an index composed of non-convertible character string 165 and Romaji conversion candidate 171 that is a conversion candidate corresponding to Romaji corresponding index 161 are stored.

  Specifically, in the Roman alphabet corresponding index storage unit 113, the converted character string 169 converted by the kana conversion unit 107 follows the kana character string 163 composed of one or more kana characters and the kana character string 163. In the case of being composed of a non-convertible character string 165 that is a character string of one or more characters that does not satisfy the kana conversion rule, the converted character string 169 is stored as the Roman character correspondence index 161. In addition, the Roman alphabet corresponding index storage unit 113 stores a query 151 including a character string registered in advance as a Roman alphabet conversion candidate 171 corresponding to the Roman alphabet corresponding index 161.

  The Roman character correspondence index 161 is an index for assigning a Roman character conversion candidate 171 based on the query 151. The kana character string 163 composed of one or more kana characters and the kana character string 163 follow the kana character string 163. And a non-convertible character string 165 that is a character string of one or more characters that does not satisfy the kana conversion rule. The Roman character conversion candidate 171 is a conversion candidate of the query 151 displayed in the conversion candidate column 280 of the user terminal 10. That is, the Roman alphabet conversion candidate 171 is configured by a hiragana character, katakana, kanji, numerals, a character string such as a Roman character, or a combination thereof.

  The non-convertible character string 165 is a Roman character string that cannot be converted into a kana based on any kana conversion rules. Specifically, the non-convertible character string 165 is a Roman character string that lacks vowels (a, i, u, e, o) based on the kana conversion rules.

  For example, the Roman alphabet corresponding index storage unit 113 uses “Yu b”, “Yubi n”, “Yubi x”, etc. as the Roman alphabet corresponding index 161, and corresponding “postal code”, “post office”, “postal”, “Postage” or the like is stored as a Roman character conversion candidate 171.

(2.8) Input candidate transmission unit 115
The input candidate transmission unit 115 sequentially transmits the kana-kanji conversion candidate 170 or the romaji conversion candidate 171 to the user terminal 10 for the series of Roman character strings 153 being input from the user terminal 10.

  Specifically, the input candidate transmission unit 115 transmits the kana-kanji conversion candidate 170 to the user terminal 10 when the Roman character string 153 is composed only of the kana character string 163 including one or more kana characters. Further, the input candidate transmission unit 115 includes a kana character string 163 that includes one or more kana characters and a kana character string 163 that follows the kana character string 163 and that does not satisfy the kana conversion rules. In the case of being composed of a certain non-convertible character string 165, the Roman character conversion candidate 171 is transmitted to the user terminal 10.

(2.9) Query log acquisition unit 117
The query log acquisition unit 117 acquires the query 151 input by the user from the query log storage unit 119.

(2.10) Query log storage unit 119
The query log storage unit 119 stores the query 151 input by the user. Specifically, the query log storage unit 119 includes the query 151 acquired by the query acquisition unit 101, the URL of the site selected by the user on the user terminal 10 from the search result based on the query 151, and the time information when the query 151 is input. Memorize etc.

(2.11) Romaji conversion unit 121
FIG. 6 is a conceptual diagram for explaining the operation of the Romaji conversion unit 121 of the information processing apparatus 100.

  As illustrated in FIG. 6, the Roman character conversion unit 121 converts a query 151 that is a pre-registered character string into a Roman character string candidate 157 that is a Roman character string based on a Roman character conversion rule.

  The Romaji conversion unit 121 converts the input query 151 into a Romaji string candidate 157 based on each of a plurality of Romaji conversion rules having different conversion rules.

  Specifically, the Romaji conversion unit 121 uses, for example, “JIS X 4063: 2000” (a conversion method from alphabetic key input to Kana for the kana-kanji conversion system), a kanji instruction, a Hebon as the above-mentioned Romaji conversion rules. The query 151 is converted into a plurality of Roman character string candidates 157 based on the formula, the conversion method from the input by “Microsoft (registered trademark) IME” to the kana, and the conversion method from the input by “ATOK (registered trademark)” to the kana. .

  The Roman character conversion unit 121 converts the query 151 acquired by the query log acquisition unit 117 into a Roman character string candidate 157. When the query 151 includes kanji, the Roman character conversion unit 121 extracts the corresponding kana character string 163 from the kana conversion dictionary storage unit 123 based on the query 151.

  For example, as illustrated in FIG. 6A, when the query 151 acquired by the query log acquisition unit 117 is “zip code”, the Roman character conversion unit 121 sets the kana character string 163 corresponding to “zip code”. Is converted based on the dictionary stored in the kana conversion dictionary storage unit 123. Next, the Romaji conversion unit 121 converts “Yubinbango” to “yuubinbangou”, “yuwubinbangouu”, “yuwubinbangowu”, “yuubinnbanngou”, which is a Roman character string candidate 157a, a Roman character string candidate 157b,. , “Yuubixnbaxngou”, etc.

  Also, as shown in FIG. 6B, the Roman character conversion unit 121, when the query 151 acquired by the query log acquisition unit 117 is composed of the kana character string 163 (for example, “Yubinbango”), Without using the conversion dictionary storage unit 123, the query 151 “Yubinbango” is converted into a Roman character string candidate 157 as in the above example.

(2.12) Kana conversion dictionary storage unit 123
The kana conversion dictionary storage unit 123 stores a kanji mixed character string including characters other than the kana character string and a kana character string made up of the reading kana of the kanji mixed character string. Specifically, the kana conversion dictionary storage unit 123 stores kanji, katakana, numbers, and the like as kanji mixed character strings.

(2.13) Index creation unit 125
FIG. 7 is a conceptual diagram for explaining the operation of the Romaji conversion unit 121 of the information processing apparatus 100.

  As shown in FIG. 7, the index creating unit 125 has an arbitrary position (for example, a position where two or three characters are divided) from the top of the Roman character string candidate 157 that is a series of Roman character strings converted by the Roman character converting unit 121. The kanji / kanji correspondence index 160 or the romaji correspondence index 161 is created by converting the roman character string candidates 157 up to the delimited position 126 based on the kana conversion rules.

  Specifically, as shown in FIG. 7A, the index creation unit 125 is configured only by a kana character string 163 composed of one or more kana characters according to the position 126 where the Roman character string candidates 157 are separated. There is a case where the converted character string 169 is converted. Also, as shown in FIG. 7B, the index creating unit 125 determines the kana character string 163 composed of one or more kana characters and the kana character string 163 according to the position 126 where the Roman character string candidates 157 are separated. There is a case where the character string is converted into a conversion character string 169 that is followed by a non-convertible character string 165 that is one or more Roman characters that do not satisfy the kana conversion rule.

  The index creating unit 125 stores the converted character string 169 as the kana-kanji corresponding index 160 in the input candidate index storage unit 105 when the converted character string 169 includes only the kana character string 163. The index creation unit 125 also converts the original query 151 converted into the converted character string 169 by the Roman character conversion unit 121 and the index creation unit 125 as an input candidate index storage unit as a kana-kanji conversion candidate 170 corresponding to the kana-kanji corresponding index 160. It memorize | stores in 105.

  When the conversion character string 169 is composed of the kana character string 163 and the non-convertible character string 165 that follows the kana character string 163, the index creating unit 125 sets the conversion character string 169 as the Roman character corresponding index 161. It is stored in the Roman alphabet corresponding index storage unit 113. Further, the index creation unit 125 stores the original query 151 converted into the converted character string 169 by the Roman character conversion unit 121 and the index creation unit 125 in the Roman character correspondence index storage unit 113 as the Roman character conversion candidate 171 corresponding to the Roman character correspondence index 161. Remember.

(3) Operation of Information Processing System 1 Regarding the operation of the information processing system 1, (3.1) Overall schematic operation, (3.2) Conversion candidate extraction processing operation of the information processing device 100, (3.3) Information processing device 100 index creation processing operations will be described in this order.

(3.1) Overall Schematic Operation FIG. 8 is a sequence diagram showing conversion candidate extraction and search processing operations of the information processing system 1 according to the embodiment. In the information processing system 1, based on the query 151 input by the user terminal 10, the information processing apparatus 100 creates a search page and displays it on the user terminal 10.

As shown in FIG. 8, in step S <b> 100, the user terminal 10 accepts a query 151 including a Roman character string 153 from the user.
In step S <b> 200, the user terminal 10 sequentially transmits the query 151 being input by the user to the query acquisition unit 101 of the information processing apparatus 100 via the communication network 50.

  In step S <b> 300, the information processing apparatus 100 acquires the input Roman character string as the query 151, extracts the kana-kanji conversion candidate 170 or the Roman character conversion candidate 171 corresponding to the Roman character string, and transmits it to the user terminal 10.

  In step S400, the user terminal 10 displays a list of kana-kanji conversion candidates 170 or romaji conversion candidates 171 to select a user conversion candidate.

  In step S <b> 500, the user terminal 10 transmits a search execution request to the information processing apparatus 100.

  In step S <b> 600, the information processing apparatus 100 performs a search using the character string selected in step S <b> 400 as a query, and transmits a search page to the user terminal 10 via the communication network 50.

  In step S700, the user terminal 10 displays a search page.

(3.2) Conversion Candidate Extraction Processing Operation of Information Processing Device 100 FIG. 9 is a flowchart showing the conversion candidate extraction processing operation of the information processing device 100 according to the embodiment. Specifically, FIG. 9 shows the detailed operation of the process in which the information processing apparatus 100 in step S300 extracts the Romaji conversion candidate 171.

  In step S <b> 301, the query acquisition unit 101 sequentially acquires the query 151 being input from the user terminal 10 via the communication network 50.

  In step S303, the input candidate index extraction unit 103 searches the input candidate index storage unit 105 based on the query 151 acquired by the query acquisition unit 101, and determines whether or not there is a corresponding kana-kanji conversion candidate 170. To do.

  Specifically, if there is a kana-kanji conversion candidate 170 corresponding to the query 151, the input candidate index extraction unit 103 extracts the kana-kanji conversion candidate 170 and advances the process to step S313. If there is no kana-kanji conversion candidate 170 corresponding to the query 151, the input candidate index extraction unit 103 advances the process to step S305.

  In step S305, the kana conversion unit 107 converts the input query 151 into a conversion character string 169 based on the kana conversion rule.

  In step S307, the converted character string determination unit 109 determines that the converted character string 169 follows the kana character string 163 including one or more kana characters and the kana character string 163 and does not satisfy the kana conversion rules. It is determined whether it is composed of a non-convertible character string 165 that is a Roman character string or only a kana character string 163 consisting of one or more kana characters.

  Specifically, the conversion character string determination unit 109 advances the process to step S309 when the conversion character string 169 is configured only by the kana character string 163 including one or more kana characters. The conversion character string determination unit 109 also includes a conversion character string 169 that includes one or more kana characters and a kana character string 163 that follows the kana character string 163 and that does not satisfy the kana conversion rules. If it is constituted by a column, the process proceeds to step S311.

  In step S 309, the input candidate index extraction unit 103 extracts the kana-kanji conversion candidate 170 corresponding to the converted character string 169 from the input candidate index storage unit 105.

  In step S <b> 311, the Romaji correspondence index extraction unit 111 extracts the Romaji conversion candidate 171 corresponding to the conversion character string 169 from the Romaji correspondence index storage unit 113.

In step S <b> 313, the input candidate transmission unit 115 sequentially transmits conversion candidates to the user terminal 10 for a series of Roman character strings 153 being input from the user terminal 10.
As a result, the information processing apparatus 100 ends the conversion candidate extraction processing operation.

(3.3) Index Creation Processing Operation of Information Processing Device 100 FIG. 10 is a flowchart showing index creation processing operation of the information processing device 100 according to the embodiment. Specifically, FIG. 10 shows the detailed operation of the index creation process in which the information processing apparatus 100 in step S300 creates the Romaji conversion candidate 171.
In order to extract the Romaji conversion candidate 171 based on the query 151 including the Romaji string 153, the information processing apparatus 100 stores the Romaji correspondence index 161 and the Romaji conversion candidate 171 in a database storing Romaji conversion index 171 by the following processing. Store in the storage unit 113.

  In step S801, the query log acquisition unit 117 acquires the query 151 input by the user from the query log storage unit 119.

  In step S803, the Romaji conversion unit 121 converts the query 151 into a Romaji string candidate 157, which is a Romaji string, based on a Romaji conversion rule.

  In step S805, the index creation unit 125 delimits the Roman character string candidate 157 converted by the Roman character conversion unit 121 at an arbitrary position from the top, and converts the Roman character string candidates 157 up to the delimited position based on the kana conversion rules. By converting to 169, the kana-kanji correspondence index 160 or the Roman alphabet correspondence index 161 is created.

  In step S807, the index creating unit 125 creates the kana-kanji corresponding index 160 or the Roman character-corresponding index 161 and stores them in the input candidate index storage unit 105 or the Roman character-corresponding index storage unit 113, respectively.

  Further, the index creation unit 125 stores the query 151 in the input candidate index storage unit 105 as the kana-kanji conversion candidate 170 corresponding to the kana-kanji correspondence index 160. Similarly, the index creating unit 125 stores the query 151 in the Roman alphabet corresponding index storage unit 113 as the Roman alphabet conversion candidate 171 corresponding to the Roman alphabet corresponding index 161.

  Thereby, the information processing apparatus 100 ends the index creation processing operation.

(5) Operation / Effect As described above, according to the present embodiment, the information processing apparatus 100 includes the Roman alphabet corresponding index storage unit 113, the kana conversion unit 107, and the input candidate index extraction unit 103.

  The kana conversion unit 107 converts the input series of Roman character strings 153 into a converted character string 169 based on the kana conversion rules. That is, the kana conversion unit 107 converts to a converted character string 169 even when a Roman character string 153 input according to different input rules is input based on a plurality of Roman conversion standards.

  The Roman character correspondence index storage unit 113 includes a kana character string 163 composed of one or more kana characters, a non-convertible character string 165 that follows the kana character string 163 and is one or more roman character strings that do not satisfy the kana conversion rules, Are stored, and a Roman character conversion candidate 171 corresponding to the Roman character correspondence index 161 is stored.

  That is, since the conversion candidate index corresponding to the Romaji input is created as the Romaji corresponding index 161 including the kana / kanji, it can be said that the index is created by absorbing the Romaji input having various input rules.

  For this reason, the Roman alphabet corresponding index storage unit 113 can store an index in which input candidates are associated with character strings composed of Roman characters without enlarging the amount of data in order to cover all the standards of Roman alphabet input. Thereby, even if the Roman character string 153 is input according to different input rules based on a plurality of Roman character conversion standards, conversion candidates corresponding to the Roman character string 153 can be output. Therefore, it is possible to reduce the load on the information processing apparatus 100 by creating an index corresponding to Roman character input while suppressing an increase in the amount of data.

  Further, the input candidate index extraction unit 103 searches the Roman character correspondence index 161 from the Roman character correspondence index storage unit 113 based on the converted character string 169 converted by the kana conversion unit 107, and the searched Roman character correspondence index 161 is searched. The corresponding Roman character conversion candidate 171 is extracted from the Roman character correspondence index storage unit 113.

  That is, the information processing apparatus 100 can convert the input Roman character string 153 into the converted character string 169 and extract the Roman character conversion candidate 171 corresponding to the converted character string 169.

  Therefore, the information processing apparatus 100 can display conversion candidates for input composed of Roman characters while reducing the load on the information processing apparatus 100.

  In the embodiment, the information processing apparatus 100 converts the query 151, which is an input character string, into a Roman character string based on a Roman character conversion rule, and a Roman character string converted by the Roman character conversion unit 121 at the top. Is further provided with an index creation unit 125 that creates a Roman character-corresponding index 161 by converting a Roman character string from an arbitrary position into a converted character string 169 based on a kana conversion rule. Further, the Roman alphabet corresponding index storage unit 113 stores the query 151 as the Roman alphabet conversion candidate 171 in association with the Roman alphabet corresponding index 161.

  For this reason, the Roman alphabet corresponding index storage unit 113 does not need to register words as input candidates in advance, and the Roman alphabet corresponding index 161 and the Romaji conversion are performed by the query 151 that is input as the user uses the information processing apparatus 100. Candidate 171 can be updated. That is, according to the Roman alphabet corresponding index storage unit 113, the Roman alphabet corresponding index storage unit 113 can be updated from the action data of the user.

  In the embodiment, the Roman alphabet conversion candidate 171 converts the query 151 into a Roman character string candidate 157a, a Roman character string candidate 157b,... To do.

  For this reason, the Roman alphabet corresponding index storage unit 113 can store a Roman alphabet corresponding index 161 that covers a plurality of Roman alphabet conversion rules having different conversion rules without registering words as input candidates in advance. Therefore, the information processing apparatus 100 can extract the Roman character conversion candidate 171 corresponding to the Roman character string 153 even when the Roman character string 153 input according to different input rules is input based on a plurality of standards.

  In the embodiment, the Roman alphabet corresponding index storage unit 113 stores the input query 151 as a Roman alphabet conversion candidate 171. For this reason, information that is sequentially input with the use of the information processing apparatus 100 by the user can be extracted as the Roman alphabet conversion candidate 171.

(6) Other Embodiments In the above-described embodiment, the kana-kanji conversion candidate 170 is stored in the input candidate index storage unit 105 when the conversion character string 169 is constituted only by the kana character string 163. Further, when the converted character string 169 includes the kana character string 163 and the non-convertible character string 165 that follows the kana character string 163, the Roman character conversion candidate 171 is stored in the Roman character correspondence index storage unit 113. The present invention is not limited to this, and the input candidate index storage unit 105 and the Roman character correspondence index storage unit 113 may be stored in one storage unit. In this case, the input candidate index extraction unit 103 and the Roman character corresponding index extraction unit 111 may function as one extraction unit. Alternatively, the kana-kanji conversion candidate 170 or the romaji conversion candidate 171 corresponding to the romaji string 153 may be extracted without identifying the kana-kanji conversion candidate 170 and the romaji conversion candidate 171 as conversion candidates.

  As described above, the present invention naturally includes various embodiments that are not described herein. Therefore, the technical scope of the present invention is defined only by the invention specifying matters according to the scope of claims reasonable from the above description.

  For example, each configuration diagram, flowchart, conceptual diagram, and the like are merely examples, and the presence / absence of each element, its order, specific contents, and the like can be changed as appropriate. As an example, manual block designation is not indispensable, and in the present invention, elements such as each means are not limited to an arithmetic control unit of a computer but may be realized by an electronic circuit based on wired logic or the like.

DESCRIPTION OF SYMBOLS 1 Information processing system 10 User terminal 30 User terminal 50 Communication network 100 Information processing apparatus 101 Query acquisition part 103 Input candidate index extraction part 105 Input candidate index storage part 107 Kana conversion part 109 Conversion character string determination part 111 Roman character corresponding index extraction part 113 Romaji-compatible index storage unit 115 Input candidate transmission unit 117 Query log acquisition unit 119 Query log storage unit 121 Romaji conversion unit 123 Kana conversion dictionary storage unit 125 Index creation unit 126 Position 151 Query 153 Roman character string 157, 157a, 157b, 157n Roman character string candidate 160 Kana-Kanji index 161 161 Roman-character index 163 Kana character string 165 Non-convertible character string 169 Conversion character string 170 Kana-Kanji conversion candidate 171 Romaji conversion candidates 260 Query input field 270 Search button 280 Conversion candidate field

Claims (6)

An information processing apparatus that acquires an input Roman character string and extracts conversion candidates corresponding to the Roman character string,
An kana character string consisting of one or more kana characters, an index consisting of one or more roman character strings that follow the kana character string and do not satisfy the kana conversion rules, and conversion candidates corresponding to the index are stored. Storage means;
Kana conversion means for converting the input series of roman characters from the front of the romaji based on kana conversion rules;
Based on the character string converted into the kana conversion unit, the index is searched from the storage unit, and the conversion candidate corresponding to the searched index is extracted from the storage unit;
An information processing apparatus comprising: Roman character conversion means for converting a pre-registered character string into a Roman character string based on a Roman character conversion rule;
Index creating means for creating the index by dividing the Roman character string converted by the Roman character converting means at an arbitrary position from the top, and converting the Roman character string up to the divided position based on a kana conversion rule;
Further comprising
The storage means
The information processing apparatus according to claim 1, wherein the character string registered in advance is stored as a conversion candidate in association with the index created by the index creating unit. The romaji conversion means is:
The information processing apparatus according to claim 2, wherein the input character string is converted into a Roman character string based on a plurality of Roman character conversion rules having different conversion rules. The storage means
The information processing apparatus according to claim 1, wherein the input query is stored as a conversion candidate. A computer conversion candidate extraction method for acquiring an input Roman character string and extracting conversion candidates corresponding to the Roman character string,
The computer converting the input series of Roman characters from the front of the Roman characters based on kana conversion rules;
An index comprising a kana character string consisting of one or more kana characters based on the converted character string, and a roman character string of one or more characters that follows the kana character string and does not satisfy the kana conversion rules Retrieving the index from storage means for storing conversion candidates corresponding to the index, and extracting the conversion candidate corresponding to the searched index from the storage means;
A conversion candidate extraction method comprising: A program that acquires an input Roman character string and extracts conversion candidates corresponding to the Roman character string,
Converting the input series of Roman characters from the front of the Roman characters based on kana conversion rules;
Based on the converted character string, an index consisting of a kana character string consisting of one or more kana characters, and a roman character string of one or more characters that follows the kana character string and does not satisfy the kana conversion rules; Retrieving the index from storage means for storing conversion candidates corresponding to the index, and extracting the conversion candidates corresponding to the searched index from the storage means;
A program that causes a computer to execute.

Images