JP4200085B2 - Reading kana retrieval device, portable terminal, recording medium, and program - Google Patents

Description

  The present invention relates to a reading-kana retrieval apparatus, a portable terminal, a recording medium, and a program suitable for application to, for example, a cellular phone.

  Recent mobile phones have a mail transmission / reception function and an Internet connection function, and the text data is often acquired from the outside by receiving a mail or accessing a Web site.

  Some of these text data may contain kanji whose reading is not known to the user. In the case of trying to check the reading kana of such kanji, in the conventional mobile phone, the user converts the input kana character to kanji used in the kana-kanji conversion dictionary (e-mail creation etc.) installed in the mobile phone. The only way to do this is to input the predicted reading kana using the dictionary and to see if it will be converted to the kanji.

Also, as a conventional telephone, the name of the received kanji in the sender information is converted into kana characters using a kanji kana conversion dictionary (a dictionary for converting kanji into kana characters) and displayed on the display unit. What has been proposed is also proposed (for example, see Patent Document 1).
JP 2002-209012 (paragraph numbers 0037 and 0055, FIGS. 1 and 2)

  However, the conventional method of inputting a predicted kana is cumbersome and the kana cannot be confirmed for a kanji character that cannot be predicted at all.

  Moreover, since the telephone of the above-mentioned patent document 1 needs to use a kanji-kana conversion dictionary, if it is to be applied to a mobile phone, both a kana-kanji conversion dictionary and a kanji-kana conversion dictionary must be installed. , Memory usage will increase.

  In view of the above points, the present invention makes it easy for a user to read a kana reading of kanji in text data obtained from outside without using a dictionary for converting kanji into kana characters in various devices such as mobile phones. It was made as an issue to make it possible to confirm.

To solve this problem, pseudonym search device read according to the present invention, transformed using the input operation unit for inputting kana characters, the dictionary data inputted kana characters in the input operation means The conversion means , the memory storing the list for reading the kana based on the dictionary data, the acquiring means for acquiring the text data from the outside, and the word for searching for the reading kana from the text data acquired by the acquiring means A selection operation means for selecting; a search means for searching for a reading of the word selected by the selection operation means using the reading list for reading of the reading; and a display means for displaying a search result of the search means equipped with, the retrieval means, the selected word completely after the prefix match search of whether to match the same number of characters of kanji leading portion of the Chinese character for this kana reading search list And performing致search.

In pseudonym search apparatus reads not only kana characters input by the input operation unit is transformed using dictionary data (dictionary data to convert the kana characters into kanji and symbols), the text acquired from the outside word of reading pseudonym of the search target that has been selected by the selection operation means from the data, Ru is searched using a reading kana search for the list based on this same dictionary data. In this search, first, a forward match search is performed to determine whether or not the selected word matches the same number of kanji characters at the beginning of the kanji characters in the reading kana search list, and then a complete match search is performed. . Then, the search result is displayed.

  Therefore, if there is a kanji or symbol for which the reading kana is not known in the text data obtained from the outside (for example, the text of the received mail), the user can simply select the kanji or symbol and simply select it. You can check the reading.

In addition, since a kana search is performed using a kana search list based on dictionary data provided in advance to convert kana characters input by the input operation means, kanji and symbols are converted to kana characters. There is no need to use the dictionary data.

As an example, in this reading device, the search means performs the forward match search and the complete match search as described above, and when the range of the word selected by the selection operation means widens, the forward match search is performed. It is preferable to perform a search using the result.

Thus, after an operation for selecting a certain word as a search target is performed, and an operation for selecting a wider range of words including the word as a search target is performed, the reading list for kana is used. The search can be efficiently performed using the original search result without re-starting the search from the beginning.

Next, the portable terminal according to the present invention includes an input operation unit for inputting kana characters, conversion means for converting by using the dictionary data inputted kana characters in the input operation means, the dictionary data A memory storing a list for reading a kana based on the text, an acquisition means for acquiring text data from the outside, and a selection operation means for selecting a word for searching for a reading kana from the text data acquired by the acquisition means And a search means for searching for the reading of the word selected by the selection operation means using the reading list for reading the kana, and a display means for displaying the search result of the search means. the selected word, be characterized in that a complete match search after forward matching search whether match the same number of characters kanji leading portion of the Chinese character for this kana reading search list .

  According to this portable terminal, text data acquired from the outside without using a dictionary for converting kanji and symbols into kana characters in exactly the same manner as described for the reading kana retrieval device according to the present invention described above. Users can easily check the readings of kanji and symbols inside.

