JP2004139402A - Character string conversion device, historical information creating method and preferred output candidate determining program - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To allow users unfamiliar with postal code input functions to easily input addresses. <P>SOLUTION: A postal code dictionary of a dictionary part 26b stores reading and notation for every postal code. When a certain postal code exists in a determined string buffer 27a, the reading and notation for the postal code are stored in an expansion history buffer 27c. Thus, a postal code "770-8051", e.g., is input and determined as it is, and then the reading "Tokusima Prefecture" of the address "Okihama, Tokusima City in Tokusima Prefecture" coordinated with the postal code is input to the midway, whereby "Okihama, Tokusima City in Tokusima Prefecture" can be reported as an input saved conversion candidate. <P>COPYRIGHT: (C)2004,JPO

Description

[0001]
TECHNICAL FIELD OF THE INVENTION
The present invention relates to a character string conversion device, and more particularly, to generation of history information.
[0002]
[Prior art]
The applicant has already stored the input character string and the converted character string together as a history, and if the input character string exceeds a predetermined matching degree, the input character string does not completely match the input character string. An application has been filed for a method of displaying a reduced input candidate in which is displayed as a conversion candidate (see Patent Document 1). For example, when "Tokushimaken and Kushimashioki no Hamacho" is input from the keyboard and the conversion key is pressed to convert "Okihama-cho, Tokushima City, Tokushima Prefecture", these combinations are stored in the history buffer. Then, when "Tokushimake" is input, "Okihama Town, Tokushima City, Tokushima Prefecture" is displayed on the screen as a candidate for input-saving conversion.
[0003]
[Patent Document 1]
JP-A-12-123006 (FIG. 16)
[0004]
Currently, a kana-kanji conversion method is known in which a seven-digit display of a postal code is introduced, and when a postal code is input and a conversion key is pressed, a corresponding address is displayed. Specifically, when "770-8051" is input and the conversion key is pressed, "Okihama Town, Tokushima City, Tokushima Prefecture" is displayed as a conversion candidate.
[0005]
[Problems to be solved by the invention]
By combining the two inventions described above, even if "770-8051" is not all entered, "Okihama-cho, Tokushima City, Tokushima Prefecture" is displayed on the screen as a reduced input conversion candidate when "770-" is entered. Can be displayed.
[0006]
However, the above combination has the following problems. Since the correspondence between “770-8051” and “Okihama-cho, Tokushima City, Tokushima Prefecture” is only stored in the history buffer, if the operator inputs the corresponding address using only the postal code, the reading is partially completed. Even if input, "Okihama Town, Tokushima City, Tokushima Prefecture" is not displayed as a candidate for input-saving conversion.
[0007]
Such a problem is caused not only by the kana-kanji conversion processing but also by a character string in which one record is composed of a plurality of columns, and when any one of the columns is specified, data stored in another column is determined as an output candidate. In the input processing, there is a similar problem.
[0008]
SUMMARY OF THE INVENTION It is an object of the present invention to solve the above-mentioned problem and to provide an apparatus or a method capable of easily inputting a character string.
[0009]
[Means for Solving the Problems]
1) A character string conversion device according to the present invention includes: 1) input character string storage means for storing an input character string as a read character string; and 2) conversion for storing a read character string and a converted character string corresponding thereto. Dictionary storage means, 3) When a conversion command is given, the read character string stored in the input character string storage means is converted into a converted character string with reference to the conversion dictionary storage means, and the undetermined character string storage means 4) When a fixed instruction is given, the character string stored in the undetermined character string storage means and the corresponding read character string stored in the input character string storage means are stored as history information. 5) If there is a reading character string exceeding a predetermined matching degree in the history information among the reading character strings stored in the input character string storage means, the corresponding converted character string is omitted. Input candidates and A character string conversion device provided with a notifying means for notifying the user that the keyword is associated with the converted character string stored in the conversion dictionary storage means. When a command is given, it is determined whether or not the keyword exists in the input character string. If the keyword is present, the keyword is converted into a corresponding converted character string. If the keyword is included in the history information, the conversion information storage unit refers to the conversion dictionary storage unit, associates the converted character string associated with the keyword with its read character string, To be stored. As described above, when a keyword for a certain converted character string is input and the keyword is included in the determined character string, the converted character string associated with the keyword and the read character string are stored in the history information. By storing as, even when the keyword is determined without being converted to a converted character string, the input-less conversion of the character string before conversion of the keyword can be performed. Thereby, simple input becomes possible.
[0010]
2) In the character string conversion device according to the present invention, the conversion dictionary storage means stores a postal code corresponding to an address as a keyword, and the conversion means, when given a conversion instruction, adds the postal code to the input character string. It is determined whether or not a postal code exists, and if so, the corresponding address is converted as a converted character string, and the determining means includes the postal code in the determined character string. In this case, referring to the conversion dictionary storage unit, the address associated with the postal code and the read character string are associated with each other and stored as the history information. Therefore, even when the postal code is fixed as it is, the input-saving conversion using the reading of the address corresponding to the postal code becomes possible.
[0011]
3) The history information generating method according to the present invention is as follows: A) After converting an input character string using a conversion dictionary, when the conversion is determined, the converted character string and its read character string are stored as a history. A history information generating method used in a method of notifying a candidate for a conversion input to notify a candidate for a saving input by referring to the history for a newly given reading character string. B) The conversion dictionary includes: If the input character string matches when the input character string conversion command is given, a keyword for conversion to the corresponding converted character string is stored in association with the converted character string, and C). In the case where the keyword is included in the determined character string, the converted character string associated with the keyword and its read character string are associated with each other by referring to the conversion dictionary. , Said shoes It is stored as. Therefore, even when the operator determines the keyword without giving the converted character string conversion command, the input-less conversion of the pre-conversion character string of the keyword can be performed. Thereby, simple input becomes possible.
[0012]
4) In the program according to the present invention, a keyword is stored in the third column of the record, and an operation is performed when an input character string matches a keyword stored in the third column of any record. When the user has determined the keyword as an output character string, the set of character strings stored in the first and second columns of the record is stored as a priority output candidate. Therefore, even when the keyword is determined as an output character string, a set of character strings stored in the first column and the second column of the record can be stored as a priority output candidate. Thereby, simple input becomes possible.
[0013]
In the present specification, the “keyword” is not only a shortened word that is a part of a word of a converted character string, but also a combination code of numerals or alphabetical characters such as a postal code as in the embodiment. Including the case where it is represented.
[0014]
The “record” may be any format as long as one record is composed of data of a plurality of columns. For example, a case where each data is associated like a relational database format may be used. Including.
[0015]
In addition, the “converted character string conversion command” in the embodiment corresponds to a command for converting a postal code into a corresponding address.
[0016]
In addition, “when the keyword is included in the determined character string” means that the keyword is determined as it is without being converted to a character string after conversion, and of course, half-width conversion, full-width conversion, etc. are performed. As a result, it is a concept that includes all the cases that are finally included in the determined character string. Further, the case where the user has the non-conversion key includes the case where the non-conversion key is pressed.
[0017]
In the embodiment, the input character string storage means is the reading buffer 27b, the undetermined character string storage means is the undetermined character string buffer 27d, the determined character string storage means is the determined character string buffer 27a, and the conversion dictionary storage means 3 is Corresponds to the dictionary unit 26b, the converting means corresponds to the processing of step S15 of the CPU 23, and the notifying means corresponds to the processing of step S7 of the CPU 23.
[0018]
The history information is information used when performing input-saving conversion, and in the embodiment, corresponds to a set data of a read character string and a notation character string stored in the fixed character string buffer 27a or the extended history buffer 27c. .
[0019]
BEST MODE FOR CARRYING OUT THE INVENTION
1. Outline and description of functional blocks An embodiment of the present invention will be described with reference to the drawings. FIG. 1 shows a functional block diagram of a kana-kanji conversion device 1 according to the present invention. The kana-kanji conversion device 1 includes an input character string storage unit 2, a conversion dictionary storage unit 3, a conversion unit 5, an undetermined character string storage unit 6, a determination unit 8, a determined character string storage unit 11, and a notification unit 9. .
[0020]
The input character string storage means 2 stores the input character string as a read character string. The conversion dictionary storage means 3 stores the read character string and the converted character string corresponding to the read character string. A keyword is associated with the converted character string stored in the conversion dictionary storage unit 3. When a conversion command is given, the conversion means 5 converts the read character string stored in the input character string storage means 2 into a converted character string by referring to the conversion dictionary storage means 3, and converts the undetermined character string storage means 6 To memorize. When a conversion command is given, the conversion means 5 determines whether the keyword exists in the input character string, and if so, converts the keyword into a corresponding converted character string. It is stored in the means 6. When the determination command is given, the determination means 8 associates the character string stored in the undetermined character string storage means 6 with the corresponding read character string stored in the input character string storage means 2 to record the history information storage means. 7 is stored as history information. The notification unit 9 saves the corresponding converted character string when the read character string stored in the input character string storage unit 2 has a read character string exceeding a predetermined matching degree in the history information. When the determined character string includes the keyword, the determination unit 8 that notifies the candidate as a candidate refers to the conversion dictionary storage unit 3 and converts the converted character string associated with the keyword. The sequence is associated with the read character string and stored as the history information.
[0021]
Therefore, even when the operator determines the keyword without converting it to the corresponding converted character string, the input-saving conversion processing can be performed using the reading of the corresponding converted character string.
[0022]
2. Hardware Configuration of Kana-Kanji Conversion Apparatus 1 FIG. 2 shows an example of a hardware configuration in which the kana-kanji conversion apparatus 1 shown in FIG. 1 is configured using a CPU.
[0023]
The kana-kanji conversion device 1 includes a CPU 23, a memory 27, a hard disk 26, a CDD (CD-ROM drive) 25, a keyboard 28, a display 30, a mouse 31, and a bus line 29.
[0024]
The CPU 23 controls each unit via the bus line 29 according to a program stored in the hard disk 26. In the present embodiment, Microsoft Windows XP (trademark) or the like is used as the operating system (not shown).
[0025]
The hard disk 26 stores a kana-kanji conversion program 26a described later. This program is read from the CD-ROM 25a storing the program via the CDD 25 and installed on the hard disk 26. In addition, programs other than a CD-ROM, such as a flexible disk (FD) and an IC card, may be installed on a hard disk from a computer-readable recording medium. Furthermore, you may make it download using a communication line.
[0026]
In the present embodiment, by installing the program from the CD-ROM to the hard disk 26, the computer indirectly executes the program stored in the CD-ROM. However, without being limited to this, the program stored in the CD-ROM may be directly executed from the CDD 25. Note that, as a program executable by a computer, not only a program that can be directly executed by simply installing it as it is, but also a program that needs to be once converted into another form (for example, decompresses a data-compressed program) Etc.), and also includes those that can be executed in combination with other module parts.
[0027]
The hard disk 26 has a kana-kanji conversion program 26a, a conversion dictionary 26b, and a reduced input candidate determination rule storage unit 26c. The conversion dictionary 26b stores a character string conversion dictionary for converting an input character string into a converted character string. The conversion dictionary 26b further includes a postal code dictionary as shown in FIG. The postal code dictionary stores addresses corresponding to postal codes and their readings.
[0028]
The kana-kanji conversion program 26a converts the input read character string into a notation character string containing kana-kanji characters based on the character string conversion dictionary of the conversion dictionary 26b, and is stored in the reduced input candidate determination rule storage unit 26c as described later. In the input-saving conversion mode, conversion to a candidate that the operator may want is performed based on the rule. In the present embodiment, the rule disclosed in Patent Literature 1 is used as such a rule for determining a candidate for saving, but the rule is not limited to this.
[0029]
The memory 27 has a fixed character string buffer 27a, a reading buffer 27b, an extended history buffer 27c, and an undetermined character string buffer 27d. The undetermined character string buffer 27d stores the character string before it is determined. The confirmed character string buffer 27a stores the confirmed character string and its read character string. The read character string is stored in the read buffer 27b. The extended history buffer 27c stores, as will be described later, a correspondence between a notation character string that is not directly input and its read character string, with reference to a conversion dictionary. The memory 27 also stores various calculation results and the like.
[0030]
3. Next, the kana-kanji conversion program stored in the hard disk 26 will be described with reference to FIG. In the following, after inputting the postal code "770-8051" and confirming it, the reading "Tokushimaken ..." of the address "Okihama-cho, Tokushima City, Tokushima Prefecture" associated with the postal code is performed. A case in which the input-saving conversion candidates are displayed when the input is performed up to will be described as an example.
[0031]
First, the operator inputs “7” from the keyboard 28. The CPU 23 determines the type of the input key (step S1 in FIG. 4). In this case, since the type of the key is a character input key, the character string “7” is stored in the reading buffer 27b, and the display 30 is displayed. Is displayed in an undetermined state (step S3). The CPU 23 determines whether or not one that matches the reduced input candidate determination rule is stored in the fixed character string buffer 27a or the extended history buffer 27c (step S5). In this case, since there is no match in these buffers, the process returns to step S1. Similarly, the operator inputs “7” “0” “−” “8” “0” “5” “1”. As a result, "770-8051" is stored in the reading buffer 27b and the undetermined character string buffer 27d, and the character string stored in the undetermined character string buffer 27d is displayed on the display 30 in an undetermined state.
[0032]
In this state, the operator presses an enter key (not shown). The CPU 23 determines the type of the input key (step S1). In this case, since the key is an enter key, the CPU 23 reads the input into the enter character string buffer 27a and writes "770-8051" as "770-8051". Is stored (step S18), and the determined “770-8051” is displayed on the display 30 in a determined state (step S19).
[0033]
The CPU 23 determines whether or not the character string stored in the determined character string buffer 27a in step S18 includes a postal code as a written character string (step S21). In the present embodiment, when a three-digit number and a four-digit number are joined by a hyphen, it is determined to be a postal code.
[0034]
When such a character string includes a postal code, the CPU 23 searches the conversion dictionary 26b (step S23) and determines whether the character string exists in the conversion dictionary 26b (step S25). In this case, since it exists, the reading of the address corresponding to the postal code from the conversion dictionary 26b and the notation "Tokushima Kento Kushimashioki no Hamacho" and "Okihama Town, Tokushima City, Tokushima Prefecture" are stored in the extension history buffer 27c. (Step S27). To be more specific, “Tokushimaken: Tokushima Prefecture”, “Tokushimashi: Tokushima City”, “Okinohama” are used by using reading separators (6,11,18) and notation separators (3,6,9). And the reading and notation for each phrase are stored in the extended history buffer 27c.
[0035]
Note that if the character string does not exist in the conversion dictionary 26b in step S25, the CPU 23 does not perform the processing in step S27.
[0036]
Next, the operator sequentially reads "to", "ku", "shi", "ma", "ke", and "n" from the keyboard. The CPU 23 determines that the type of key is a character input key (step S1), stores these character strings in the reading buffer 27b, and displays them in an undetermined state on the display 30 (step S3). The CPU 23 determines whether or not it matches the read character string stored as the history information with reference to the reduced input candidate determination rule (step S5). For example, as the above-mentioned rule for determining a reduced input candidate, a rule that “if the leading part matches the reading stored in the fixed character string buffer 27a or the extended history buffer 27c, the consecutive phrases are reduced to the reduced input candidate” is stored. If yes, the CPU 23 displays on the screen that "Okihama Town, Tokushima City, Tokushima Prefecture" exists as a candidate for saving input (Step S7). In the present embodiment, a display method using the tooltip 61 as shown in FIG. 5 is performed as a display method of the input-saving conversion candidates, but any display method of the candidates may be used. In FIG. 5, the character string “770-8051” is displayed in a determined state, and “Tokushimaken” is displayed in an undetermined state.
[0037]
The operator presses the saving input candidate confirmation key when the saving input candidate is a character string to be input. The CPU 23 determines whether or not the save-input candidate confirming key is pressed (step S9). When this key is pressed, a conversion process is performed on the save-input candidate (step S11), and steps S18 and S19. Similarly to the above, storage in the determined character string buffer and display in the determined state are performed (steps S12 and S13).
[0038]
If the key is a conversion key in step S1, a conversion process using a conversion dictionary is performed as in the related art (step S15). To determine a conversion candidate, the determination key may be pressed. As a result, the processing from step S18 is executed.
[0039]
As described above, in the present embodiment, when the seven-digit postal code is determined without being converted into an address, the postal code and the notation of the corresponding address are stored in the extended history buffer 27c using the postal code as a keyword. did. Therefore, once the postal code is fixed, even if the reading of the written character string corresponding to the postal code has not been input, the input-saving conversion by the reading becomes possible.
[0040]
Further, the data stored in the extended history buffer 27c is divided into phrases and stored using reading delimiter and notation delimiter information stored in the dictionary in advance. Therefore, input-saving conversion from a part of the address (for example, “Tokushimashi”) is also possible.
[0041]
4. Other Embodiments In the present embodiment, the case where the postal code is used as a keyword has been described. However, in the case where a word different from the reading of the converted character string is converted as a keyword, the same can be applied. . For example, an abbreviation and a formal name and its reading, a management number and a name of a management target and its reading, a URL and a site name corresponding to the URL and its reading, etc. may be registered in a dictionary.
[0042]
Further, the present invention can be similarly applied to a voice input type kana-kanji conversion device that inputs a character string to be input by voice.
[0043]
In addition to the kana-kanji conversion device, one record is composed of a plurality of columns, and a character string input process for determining data stored in another column as an output candidate when one of the columns is specified Can be similarly applied.
[0044]
When storing in the extended history buffer 27c, the part of speech information may be stored together. In this way, when there are a plurality of ministry input candidates, for example, a process of assigning specific part of speech information to a word strongly associated with a unique personal name and giving priority to the unique personal name immediately after the word is determined. , The candidates can be surely displayed. For example, the reading “Tanatakaro” and the converted character string “Taro Tanaka” are registered in the extension history, and “Name” is given part-of-speech information indicating strong connection with the personal name. Enter "Botamochi", convert it to "Botamochi from the shelf", confirm it, and then enter "shimei" to convert it to "Name" and confirm it. As a result, the part of speech information indicating that the next unique personal name is prioritized is stored. After that, when the input-saving conversion is performed by reading "Tanaka", "Taro Tanaka" is output with priority over the recently determined "Take from the shelf".
[0045]
In the above embodiment, the functions shown in FIG. 1 are realized by using the CPU 23 and software. However, some or all of them may be realized by hardware such as a logic circuit.
[Brief description of the drawings]
FIG. 1 is a functional block diagram of a kana-kanji conversion device 1 according to the present invention.
FIG. 2 is a diagram illustrating an example of a hardware configuration in which the kana-kanji conversion device 1 is implemented using a CPU.
FIG. 3 shows a data structure of a dictionary related to a converted character string to which a keyword is added.
FIG. 4 is a flowchart of a conversion process.
FIG. 5 shows an example of a dialog box for displaying candidate input conversion candidates.
[Explanation of symbols]
1. Kana-Kanji conversion device 23 CPU
27 ... Memory

