JP2003271587A - Method for correcting kana for reading for portable telephone - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To reduce the man-hour for correction of a character string of kana for reading by a user by improving the generation of the character string of kana for reading from a name input in the telephone directory of a portable telephone. <P>SOLUTION: This method comprises an easy reading character string separating means 6 for storing a reading character string buffer 3 and determined character string position data buffer 4 matched to each character string determined in a name character string buffer 1 and easily sorting a reading character string corresponding to respective characters of a determined character string. In conformation to the insertion of a new character string to the name character string buffer 1 and the erasing of character therefrom, the insertion and erasing of a reading character string is performed. <P>COPYRIGHT: (C)2003,JPO

Description

Description: BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a telephone number relating to outgoing and incoming calls in a portable telephone device for transmitting and receiving voice and image data using a wireless public line network. Related to the telephone directory that manages the 2. Description of the Related Art Information associated with telephone numbers, such as names, telephone numbers, and group numbers, is registered in a telephone directory. The telephone numbers in the telephone directory are displayed in the order of the Japanese syllabary by name (reverse alphabetical order) or in the order of registration in the memory. To search for a phone number, specify a name or group number. In the case of a search by name, data having a name (or reading) that matches the reading input for the search or data that is close to the reading is displayed. In the case of searching by group number, data (data belonging to the group number) that matches the group number input for searching is displayed. Among them, in the case of searching by name, the character string registered in the telephone directory can be input as a character string containing kanji. Normally, data registered in a telephone directory is sorted according to a certain rule in a character string such as a name. Sorting is performed by comparing character codes corresponding to registered character strings. For example, character codes such as katakana are arranged in alphabetical order.
For this reason, the data is inevitably arranged in the order of the Japanese syllabary by performing the sorting using the character codes. In the search for the telephone number, by looking at the difference between the character code of the search character string and the character code of the search character string in the sorted order, it is possible to determine whether the data matches or is close to the search character string,
By displaying the display order of the search results in the sorting order, the user can easily know whether the character string matches or is close to the target character string. On the other hand, the character codes of Chinese characters are not always arranged in the order of the Japanese syllabary, and are not a general order rule for ordinary users. For this reason, if sorting is performed based on the difference in character code in a character string containing kanji, the user cannot understand the regularity of the display order in the display according to the sorting order, making retrieval difficult. For this reason, when kanji can be input to the name character string in the telephone directory, a character string that does not include kanji is separately prepared for sorting and searching. Usually, a kana character string is prepared as a character string that does not include kanji. Since the hiragana character string is a reading of the name character string, the character string read at the time of inputting the name matches the hiragana character string. For this reason, by concatenating the reading character strings at the time of inputting the name in the input order, the character string is generated as a pseudonym character string. The reading of kanji in names is peculiar to names, and it is not always possible to convert a reading character string into kanji. For this reason, depending on the name, the corresponding kanji is input from a reading different from the reading of the name, the intended kanji is input from the reading of other idioms, etc., or the character code corresponding to the kanji is input. In this case, the phonetic character string generated from the reading character string at the time of name input does not match the phonetic character name of the name intended by the user. For this reason, there is a need to make corrections by the user after generating the kana character string. Actually, after inputting the name, the character string generated based on the name input is confirmed and corrected. In general, the generation of a phonetic character string based on a name input involves concatenating reading character strings input at the time of name input in the order of input. In this generation method, it is possible to generate a kana character string intended by the user when the name input can be converted from the reading of the name to the intended kanji without modification. However, in the above-described generation method, even when characters are deleted or inserted in the middle, only the process of connecting the input read character strings in the order of input is performed. For this reason, even when the erroneous input character is corrected in the name input, the erroneously input reading character string remains without being erased. [0008] Also, in the name input, even when a new character string is inserted between the character strings previously input, the read character string input later is input at the end of the character string. Furthermore, if the total number of characters in the phonetic character string input by correction at the time of name input exceeds the maximum number of characters in the phonetic kana character string buffer, the required phonetic character string input after the character string exceeds the maximum Not entered. For this reason, in the correction of the phonetic character string after the name input, unnecessary reading characters corresponding to the characters deleted in the name input are deleted, and when the maximum number of characters in the reading character string buffer is exceeded, unnecessary characters are unnecessary. You must delete the characters and enter the reading string corresponding to the name string again. [0010] In order to solve the above-mentioned problems, the present invention relates to a portable telephone device provided with a telephone directory for registering a character and a phonetic character of the character in association with each other. When a character registered in the mobile phone device is corrected, the registered phonetic character corresponding to the corrected character is corrected based on the correction of the character. provide. This makes it possible to update the read character string in response to insertion and deletion. Even if the name character string buffer is corrected many times, the read character string is reflected in the form reflecting the last character corrected. A buffer can be obtained, and the number of man-hours for correcting the character string in the read character string buffer by the user is reduced. FIG. 1 is a basic configuration diagram of a pseudonym generation unit according to the present invention. FIG. 2 is a basic configuration diagram of the simplified reading character string separating means of the present invention. FIG. 3 is a diagram for explaining a procedure for generating a phonetic character string according to the present invention. FIG. 4 is a diagram illustrating a procedure for inserting a character string according to the present invention. FIG. 5 is a diagram illustrating a procedure for deleting a character string according to the present invention.
FIG. 6 is a diagram for explaining the procedure in the pseudonym allocation according to the present invention. FIG. 7 is a diagram for explaining the procedure for deleting one character according to the present invention. FIG. 8 is a diagram for explaining a procedure in inserting a character string according to the present invention. In FIG. 1, when the name is input, the read character string is converted and, when the character string is determined by the intended character string, the read character string, the determined character string, and the determined character string are inserted into the name character string buffer 1. The insertion character information 12 including the insertion position is sent to the newly determined character string data generation means 5. The newly determined character string data generating means 5 inserts the determined character string into the insertion position of the name character string buffer 1, secures a read character string buffer 3 and a fixed character string position data buffer 4, Then, data at the end position calculated from the insertion position and the confirmed character string is written. The insertion position of the determined character string in the name character string buffer 1 is inserted into any one of the determined character strings registered in the read character string buffer 3 and the determined character string position data buffer 4 first. In this case, the simplified read character string separating means 6 calculates the front and rear separation positions of the read character string at the insertion position. The fixed character string splitting means 8 newly secures a read character string buffer 3 and a fixed character string position data buffer in accordance with the result of the simple read character string separating means 6.
Data corresponding to one determined character string is generated as data for each of the two determined character strings corresponding to the insertion position. The position data updating means 7 updates the position information of the previously registered fixed character string with the insertion of the fixed character. That is, the position data of the fixed character string existing after the inserted character is shifted backward by the character length of the inserted character string. When erasing one character already determined in the name character string buffer 1, the start position and the end position of the erased character are sent to the character erasure handling unit 9 as erase character information 11. The data of the fixed character string including the position of the erasure character information 11 is read from the fixed character string position data 4,
, A reading character string corresponding to the erased character is calculated. The character erasure corresponding means 9 deletes a read character string corresponding to an erased character from a corresponding read character string buffer in accordance with the result of the simple read character string separation means 6. Further, with the erasure of the erasure character in the name character string buffer, the position data of the determined character string is updated. That is, the position data of the fixed character string after the erased character is shifted forward by the character length of the erased character. This makes it possible to easily insert and delete a read character string in response to the insertion and deletion processing of a fixed character corresponding to the name character string buffer. Based on the position data in the fixed character string data buffer 4, the simplified pseudonym generation means 10 inserts each character string in the read character string buffer 3 into the pseudonym character string buffer 2 in ascending order of position data. As a result, a pseudonym character string corresponding to the name character string in the name character string buffer 1 is generated in the pseudonym character string buffer. In FIG. 2, the read character string number allocating means 17 simply calculates the number of read characters corresponding to each character in the determined character string from the data in the fixed character string position data buffer 13 and the data in the read character string buffer 14. Then, it is inserted into the read character count data buffer 15. The read character string distribution unit 18 distributes the corresponding number of characters from the read character string buffer 14 based on the number of characters in each character of the read character number data buffer 15, and writes the read character string into the distributed read character string data buffer 16. This makes it possible to easily calculate a reading character string corresponding to each character of the confirmed character string from the confirmed character string and the reading character string when inserted into the name character string buffer, and correspondingly, a new character string can be calculated. The read character string can be updated in accordance with the insertion of the column and the deletion of the character string already stored in the name character string buffer. Referring to FIGS. 3, 4, 5, 6, 7, and 8, a procedure for inserting and deleting each character string, generating a read character string, and the like will be described. The character string is described not as a name but as an ordinary sentence. In FIG. 3, for the name character string buffer "Today's weather is good.", The confirmed character string inserted into the name character string buffer is "Today", "Weather is good" and "Good." In the case of, "reading", "tenkiga" and "good" are stored in the reading character string buffer corresponding to each fixed character string, and the fixed character string position data buffer is stored in the name character string buffer. Are stored. In generating the read character string, the character strings in the read character string buffer are written in the order of the start position (or the end position) of the fixed character string position data buffer. In FIG. 4, when an insertion character string “was” is inserted between “today” and “weather” in the name character string buffer, a reading character string corresponding to the determined character string “wa” Allocate a buffer and a fixed character string position data buffer. Since the insertion position of the fixed character string “wa” is position “2” in the name character string buffer, the start position in the fixed character string position data buffer is “2”, and the fixed character string “wa” Since the character length is “2”, the end position is “3”. In the name string buffer, the confirmed character string "weather is" after the insertion position of the confirmed character "wa"
Regarding “Good”, the data in the confirmed character string position data buffer is shifted later by the character length of the confirmed character “wa”. In the generation of the character string in the reading character string buffer, as described above, writing in the order of the start position (or the end position) becomes "Today, the balance is good." In FIG. 5, when the character string "weather is" on the name character string buffer is deleted, the confirmed character string "weather is"
3 characters are deleted from As a result, in the character string after the erased character of the confirmed character string “Weather is”, the data in the confirmed character string position data buffer is updated by the character length to be erased,
That is, the number of characters to be erased is shifted by "3" before. Thus, the end position of the fixed character string “weather” to be deleted is “3”, which is smaller than the start position “4”.
If the start position> end position in the position data of the fixed character string, it is determined that the corresponding fixed character string has been deleted, and the corresponding fixed character string data buffer and read character string buffer are released. As a result, the character string in the reading character string buffer becomes “Today is good.” In addition, the update of the position data accompanying the erasing is performed when the starting position> the erasing position,
If the data at the start position is updated at the end position ≥ erase position,
The data at the end position is updated. In FIG. 6, the character string "Kyowa," in the reading character string buffer corresponding to the fixed character string "Kyou wa," is sorted. In the reading character number distribution means, the characters of the reading character string buffer are assigned to each character of the confirmed character string from the first character. When the last character of the final character string has been reached, it is assigned from the first character. As a result, the reading character count data buffer becomes “2111”, and the determined character string “today is” has “2” characters for “now”, “1” for “day”, “1” for “ha”, "1" is assigned to ",". Based on this, the reading character string sorting means,
Sort the reading characters for each fixed character,
"U" is assigned to "day", "ha" is assigned to "ha", and "," is assigned to ",". In FIG. 7, when "ha" is deleted from the fixed character string "today,""ha" is added to the fixed character string.
Is erased and becomes "Today." In the reading character string "Kyowa," the reading character string is separated by the simplified reading character string separating means in correspondence with the determined character. As described above, the reading character "ha" corresponds to the fixed character "ha", the reading character "ha" is deleted by erasing the fixed character "ha", and the reading character string corresponding to the fixed character string "today," is " Today, it becomes. In FIG. 8, a new confirmed character "Umaga" is inserted into the confirmed character string "Today is". The insertion position is to be inserted between the fixed character strings “today” and “wa”. By the simplified reading character string separating means, the reading character string is "Kyo" as described above corresponding to the fixed character strings "today" and "ha,"
And "ha," are separated, and the determined character string "today is" is separated into "today" and "ha," by the determined character string bisecting means and stored in the read character string buffer and the determined character string position data buffer. Is done. The new fixed character string “Amaga” is inserted between two fixed character strings after being inserted into the fixed character string. The data in the fixed character string position data buffer corresponding to the fixed character string is updated by the position data updating means, and the read character string buffer for the name character string "". As described above with reference to FIGS. 3 to 8, by simply assigning the reading character string to each character of the fixed character string, it becomes possible to update the reading character string in response to insertion and deletion. . As a result, even if the name character string buffer is corrected many times, it is possible to obtain a read character string buffer in a manner that reflects the last character corrected. The man-hour for correcting the character string in the read character string buffer by the user is reduced. As described above, according to the present invention, it is possible to update a read character string corresponding to insertion and deletion by simply assigning a read character string to each character of a fixed character string. Even if the name string buffer is modified many times, it is possible to obtain the reading string buffer with the last character of the modification prosperous. Will decrease.

BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 is a basic configuration diagram of a phonetic phonetic pseudonym generation unit of a portable telephone device of the present invention. FIG. 2 is a diagram illustrating a basic configuration of a simplified reading character string separating unit according to the present invention. FIG. 3 is a view for explaining a kana character string generation procedure of the present invention. FIG. 4 is a diagram illustrating a procedure for inserting a character string according to the present invention. FIG. 5 is a diagram illustrating a procedure in deleting a character string according to the present invention. FIG. 6 is a view for explaining a procedure in the pseudonym allocation according to the present invention. FIG. 7 is a view for explaining a procedure in deleting one character according to the present invention. FIG. 8 is a view for explaining a procedure in inserting a character string according to the present invention. [Description of Signs] 1 Name character string buffer 2 Shakukana character string buffer 3 Reading character string buffer 4 Fixed character string position data buffer 5 New fixed character string data generating means 6 Simple reading character string separating means 7 Position data updating means 8 Appraisal Character string splitting means 9 Character string erasure responding means 10 Shakugana generating means 11 Erase character information 12 Insert character information 13 Fixed character string position data buffer 14 Reading character string buffer 15 Reading character string number data buffer 16 Sorting reading character string data buffer 17 Reading character string number distribution means 18 Reading character string distribution means

Claims (1)

Claims: 1. A portable telephone device having a telephone directory for registering a character and a phonetic character of the character in association with each other, wherein when a character registered in the telephone directory is corrected, A method of correcting a phonetic character of a portable telephone device, wherein a registered phonetic character corresponding to the corrected character is corrected based on the correction of the character.