Then, the recording medium according to the present invention, a computer, based on the word to search for kana reading from the text data acquired from the outside is selected, the kana of the selected word, the kana character A means for performing a search using a reading kana search list based on dictionary data of a corresponding conversion word , wherein the selected word is a kanji having the same number of characters at the beginning of the kanji in the reading kana search list a search unit for performing exact search after forward matching search whether matching, and characterized by storing a program for functioning as a display means for displaying the search result of the search means.

  If the program stored in this recording medium is executed by a computer in various devices such as a mobile phone equipped with dictionary data for converting kana characters input by the input operation means into kanji and symbols, the above-mentioned application Exactly the same as described for the reading device for reading kana according to the invention, the user can read the reading kana of kanji and symbols in the text data obtained from outside without using a dictionary for converting kanji and symbols to kana characters. Can be easily confirmed.

Then, the program according to the present invention, a computer, based on the word to search for kana reading from the text data acquired from the outside is selected, the kana of the selected word, corresponding to the kana character Means for searching using a kana search list based on dictionary data of conversion words to be selected, and the selected word matches the kanji of the same number of characters at the beginning of the kanji in this kana search list and whether a search means for performing exact search after prefix matching or, characterized in that to function as a display means for displaying the search result of the search means.

  If this program is executed by a computer in various devices such as a mobile phone equipped with dictionary data for converting kana characters input by the input operation means into kanji and symbols, the above-mentioned reading kana according to the present invention will be described. Exactly the same as described for the search device, the user can easily check the reading kana of kanji and symbols in text data obtained from outside without using a dictionary for converting kanji and symbols to kana characters. be able to.

  According to the present invention, in various devices such as a mobile phone, a user can easily read kana characters and symbols in text data acquired from the outside without using a dictionary for converting kanji characters and symbols into kana characters. The effect that it can confirm is acquired.