Claims (4)

Input character string storage means for storing the input character string as a read character string,
Conversion dictionary storage means for storing a read character string and a converted character string corresponding thereto,
When a conversion instruction is given, the conversion unit converts the read character string stored in the input character string storage unit into a converted character string by referring to the conversion dictionary storage unit, and stores the converted character string in the undetermined character string storage unit.
When a determination command is given, a determination unit that stores the character string stored in the undetermined character string storage unit and the corresponding read character string stored in the input character string storage unit as history information,
In the case where there is a reading character string exceeding a predetermined matching degree in the history information with respect to the reading character string stored in the input character string storage unit, a notification that notifies the corresponding converted character string as a reduced input candidate. means,
A character string conversion device comprising:
A keyword is associated with the converted character string stored in the conversion dictionary storage means,
The conversion means, when given a conversion command, determines whether or not the keyword exists in the input character string, and if so, converts the keyword into a corresponding converted character string,
If the keyword is included in the determined character string, the determination unit refers to the conversion dictionary storage unit and reads the converted character string associated with the keyword and its reading. Storing the history information in association with a character string;
Character string conversion device characterized by the above-mentioned. The character string conversion device according to claim 1,
The conversion dictionary storage means stores postal codes corresponding to addresses as keywords.
The conversion means, when given a conversion command, determines whether the postal code is present in the input character string, and if so, converts the corresponding address as a converted character string,
When the postal code is included in the determined character string, the determining unit refers to the conversion dictionary storage unit to read the address associated with the postal code and its read character. Storing the history information in association with a column;
Character string conversion device characterized by the above-mentioned. After the input character string is converted using the conversion dictionary, when this is determined, the converted character string and its read character string are stored as a history, and for a newly given read character string, A history information generation method used for a saving input conversion candidate notification method of notifying a saving input candidate with reference to a history,
In the conversion dictionary, when a read character string matches when a converted character string conversion command is given, a keyword for converting to a corresponding converted character string is associated with the converted character string. Remembered,
In the case where the keyword is included in the determined character string, the converted character string associated with the keyword and its read character string are associated with each other by referring to the conversion dictionary. , Storing as the history,
A history information generation method characterized by the following. A program for implementing the following output candidate determination method by computer.
When a character string is input, a record in which a character string matching the character string exists in the first column is specified, and the character string stored in the second column of the record is reported as an output candidate, and the operator is notified. If the candidate is determined as an output character string, a priority output candidate determination method for storing a set of character strings stored in the first column and the second column of the record as a priority output candidate,
A keyword is stored in the third column of the record, and when the input character string matches the keyword stored in the third column of any record, the operator sets the keyword as an output character string. When it is determined, a set of character strings stored in the first column and the second column of the record is stored as a priority output candidate.

Images