In addition, after an operation for selecting a certain word as a search target is performed, an operation for selecting a wider range of words including the word as a search target is performed using the reading list for reading. Thus, it is possible to efficiently perform a search using the original search result without re-starting the search.

  Hereinafter, an example in which the present invention is applied to a mobile phone will be specifically described with reference to the drawings. FIG. 1 is a front view showing an appearance of a mobile phone according to the present invention.

  On the front face of the cellular phone 1, there are an LCD 2, a mail key 3, a left key 4, a jog dial 5, a right key 6, an Internet connection key 7, a start key (a key for performing a response at the time of outgoing and incoming calls) 8, a clear key 9, An end key 10, other key groups (such as numeric keys) 11, a speaker 12, and a microphone (not shown in the figure) are also provided.

  The jog dial 5 can perform operations for selecting various modes from the submenu. These modes include a “reading kana search mode” to be described later.

  Although not shown, a mobile antenna is housed on the upper surface of the mobile phone 1. Further, a CCD camera is provided on the back surface of the mobile phone 1, although not shown.

  FIG. 2 shows a circuit configuration of the mobile phone 1. A control unit 21, a communication processing unit 22, an LCD drive unit 23 (a circuit for driving the LCD 2 in FIG. 1), an operation unit 24 (the jog dial 5 and each key in FIG. 1), a camera unit 25 (a CCD camera and its Control circuit) and memory 26 are connected to the control line 27, and the communication processing unit 22, speaker 12 (FIG. 1), microphone 13, LCD drive unit 23, camera unit 25, and memory 26 are also connected to the data line 28. It is connected.

  At the time of transmission, text data input by the operation of the operation unit 24 and data from the microphone 13, the camera unit 25, and the memory 26 are sent to the communication processing unit 22 and encoded / controlled under the control of the control unit 21. Modulated and up-converted and transmitted from the antenna 29 (the aforementioned movable antenna).

  On the other hand, at the time of reception, data received by the antenna 29 is down-converted / demodulated / decoded by the communication processing unit 22 under the control of the control unit 21 and sent to the speaker 12 and the LCD driving unit 23.

  The memory 26 stores data of a kana-kanji conversion dictionary (a dictionary for converting input kana characters into kanji and symbols used for creating e-mails and the like).

  The memory 26 also stores a “reading kana search list” created using the kana-kanji conversion dictionary data. The “reading kana search list” is a list in which kanji characters (including feed kana) are associated with reading kana for each word in the kana-kanji conversion dictionary data. FIG. 3 is a diagram partially showing the contents of the reading-kana search list. List No. As 1, the Chinese character “one” and its reading “one” are stored. List No. 2, the Chinese character “one” and its reading “1” are stored. List No. 3, the Chinese character “Ichiban” and its reading kana “Ichiban” are stored.

  List No. 4, the Chinese character “one paragraph” and its reading “Ichidanraku” are stored. List No. 5, the kanji character “one step” and its reading kana “ichidanto” are stored. List No. 6, the Chinese character “all” and its reading “Idodo” are stored.

  In this way, after the kanji character starting with “one” continues, the list No. As n, the Chinese character “position” and its reading “a” are stored.

  The memory 26 does not store data of the input kanji kana conversion dictionary (dictionary for converting kanji into kana characters).

  FIG. 4 is based on the fact that the above-mentioned “reading kana search mode” is selected by operating the jog dial 5 (FIG. 1) while receiving mail or accessing a Web site with the mobile phone 1. It is a flowchart which shows the reading kana search process which a control part (FIG. 2) performs.

  In this process, whether or not the range of the focused word in the text data displayed on the LCD 2 includes the focused word at the beginning and extends to a wider range. (Step S1), and in other cases, whether or not the range of the focused word in the text data displayed on the LCD 2 has changed (step S2) Is repeated until the determination of whether or not the end key 10 (FIG. 1) is pressed (step S3) becomes YES in any step.

  If “YES” in the step S2, the routine proceeds to a “search from the reading kana search list” routine (step S4). FIG. 5 is a flowchart of the “search from the reading list for reading”. First, in the memory 26 (FIG. 2), “No. 1 list is set as a search target (step S11).

  Subsequently, the set No. Referring to the list of, the prefix match search for the focused word (whether the focused word matches the same number of Kanji characters at the beginning of the Kanji characters of the set No. list) Search) (step S12).

  Then, it is determined whether or not there is a forward match (step S13). If there is no coincidence in front, No. not yet searched in the “Yomikana search list”. It is determined whether there is a list (step S14). If yes, then the younger No. Is set as a search target (step S15), and step S12 and subsequent steps are repeated.

  On the other hand, if there is a forward match, the No. Referring to the list of, the exact search for the focused word (whether or not the focused word matches the kanji in the list of the set No. completely except for the kana Search) is performed (step S16).

  Then, it is determined whether or not they completely match (step S17). If there is a perfect match, the No. Are temporarily stored in the memory 26 as candidate reading kana candidates for display (step S18). Then, the process proceeds to step S14.

  On the other hand, if they do not match completely (if they only match forward), the No. Is stored in the memory 26 as a “next search candidate list” which is a list to be referred to when the focused word range is expanded next time (step S19). Then, the process proceeds to step S14.

  If the answer is no in step S14 (the search is completed up to the last No. list in the “reading kana search list”), the display target reading kana candidates temporarily stored in step S18 are shown in FIG. 6, for example. Thus, the screen is divided and displayed on the LCD 2 together with the currently displayed text data. In addition, the “next search candidate list” stored in the memory 26 (the kanji is matched forward) No. If there is a list, a mark or wording indicating that candidates can still exist even if the range of the focused word is expanded is also displayed on the LCD 2 (step S20). And it returns and returns to step S1 of FIG.

  If the answer is YES in step S1 in FIG. 4, the routine proceeds to the “search from the next search candidate list” routine (step S5). FIG. 7 is a flowchart of this “search from the next search candidate list” routine. First, the youngest No. in the “next search candidate list” in the memory 26 is displayed. Are set as search targets (step S31).

  When the “next search candidate list” here is moved to the “search from the next search candidate list” routine for the first time, the step of the “search from the reading list for reading” routine of FIG. The “next search candidate list” stored in the memory 26 in S19. If the “search from the next search candidate list” routine has already been performed once or more, the “next search candidate list” is immediately preceded. The “next search candidate list” stored in the memory 26 in step S39 to be described later of the “search for” routine.

  Subsequently, the set No. Referring to the list of, the prefix match search for the focused word (whether the focused word matches the same number of Kanji characters at the beginning of the Kanji characters of the set No. list) Search) (step S32).

  Then, it is determined whether or not there is a forward match (step S33). If there is no forward match, No. that has not yet been referenced in the “next search candidate list”. It is determined whether there is a list (step S34). If yes, the next youngest No. in the “next search candidate list” is displayed. Are set as search targets (step S35), and step S32 and subsequent steps are repeated.

  On the other hand, if there is a forward match, the No. Referring to the list of, the exact search for the focused word (whether or not the focused word matches the kanji in the list of the set No. completely except for the kana Search) is performed (step S36).

  Then, it is determined whether or not they completely match (step S37). If there is a perfect match, the No. Are temporarily stored in the memory 26 as candidate reading kana to be displayed (step S38). Then, the process proceeds to step S34.

  On the other hand, if they do not match completely (if they only match forward), the No. Is stored in the memory 26 as a “next search candidate list” which is a list to be referred to when the focused word range is expanded next time (step S39). Then, the process proceeds to step S34.

  If the answer is no in step S34 (the search is completed up to the last No. list in the “next search candidate list”), the display target candidate for reading temporarily stored in step S38 is displayed so far. Instead of the reading kana candidates, they are displayed on the LCD 2 as shown in FIG. In addition, the “next search candidate list” stored in the memory 26 (the kanji is matched forward) No. If there is a list, a mark or wording indicating that candidates can still exist even if the range of the focused word is expanded is also displayed on the LCD 2 (step S40). And it returns and returns to step S1 of FIG. If the answer is yes in step S3 of FIG. 4, the process is terminated.

  Next, a state in which a user who receives mail or accesses a Web site with the mobile phone 1 confirms a kana reading kana in the text data displayed on the LCD 2 will be described.

  For example, as shown in FIG. 8A, since the user did not know the kana reading of the kanji character “one paragraph” in the text data displayed on the LCD 2, the “yomi kana search mode” is operated by operating the jog dial 5 (FIG. 1). First, it is assumed that “one” of the “one paragraph” is focused by the cursor moving operation or the like with the left key 4 or the right key 6 (FIG. 1). Are enclosed in a square box).

  Then, the processing of FIG. 4 is started, and a new focus is given to a word that has not been focused until then. In step S2, the answer is yes and the “search from reading list for reading” routine (FIG. 4). Go to 5). A search is performed with reference to the “reading kana search list” (FIG. 3) for the focused Chinese character “one”.

  FIG. 10 shows the search results for each No. of “Reading Kana Search List” in FIG. It is a figure shown corresponding to this list. List No. 1 kanji “1” and list no. The Chinese character “1” of 2 is completely identical (yes in step S17 in FIG. 5).

  List No. No. 3 kanji “Ichiban” and list no. 4 kanji “one paragraph” and list no. No. 5 kanji “one step” and list no. The six kanji characters “all” are not completely matched but matched forward (No in step S17 of FIG. 5).

  In addition, the list No. The k character “position” of n does not match forward (No in step S13 in FIG. 5).

  Therefore, at this time, as shown in FIG. 8B, “1” and “1” are displayed on the LCD 2 as candidates for reading, and there are still candidates even if the range of characters to be focused is expanded. A mark or wording (here, “→” mark) is displayed. At this time, the No. 3 or No. 4 or No. 5 or No. The list of 6 is stored as the “next search candidate list”.

  Next, the user sees this mark “→” and, as shown in FIG. 8C, the range to be focused by the cursor movement operation with the left key 4 or the right key 6, etc. Suppose that it expands to “one step”.

  Then, in the process of FIG. 4, the routine proceeds to the “search from the next search candidate list” routine (FIG. 7), and the focused Chinese character “one step” is the No. shown in FIG. 3 or No. 4 or No. 5 or No. The search is performed with reference to the “next search candidate list” in which the list of 6 is stored. FIG. 11 is a diagram showing the search result.

  List No. The Chinese character “Ichiban” of No. 3 does not match forward (No in step S33 in FIG. 7). List No. The Chinese character “one paragraph” of 4 is not completely matched but is matched forward (No in step S37 of FIG. 7).

  List No. The five kanji characters “one step” are completely matched (yes in step S37 in FIG. 7). List No. The 6 kanji characters “all” are not completely matched but are matched forward.

  Therefore, at this time, as shown in FIG. 8D, “Idori” is displayed on the LCD 2 as a candidate for reading, and a mark “indicating that a candidate can still exist even if the range of characters to be focused on is expanded. → ”is displayed. At this time, the No. 4 is stored as the “next search candidate list”.

  Next, the user sees this mark “→”, and as shown in FIG. 9A, the range to be focused is expanded to the entire “one paragraph” by a cursor movement operation with the left key 4 or the right key 6 as shown in FIG. 9A. Suppose.

  Then, the range of the focused word has expanded to a wider range including the focused word at the beginning, so in the process of FIG. The routine proceeds to the “search from next search candidate list” routine (FIG. 7). For the Chinese character “one step” in focus, No. 1 shown in FIG. The search is performed with reference to the “next search candidate list” in which the list of 4 is stored.

  FIG. 12 is a diagram showing the search result. List No. The 4 kanji “one paragraph” is completely matched (yes in step S37 in FIG. 7).

  Therefore, at this time, as shown in FIG. 9B, “Ichidanraku” is displayed on the LCD 2 as a candidate for reading. Also, at this time, No. that did not match completely but matched forward. Since there is no list, the mark “→” indicating that candidates can still exist is not displayed even if the range of characters to be focused is expanded.

  By viewing this display, the user can know that the reading of the Chinese character “one paragraph” is “Ichidanraku”.

  As described above, when there is a kanji whose reading kana is not known in the text data acquired from the mobile phone 1 from the outside, the user selects the kanji (focuses on the kanji displayed on the LCD 2). Just by performing an operation, you can easily check the reading.

  In addition, since the kana / kanji conversion dictionary data preliminarily installed in the cellular phone 1 is used for e-mail creation and the like, the kana / kana conversion dictionary data is used. (There is no need to store data in the memory 26).

  Furthermore, a forward match search and an exact match search are performed, and when the range of the selected word is expanded, a search is performed using the result of the forward match search (“next search candidate list”). After the operation to select as a target, when the operation to select a wider range of words including the word is performed, the original search result is used without performing the search again from the beginning. And can search efficiently.

  Also, if exact match search with all words in the data of the kana-kanji conversion dictionary is performed for the selected kanji, the search process will take a long time. Only complete match search is performed (steps S12 and S16 in FIG. 5 and steps S32 and S36 in FIG. 7).

  By the way, in the processing of FIG. 4 described above, even when the range of the focused word changes to a narrower range including the word that has already been focused at the beginning, the answer is YES in step S2. Therefore, in the same way as when a new focus is applied to a word that has not been focused until then, the “search from the list for reading the kana” (FIG. 5) is used to perform "No. list" (FIG. 3). The search is performed again using the list.

  However, as a modified example, if the focused word range changes to a narrower range that includes the focused word at the beginning, the previous search results are used. Then, the reading kana candidates may be displayed. Hereinafter, a modified example for that will be described.

  In this modified example, each “No.” in the “Reading Kana Search List” shown in FIG. As shown in FIG. A field for writing the number of characters of the word that has been focused when the kanji in the list of characters matches the front (the number of characters that match the front), and its No. A field for writing the number of characters of the focused word when the kanji characters in the list are completely matched (completely matched character number column) is provided. In this column, all 0s are initially written.

  Also, instead of the reading process of kana shown in FIG. 4, the reading process of kana shown in FIG. 14 is executed (in this process, the same step number is assigned to the part that performs the same processing as in FIG. 4). ing). In this process, first, the “number of searched characters” is set to 0 (step S101), and then the range of the focused word in the text data displayed on the LCD 2 has changed. The determination of whether or not (step S102) and the determination of whether or not the end key 10 has been operated (step S3) are repeated until the answer is YES in any step.

  If the answer is yes in step S102, it is determined whether or not the “number of searched characters” is larger than the number of characters of the currently focused word (step S103). If no, it is determined whether or not the number of characters of the currently focused word is 1 (step S104). If yes, the routine proceeds to the “search from reading list for kana” routine (step S105).

  FIG. 15 is a flowchart of this “search from the reading list for kana” routine, and the same steps are performed for the parts that perform the same processing as the “search from the list for reading the kana” shown in FIG. It is numbered.

  In this process, when there is a complete match in step S17, the number of characters of the currently focused word is set to No. set in the “Yomikana search list”. Are written in the complete match character number field and the forward match character number field (FIG. 12) (step S201). Then, the process proceeds to step S14.

  Further, when the word does not completely match in step S17 (only when it matches forward), the number of characters of the currently focused word is set to No. set in the “reading kana search list”. Are written only in the forward matching character number field of the list (step S202). Then, the process proceeds to step S14.

  If no in step S14, the process returns after step S20. The rest of the processing is the same as the processing in FIG.

  If “NO” in the step S104 in FIG. 14, the process proceeds to a “search using the front matching character number column” routine (step S106). FIG. 16 is a flowchart of this “search using the number of characters that match the front” routine. The same steps are performed in the part that performs the same processing as the “search from the next search candidate list” routine shown in FIG. It is numbered.

  In this process, instead of the process of step S31 of FIG. 7, the number of characters one less than the number of characters of the currently focused word in the “reading kana search list” (FIG. 12) is The youngest No. written in Are set as search targets (step S301).

  Further, in place of the process of step S34 in FIG. 7, the number of characters one less than the number of characters of the currently focused word is written in the front matching character number column. Is still in the “reading kana search list” (step S302). If yes, instead of the process of step S35 in FIG. 7, the number of characters one less than the number of characters of the currently focused word is written in the forward matching character number column, the next younger No. Are set as search targets (step S303), and step S32 and subsequent steps are repeated.

  Also, if there is a perfect match in step S37, after step S38, the number of characters of the currently focused word is set to No. set in the “Reading Kana Search List”. Are written in the complete match character number field and the forward match character number field of the list (step S304). Then, the process proceeds to step S302.

  Further, when the word does not completely match in step S37 (only when it matches forward), the number of characters of the currently focused word is set to No. set in the “reading kana search list”. Is written only in the forward matching character number field of the list (step S305). Then, the process proceeds to step S302.

  If no in step S302, the process returns after step S40. The rest of the processing is the same as the “search from the next search candidate list” routine of FIG.

  In FIG. 14, when returning from the “search from the reading list for kana” routine (step S105) or the “search using the number of front matching characters” routine (step S106), the “number of searched characters” is incremented by one. (Step S107), the process returns to Step S102.

  If “YES” is determined in the step S103, the number of characters of the currently focused word is written in the exact match character number column with reference to the “reading kana search list”. Are displayed on the LCD 2 as shown in FIG. 5 in place of the candidate reading characters displayed so far. In the “Yomikana search list”, the number of characters of the currently focused word is written in the front matching character number column. If there is a list, a mark or wording indicating that candidates can still exist even if the range of the focused word is expanded is also displayed on the LCD 2 (step S108). Then, the process returns to step S102.

  Next, in this modified example, the number of characters to be written in the exact matching character number field and the forward matching character number field of the “reading kana search list” is set by the user as “one”, “one step” as shown in FIGS. After expanding the focus range such as “,“ one paragraph ”, the state when the focus range is narrowed again from“ one paragraph ”to“ one step ”will be described.

  When only “one” is focused, a “search from the reading list for kana” search routine shown in FIG. 1 (kanji “one”) to list No. The number of characters in the forward matching character number field of each list up to 6 (kanji “all”) is updated to 1, and the list No. 1 (kanji “one”) and list no. The number of characters in the exact match character number field of 2 (kanji “one”) is updated to 1.

  Further, by the “search from the reading kana search list” routine, the reading kana candidates “one” and “one” and the mark “→” are displayed on the LCD 2 in the same manner as shown in FIG. 8D. Further, the “number of searched characters” is set to 1 (step S107 in FIG. 14).

  Next, when the range to be focused is expanded to “one step”, the “search using the front matching character number field” routine shown in FIG. 16 causes the number of characters 1 to be added to the front matching character number field in the “reading kana character search list”. No. which is the written list. 1 to No. A search is performed with reference to the list up to six.

  Then, as shown in FIG. 4 (kanji “one paragraph”) and list no. The number of characters in the front matching character number field of 5 (kanji “one step”) is updated to 2, and list No. The number of characters in the exact match character number field of 5 is updated to 2.

  In addition, by this “search using the number of front matching characters” routine, the reading pseudonym candidates ““ Idanto ”and the mark“ → ”are displayed on the LCD 2 in the same manner as shown in FIG. “Number of searched characters” is set to 2 (step S107 in FIG. 14).

  Next, when the range to be focused is expanded to “one paragraph”, the number of characters 2 is written in the front matching character number field in the “reading kana search list” by the “search using the front matching character number field” routine of FIG. No. 4 and no. The search is performed with reference to the list of 6.

  Then, as shown in FIG. The number of characters in the front matching character number field and the exact matching character number field of 4 (kanji “one paragraph”) is updated to 3, respectively.

  Further, by this “search using the number of characters that match the front” field, the reading candidate ““ Ichidanraku ”is displayed on the LCD 2 in the same manner as shown in FIG. Is set to 3 (step S107 in FIG. 14).

  Next, when the focused range is narrowed again to “one step”, the process proceeds from step S103 to step S108 in FIG. 14, and the number of characters 2 is written in the exact match character number column with reference to the “reading kana search list”. No. which is the list The candidate reading kana “Ichidanto” in the list of 5 is displayed on the LCD 2 together with the mark “→”.

  Thus, in this modified example, when the range of the focused word changes to a narrower range including the focused word at the beginning, the “reading kana search list” "No." A candidate for reading is displayed using the previous search result (the number of characters written in the complete matching character number field of the “reading kana search list”) without searching again using this list. Therefore, in such a case, candidate readings can be displayed efficiently.

  In the above example, the description has been made on the assumption that the kana only kana is searched. However, if the dictionary pre-installed in the mobile phone 1 converts not only kanji characters but also symbols (such as mathematical units and Greek characters), about those symbols. Alternatively, a “reading kana search list” as shown in FIG. 3 may be created, and the reading kana of the symbol may also be searched based on the focus on the symbol displayed on the LCD 2.

  Also, in the above example, the candidate reading candidate for the focused word is displayed on the LCD 2 along with the currently displayed text data by dividing the screen as shown in FIGS. Yes. However, for example, when a mail is received, when the reading kana is finally confirmed (in the example of FIG. 8, a search result “Ichidanraku” is obtained), the reading kana is placed in the body of the mail. The word “one paragraph” may be displayed in the form of ruby.

  Further, when the reading kana is finally determined, the reading kana data is stored in the memory 26, and when the same kanji is displayed on the LCD 2 next time, the reading kana is automatically displayed on the LCD 2. You may make it do.

  In addition, the processing program of FIG. 4 and FIG. 14 in the above example may not only be stored in the mobile phone 1 in advance, but also provided on the website and downloaded to the mobile phone 1. Good. In the case of a mobile phone into which a small memory card can be inserted, this program may be stored in the small memory card.

  In the above example, the present invention is applied to a mobile phone. However, the present invention is not limited to this, and is a mobile terminal other than the mobile phone (for example, a PDA) and other devices, which are input by input operation means. The present invention may also be applied to those equipped with dictionary data for converting kana characters into kanji or symbols.

It is a front view which shows the external appearance of the mobile telephone by this invention. FIG. 2 is a block diagram illustrating a circuit configuration of the mobile phone in FIG. 1. FIG. 3 is a diagram showing a “reading kana search list” stored in the memory of FIG. 2. It is a flowchart which shows the reading kana search process which the control part of FIG. 2 performs. FIG. 5 is a flowchart of a “search from a reading kana search list” routine of FIG. 4. FIG. It is a figure which shows the display mode of a reading kana candidate. 5 is a flowchart of a “search from the next search candidate list” routine of FIG. It is a figure which shows the example of a display of a reading kana candidate. It is a figure which shows the example of a display of a reading kana candidate. It is a figure which illustrates a search result. It is a figure which illustrates a search result. It is a figure which illustrates a search result. It is a figure which shows the example of a change of the "reading kana search list". It is a flowchart which shows the example of a change of a reading kana search process. FIG. 15 is a flowchart of a “search from a reading kana search list” routine of FIG. 14. FIG. FIG. 15 is a flowchart of a “search using a front matching character number column” routine of FIG. 14. It is a figure which illustrates the number of characters written in the number field of front matching characters, and the number of exact matching characters column. It is a figure which illustrates the number of characters written in the number field of front matching characters, and the number of exact matching characters column. It is a figure which illustrates the number of characters written in the number field of front matching characters, and the number of exact matching characters column.

Explanation of symbols

1 Mobile phone 2 LCD
5 Jog dial 10 End key 21 Control unit 22 Communication processing unit 26 Memory

Claims (8)

And an input operation means for inputting the provisional name characters,
Conversion means for converting by using the dictionary data inputted kana characters in the input operation means,
A memory storing a kana search list based on the dictionary data;
An acquisition means for acquiring text data from outside;
A selection operation means for selecting a word for searching for a reading character from the text data obtained by the obtaining means;
Search means for searching for a reading of the word selected by the selection operation means using the reading list for reading of the reading ;
Display means for displaying a search result of the search means ,
The search means performs a complete match search after a forward match search as to whether or not the selected word matches the same number of kanji characters at the beginning of the kanji characters in the kana search list. Reading device for reading kana. In the reading kana search device according to claim 1,
The search unit performs the prefix search and exact search, when the spread range of the selected word in the selection operating means, reading, characterized in that a search is performed using the results of the prefix match search Kana search device. And an input operation means for inputting the provisional name characters,
Conversion means for converting by using the dictionary data inputted kana characters in the input operation means,
A memory storing a kana search list based on the dictionary data;
An acquisition means for acquiring text data from outside;
A selection operation means for selecting a word for searching for a reading character from the text data obtained by the obtaining means;
Search means for searching for a reading of the word selected by the selection operation means using the reading list for reading of the reading ;
Display means for displaying a search result of the search means ,
The search means performs a complete match search after a forward match search as to whether or not the selected word matches the same number of kanji characters at the beginning of the kanji characters in the kana search list. Mobile terminal. The mobile terminal according to claim 3,
The search unit performs the prefix search and exact search, when the spread range of the selected word in the selection operation unit, and performs a search using the results of the prefix match search mobile Terminal. The computer,
Based on the fact that a word for which a kana character is to be searched is selected from text data acquired from outside, the kana character of the selected word is used for reading a kana character based on the dictionary data of the conversion word corresponding to the kana character . A means for searching using a list , wherein the selected word is a complete match after a forward match search for whether or not the selected kana matches a kanji of the same number of characters at the beginning of the kanji in the kana search list A search means for performing a search ;
Display means for displaying the search results of the searching means
A recording medium that stores a program for functioning . The recording medium according to claim 5,
The search unit performs the prefix search and exact search, when the spread range of the selected word, recording medium, characterized in that a search is performed using the results of the prefix match search. The computer,
Based on the fact that a word for which a kana character is to be searched is selected from text data acquired from outside, the kana character of the selected word is used for reading a kana character based on the dictionary data of the conversion word corresponding to the kana character . A means for searching using a list , wherein the selected word is a complete match after a forward match search for whether or not the selected kana matches a kanji of the same number of characters at the beginning of the kanji in the kana search list A search means for performing a search ;
Display means for displaying the search results of the searching means
Program to make it function . The program according to claim 7,
The search means performs a forward match search and an exact match search, and performs a search using the result of the forward match search when the range of the selected word is expanded.

Images