JP2007310589A - Program, method and apparatus for learning input conversion - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a program, a method and an apparatus for learning input conversion capable of automatically, easily and efficiently performing Kana input conversion. <P>SOLUTION: According to the program for learning input conversion, words to be operated are weighted according to character string operations, such as displaying, selecting ranges, copying, pasting, and converting, performed in another system 200 such as a Web browser 200a, an e-mail application 200b, and an editor 200c, and the words are registered in a language dictionary table of a language dictionary DB 105c. During the input conversion in a language input system 300, the content registered in the language dictionary table of the language dictionary DB 105c is read and displayed at the top of a list of input conversion candidate lists, whereby it is made possible to efficiently convert certain input Kana letters into a word for which character string operations have been more frequently performed. <P>COPYRIGHT: (C)2008,JPO&INPIT

Description

  The present invention provides a kana-kanji input conversion candidate learning process in a kana-kanji conversion system that converts a kana character string input in an application into a kanji character string by selecting one conversion candidate from a list of conversion candidates. The present invention relates to an input conversion learning program, an input conversion learning method, and an input conversion learning device to be executed by a computer.

  In an input method in a computer system, in order to input a Japanese sentence mixed with kanji characters, it is common to first convert a character string input with kana characters into kanji characters as necessary. In such a conversion method, a plurality of conversion candidates are listed in a conversion candidate list and selected for a character string of kana.

  In order to perform such conversion more efficiently, a learning function of placing the conversion candidate most recently selected for conversion in the highest priority in the conversion candidate list is often provided. In order to perform more efficient conversion, for example, Patent Document 1 discloses a connection between a morpheme and a morpheme connected to the morpheme based on a result of a morphological analysis of a sentence included in a user file read as a language model. A kana input conversion method is disclosed in which the appearance probability of a combination is calculated, and the concatenation combination having the highest appearance probability is selected as a conversion candidate when converting the kana input of the connection combination.

JP 2004-118461 A

  However, in the related art represented by the above-mentioned Patent Document 1, the appearance probability of the connection combination can be calculated only when the connection combination exists in the text included in the user file read as the language model. In order to select the connection combination having the highest appearance probability as a conversion candidate, it is necessary to read more user files and calculate the appearance probability of more connection combinations.

  In addition, since the user file must be read manually, the active procedure is not only complicated, but when the user file to be read is not properly selected, the necessary connection combinations are learned. As a result, efficient kana input conversion could not be performed.

  The present invention has been made to solve the above problems (problems), and automatically imports a language model in accordance with a character string operation to order the vocabulary of sentences included in the language model. Input conversion learning program, input conversion learning method, and input conversion learning capable of performing automatic, easy and efficient kana input conversion by enabling conversion candidates to be selected from a list of conversion candidates according to ordering An object is to provide an apparatus.

  In order to solve the above-described problems and achieve the object, the present invention converts a kana character string input in an application into a kanji character string by selecting one conversion candidate from a list of conversion candidates. An input conversion learning program for causing a computer to execute conversion candidate learning processing for kana-kanji input conversion in a system, the character string processing detection procedure for detecting character string processing for a character string handled by the application, and the character A character string decomposition processing procedure for decomposing a character string detected by the sequence processing detection procedure into vocabulary, and a vocabulary weighting processing procedure for performing weighting according to the character string processing for each vocabulary obtained by the character string decomposition processing procedure; The vocabulary weighted by the vocabulary weighting procedure together with the weighting and reading of the vocabulary Characterized in that to execute the lexical registration procedure for registering the conversion learning database on the computer.

  The present invention also provides a learning of conversion candidates for kana-kanji input conversion in a kana-kanji conversion system that converts a kana character string input in an application into a kanji character string by selecting one conversion candidate from a list of conversion candidates. An input conversion learning method for performing processing, a character string processing detection step for detecting character string processing for a character string handled by the application, and a character for decomposing the character string detected by the character string processing detection step into a vocabulary A column decomposition processing step, a vocabulary weighting processing step for weighting each vocabulary obtained by the character string decomposition processing step according to the character string processing, and the weighting and vocabulary weighted by the vocabulary weighting processing step. Including a vocabulary registration processing step of registering in the conversion learning database together with the vocabulary reading kana That.

  The present invention also provides a learning of conversion candidates for kana-kanji input conversion in a kana-kanji conversion system that converts a kana character string input in an application into a kanji character string by selecting one conversion candidate from a list of conversion candidates. An input conversion learning device that performs processing, wherein a character string processing unit that detects character string processing for a character string handled by the application, and a character string decomposition that decomposes the character string detected by the character string processing unit into a vocabulary Processing means, vocabulary weighting processing means for performing weighting according to the character string processing for each vocabulary obtained by the character string decomposition processing means, and the vocabulary weighted by the vocabulary weighting processing means Conversion learning storage means for storing together with the reading kana, and the vocabulary weighting processing means in the conversion learning storage means Characterized in that a vocabulary registration processing means for registering a more weighted vocabulary with kana of the weighting and the vocabulary.

  According to the present invention, the vocabulary weighting processing procedure for weighting each vocabulary obtained by the character string decomposition processing procedure according to the character string processing, the vocabulary weighted by the vocabulary weighting processing procedure, the weighting and reading of the vocabulary Since the vocabulary registration processing procedure for registering in the conversion learning database together with the kana is included, there is an effect that the vocabulary for the reading kana can be evaluated and ordered by weighting according to the character string processing.

  Exemplary embodiments of an input conversion learning program, an input conversion learning method, and an input conversion learning apparatus according to the present invention will be described below in detail with reference to the accompanying drawings. In the following embodiments, the present invention is further implemented separately from the Japanese input conversion program that is pre-installed in the computer system, thereby supplementing the input conversion learning function of the Japanese input conversion program. An input conversion learning program, an input conversion learning method, and an input conversion learning device will be described. Further, the present invention can be applied not only to a computer system but also to an input conversion system in a mobile phone.

  First, the features of the present embodiment will be described while describing the system configuration of the input conversion learning program, the input conversion learning method, and the input conversion learning apparatus of the present embodiment. FIG. 1 is a diagram illustrating a concept of a system configuration according to an input conversion learning program, an input conversion learning method, and an input conversion learning device of the present embodiment.

  As shown in the figure, the system of the present embodiment is realized by an automatic learning system 100, a Web browser 200a, another system 200 such as an e-mail application (so-called Mailer) 200b and an editor 200c, and a Japanese input conversion program. The language input system 300 is configured. The automatic learning system 100, the other system 200, and the language input system 300 are application software groups that are simultaneously implemented in one computer system.

  The automatic learning system 100 includes an automatic learning application 100a corresponding to a process as an execution mode of automatic learning processing of input conversion, and a language dictionary DB (Data Base) for learning and storing the input conversion learning processing result by the automatic learning application 100a. 105c.

  The language input system 300 includes a language input application 300a corresponding to a process as an execution mode of Japanese kana-kanji input conversion processing, and kana and kanji (or converted characters) for performing kana-kanji input conversion by the language input application 300a. Is stored in association with the conversion dictionary DB 305c.

  Here, in the conventional system, the language input application 300a of the language input system 300 selects a kanji (or converted character) once selected and converted corresponding to the input kana, and again refers to the conversion dictionary DB 305c. A learning function of the conversion dictionary DB 305c that, when being read and displayed as a conversion candidate, by performing the display preferentially, the kanji (or conversion character) can be preferentially selected and converted according to the kana. Therefore, efficient kana-kanji input conversion is to be performed.

  However, such a learning function does not function unless the input kana is once converted into a conversion character, so that an appropriate conversion character cannot be presented as a conversion selection candidate for the first input kana, which is efficient. Kana-kanji conversion could not be realized.

  In particular, character string operations in computer systems include not only input of kana and conversion of the kana into converted characters, but also display, selection, copy, paste, and other character string operations that are different from such input conversion. In many cases, the performed character string or vocabulary is subject to input conversion.

  The present invention has been made paying attention to such a problem, and is also subject to conversion learning for character string operations different from input conversion. The purpose is to realize efficient kana-kanji conversion by allowing characters to be presented as conversion candidates.

  Specifically, the automatic learning application 100a extracts a vocabulary from a character string displayed, selected, copied, pasted or converted in the other system 200, and gives points according to each of the displayed, selected, copied, pasted or converted After the weighting is performed, it is stored in the language dictionary DB 105c.

  The language input application 300a not only obtains conversion candidates from the conversion dictionary DB 305c when converting the input kana into converted characters, but also converts the input kana from the language dictionary DB 105c of the automatic learning application 100a. Corresponding conversion candidates are acquired, and the display order of conversion candidates in the conversion dictionary DB 305c is corrected according to the above-described weighting.

  When the automatic learning system 100 is introduced, the display order of conversion candidates is changed in real time every time various character string operations such as display, range selection, copy, paste, and conversion are performed. Therefore, the necessary conversion candidates can be always displayed at the top of the conversion candidate list in the latest state, and the efficiency of the input conversion process can be improved and maintained.

  In the embodiment, the correction of the display order of the conversion candidates is prioritized over all conversion candidates ordered in the predetermined order acquired from the conversion dictionary DB 305c, and the conversion candidates ordered in the predetermined order acquired from the language dictionary DB 105c are used. The display order of the conversion characters stored in the conversion dictionary DB 305c may be changed according to the weighting of the vocabulary stored in the language dictionary DB 105c.

  Next, a processing example of the automatic learning function processed in the system according to the input conversion learning program, the input conversion learning method, and the input conversion learning device shown in FIG. 1 will be described. FIG. 2 is a diagram illustrating a processing example of an automatic learning function processed by the system according to the input conversion learning program, the input conversion learning method, and the input conversion learning device illustrated in FIG.

  As shown in the figure, for example, points as weights for each event of display, selection, copy, paste, and conversion are defined as follows. That is, display: 1 (point), range selection: 3 (point), copy: 5 (point), paste: 7 (point), conversion: 9 (point) (FIG. 2 (1)).

  In a situation where weighting points are defined in this way, Mr. Nagaoka receives and displays an email as shown (FIG. 2 (2)). Subsequently, the automatic learning function of the automatic learning system 100 of the present embodiment performs morphological analysis, extracts vocabulary from the illustrated mail text, and gives points to each vocabulary. Note that the automatic learning function extracts vocabulary that can be converted back to kana and gives points, but in this example, in order to simplify the explanation, the extracted vocabulary will be explained by focusing on only the name. And Then, the points given to the extracted vocabulary and each vocabulary become 1 (point) when the event of “display” is performed for all vocabularies as shown in the chart of FIG.

  After this, suppose that Nagaoka performed the following operations. That is, the vocabulary “Hiroyuki” was copied and pasted, and the vocabulary “Hiroyuki” was copied. In this case, 5 (point) is given to the event as an operation of “copy”, and 7 (point) is given to the event of “paste”. The point is 1 + 5 + 7 = 13 (point) because 5 (point) of “copy” and 7 (point) of “paste” are given in addition to 1 (point) of “display”. The point of “Hiroyuki” is 1 + 5 = 6 (points) because “copy” 5 (points) is given in addition to “display” 1 (points). In this way, each time an event occurs and is detected, points (points) corresponding to each event are added to the total point value.

  Thereafter, when Nagaoka converts the vocabulary “Hiroyuki” using the language input application 300a, “Hiroyuki” with the highest point is given the highest priority, and “Hiroyuki” with the next highest point is given priority. It will be displayed as a priority candidate for the conversion candidate.

  Next, the configuration of the automatic learning system shown in FIG. 1 will be described. FIG. 3 is a functional block diagram showing the configuration of the automatic learning system shown in FIG. The automatic learning system 100 is an input conversion learning device realized by mounting an automatic learning application 100a and a language dictionary 105c on a computer system. As shown in the figure, the automatic learning system 100 includes an event detection determination processing unit 101, a target character string reading processing unit 102, a morpheme analysis processing unit 103, a morpheme point processing unit 104, a storage unit 105, and a conversion. A processing detection unit 106 and a conversion candidate addition priority display processing unit 107 are included.

  The event detection determination processing unit 101 detects that the character string processing has been performed in the other system 200, and the processing is one of display, selection, copy, paste, or conversion registered in the event DB 105a. It is determined whether or not there is. If the event detection determination processing unit 101 determines that the processing of the detected character string is a display, selection, copy, paste, or conversion process registered in the event table of the event DB 105a, the detected character string Is transferred to the target character string reading processing unit 102.

  The target character string reading processing unit 102 reads a character string that has been displayed, selected, copied, pasted or converted as a processing target character string for morphological analysis, and passes it to the morphological analysis processing unit 103. The morpheme analysis processing unit 103 performs a morphological analysis on the processing target character string, and stores the analysis result in the morpheme analysis result data table of the morpheme analysis result data DB 105b.

  If the morpheme analysis processing unit 103 stores the morpheme analysis result in the morpheme analysis result data table, the morpheme point processing unit 104 refers to a dictionary in which a reading kana not shown is registered and assigns a reading kana to each morpheme. Furthermore, a point corresponding to the event detected by the event detection determination processing unit 101 is assigned to each morpheme, and the point total value of the point is calculated. The part of speech of each morpheme is known by morphological analysis. Therefore, “part of speech”, “phrase”, and “point total value” corresponding to “reading” are stored in the language dictionary table of the language dictionary DB 105c. At this time, in order to distinguish homonyms, “branch number” is added to the record of “part of speech”, “phrase” and “point total value” corresponding to “reading” to correspond to one “reading”. A plurality of “phrases” can be identified.

  The conversion processing detection unit 106 detects that an instruction for input conversion processing has been performed in the language input system 300 and notifies the conversion candidate addition priority display processing unit 107 that the instruction for input conversion processing has been detected. The conversion candidate addition priority display processing unit 107 notified of the detection of the input conversion processing instruction from the conversion processing detection unit 106 has information on all records corresponding to “reading” represented by the pseudonym that is the target of the input conversion processing. Are read from the language dictionary DB 105c and transferred to the language input system 300 in the order of the highest point total value. The information read from the language dictionary DB 105c and transferred is preferentially additionally displayed as conversion candidates in the input conversion candidate list display in the language input system 300.

  Next, the morpheme analysis result data table stored in the morpheme analysis result data DB 105b shown in FIG. 3 will be described. FIG. 4 is a diagram showing a table image of the morphological analysis result data table. As shown in the figure, the morphological analysis result data table has columns of “word” and “part of speech”. “Phrase” is stored after being decomposed into parts of speech by morphological analysis and converted into prototypes. “Part of speech” is a part of speech found by morphological analysis. Since the morphological analysis result data table is a table for temporary storage, the morphological analysis result is deleted after the vocabulary of the morphological analysis result is stored in the language dictionary DB 105c.

  Specifically, when the character string (sentence) of “Teacher went to school by car” is decomposed into parts of speech, “Teacher △ went to △ School △ △ went △ by car △” (“△” Represents a morpheme break), and when this is converted into a prototype, "Teacher △ goes to △ school △ Δ car △ goes △”. Determine the part-of-speech of each vocabulary of “teacher”, “ha”, “school”, “to”, “car”, “de”, “go”, “ta”, and morphological analysis of each vocabulary together with the part-of-speech determination result It will be stored in the result data table.

  Next, the language dictionary table stored in the language dictionary DB 105c shown in FIG. 3 will be described. FIG. 5 is a diagram showing a table image of the language dictionary table. As shown in the figure, the language dictionary table has columns of “reading”, “branch number”, “part of speech”, “phrase”, and “point total value”. “Reading” is a reading pseudonym indicating a reading corresponding to each “word”. The branch number is an identifier for identifying each “vocabulary” corresponding to the “reading” in the case where a plurality of “words” corresponds to one “reading”. It is the part of speech name of the “word” found by morphological analysis. The “point total value” is the total value of points given according to the type of event that is a character string operation performed on the “word”. This point is always added and never subtracted.

  Next, an event table stored in the event DB 105a shown in FIG. 3 will be described. FIG. 6 is a diagram showing a table image of the event table. As shown in the figure, the event table has columns of “event” and “point”. “Event” indicates the type of processing performed on the processing target character string. Specifically, “display” indicates display of a character string, and “range selection” indicates selection by reverse display of the character string. “Copy” indicates copying of the character string, and “Paste” indicates pasting of the copied character string. “Conversion” indicates kana-kanji conversion of the input character string.

  In the event table image diagram shown in FIG. 6, display: 1 (point), range selection: 3 (point), copy: 5 (point), paste: 7 (point), conversion: 9 (point), Points are assigned to events, but the types of events that are registered in the event table and recognized as events to be added points and the number of points assigned to each event are merely examples, and an automatic learning system 100, the other system 200, and the language input system 300 are matters that can be changed as appropriate.

  Next, the language dictionary table registration processing procedure executed in the automatic learning system 100 shown in FIG. 1 will be described. FIG. 7 is a flowchart showing a language dictionary table registration processing procedure. The following processing is processing executed by the event detection determination processing unit 101, the target character string reading processing unit 102, the morpheme analysis processing unit 103, or the morpheme point processing unit 104. As shown in the figure, first, it is determined whether or not the occurrence of an event for a character string in another system is detected (step S101). When it is determined that the occurrence of an event for the character string in another system is detected (Yes at Step S101), the process proceeds to Step S102, and when it is not determined (No at Step S101), Step S101 is repeated.

  Next, it is determined whether or not the event that has occurred is present in the event table (step S102). If it is determined that the event is present (Yes in step S102), the process proceeds to step S103. (No in step S102), the process proceeds to step S101.

  In step S103, the character string to be processed is subjected to morphological analysis, and the result is stored in the morphological analysis result data table. Subsequently, it is determined whether or not morphological analysis has been performed on all target character strings (step S104). If it is determined that morphological analysis has been performed on all character strings (Yes in step S104), the process proceeds to step S105. If it is not determined that morphological analysis has been performed for all character strings (No at step S104), the process proceeds to step S103.

  In step S105, the language dictionary table is searched based on the words and parts of speech of the morphological analysis result data. Subsequently, it is determined whether or not the search target exists in the language dictionary table (step S106). When it is determined that the search target exists (step S106 affirmative), the points of the event table are added to the point total value of the searched records. Add (step S107), and if it is not determined to exist (No in step S106), a new word record for the reading is added, and the points in the event table are added to the point total value (step S108). If step S107 or step S108 is completed, the process proceeds to step S109.

  In step S109, it is determined whether or not the language dictionary table has been searched for all target morpheme analysis result data. If it is determined that the language dictionary table has been searched for all morpheme analysis result data (Yes in step S109). ), The language dictionary table registration process is terminated, and if it is not determined that the language dictionary table has been searched for all the morphological analysis result data (No at Step S109), the process proceeds to Step S105.

  Next, the language dictionary table read processing procedure executed in the automatic learning system 100 shown in FIG. 1 will be described. FIG. 8 is a flowchart showing a language dictionary table read processing procedure. The following processing is processing executed by the conversion processing detection unit 106 or the conversion candidate addition priority display processing unit 107. As shown in the figure, first, it is determined whether or not an instruction for conversion processing in the language input system has been detected (step S201). When it is determined that an instruction for conversion processing has been detected (step S202), conversion candidates corresponding to the input “reading” are read out from the language dictionary DB 105c in descending order of points and transferred to the language input system. The language input system 300 to which the conversion candidates corresponding to the input “reading” are transferred in the order of high points is added to the conversion candidates to be read out and displayed from the conversion dictionary 305c and given priority over the conversion candidates. Conversion candidates from the dictionary DB 105c are additionally displayed in the order of higher points.

  Next, a display example of conversion candidates in the language input system when the language input system shown in FIG. 1 is linked with the automatic learning system will be described. FIG. 9 is a diagram illustrating a display example of conversion candidates in the language input system. In the figure, a case where a character string “Kisha” is converted is illustrated.

  In the language dictionary table of the language dictionary DB 105c, the words “your company”, “train”, “reporter”, and “return home” are stored as “words and phrases” corresponding to “reading” of this “work”. The respective points are “8”, “7”, “5”, and “1”. These points are transferred from the language dictionary table to the language input system 300 in a high order, and are displayed in that order from the top of the display list of conversion candidates of the language input system 300. That is, the first to fourth conversion candidate display lists are read from the language dictionary table and displayed.

  On the other hand, the fifth and subsequent items in the conversion candidate display list of the language input system 300 are original conversion candidates read from the conversion dictionary table of the conversion dictionary DB 305c. As described above, when the conversion candidates stored in the language dictionary table of the word dictionary DB 105c are displayed in preference to the conversion candidates read from the conversion dictionary table of the conversion dictionary DB 305c, the character string operation has been performed recently. Conversion candidates that are more likely to be selected are preferentially displayed at the top of the display list of conversion candidates, and the efficiency of kana-kanji conversion can be further increased.

  Each process described in the above embodiment can be realized by executing a prepared program on a computer system such as a personal computer, a server, or a workstation.

  According to the above embodiment, the application includes not only the application that is the target of kana-kanji input conversion, but also other applications that are executed in the computer system. Therefore, character string operations performed in various applications are weighted by vocabulary. In some cases, more accurate vocabulary weighting reflecting the frequency of use in the personality may be possible.

  Further, according to the above embodiment, when the input conversion process is detected by the input conversion process detection procedure, the conversion learning is performed on the vocabulary corresponding to the kana character string that matches the kana character string to be converted input in the input conversion process. Since it includes a conversion candidate transfer procedure that is read from the database and transferred to the kana-kanji conversion system so that it can be displayed as a conversion candidate in the order of high weighting order, the vocabulary that has been ordered and evaluated with weighting according to the character string processing, In some cases, it is possible to improve the conversion efficiency by displaying a vocabulary with a high weighting order at the top of the list of conversion candidates.

  As mentioned above, although the Example of this invention was described, this invention is not limited to this, In the range of the technical idea described in the claim, even if it implements in a various different Example, it is. It ’s good. Moreover, the effect described in the Example is not limited to this.

  In the above embodiment, the vocabulary that is the result of the morphological analysis is used as a unit of words to be registered in the language dictionary table of the language dictionary DB 105c. However, the present invention is not limited to this, and a compound word in which a vocabulary and a vocabulary are combined may be registered as a phrase. By doing so, the convenience and efficiency of the conversion process may be further increased. The vocabulary extraction method is not limited to morphological analysis.

  In the above-described embodiment, the character string operation other than the conversion is reflected in the learning result of the input conversion candidate by adding and functioning to the language input system that the computer system originally has. For this purpose, a method is adopted in which words and phrases having undergone character string operations other than conversion are newly registered one after another in the language dictionary table. However, the present invention is not limited to this, the specification of the conversion dictionary table of the conversion dictionary 305c of the language input system 300 is changed, and points corresponding to character string operations are directly recorded in this conversion dictionary table, so that conversion candidates are displayed. Sometimes, the display may be performed in descending order of the points. This eliminates the need to prepare a language dictionary table in the language dictionary DB 105c, and may save computer resources. Alternatively, the language input system 300 may refer to the language dictionary table of the language dictionary DB 105c as the conversion dictionary.

  Further, the embodiment may be an embodiment in which the language input system 300 includes the functions and processing of the automatic learning system 100 shown in the above embodiment. Alternatively, the embodiment may be an embodiment in which the automatic learning system 100 includes the functions and processing of the language input system 300. According to these, the system related to the input conversion is integrated into the automatic learning system 100 or the language input system 300, so that the system configuration becomes simple and the ease of maintenance may be improved.

  According to the above-described embodiment, character string operations such as display, range selection, copy, paste, and conversion performed in another system 200 such as the Web browser 200a, the e-mail application 200b, and the editor 200c (same as a word processor) are performed. Accordingly, the vocabulary to be operated is weighted and registered in the language dictionary table of the language dictionary DB 105. When performing input conversion in the language input system 300, the registered contents of the language dictionary table of the language dictionary DB 105 are read out and displayed at the top of the candidate list of input conversion candidates, whereby a character string operation is performed more frequently on an input kana. It may be possible to efficiently convert to vocabulary.

  The “phrase” corresponding to “reading” is not limited to kanji, and may be hiragana, katakana, alphanumeric characters, various symbols, or a mark.

(Supplementary Note 1) A kana-kanji input conversion candidate learning process in a kana-kanji conversion system that converts a kana character string input in an application into a kanji character string by selecting one conversion candidate from a list of conversion candidates. An input conversion learning program for causing a computer to execute,
A character string processing detection procedure for detecting character string processing for a character string handled by the application;
A character string disassembling procedure for decomposing a character string detected by the character string processing detecting procedure into a vocabulary;
A vocabulary weighting processing procedure for performing weighting according to the character string processing for each vocabulary obtained by the character string decomposition processing procedure;
An input conversion learning program for causing a computer to execute a vocabulary registration processing procedure for registering a vocabulary weighted by the vocabulary weighting processing procedure together with the weighting and a reading kana of the vocabulary in a conversion learning database.

(Supplementary note 2) The input conversion learning program according to supplementary note 1, wherein the application includes not only the application that is the target of kana-kanji input conversion but also other applications that are executed in the computer system. .

(Supplementary note 3) The input conversion learning program according to Supplementary note 1 or 2, wherein the character string processing includes character string display, range selection, copy, paste, or kana / kanji input conversion.

(Additional remark 4) The input conversion process detection procedure which detects that the input conversion system in the said computer performed the input conversion process,
When the input conversion process is detected by the input conversion process detection procedure, the vocabulary corresponding to the reading kana that matches the conversion target kana character string input in the input conversion process is read from the conversion learning database, and the weighting The input conversion learning according to any one of appendices 1 to 3, further comprising: causing a computer to execute a conversion candidate transfer procedure that is transferred to the kana-kanji conversion system so as to be displayed as the conversion candidates in a descending order. program.

(Supplementary Note 5) A kana-kanji input conversion candidate learning process in a kana-kanji conversion system that converts a kana character string input in an application into a kanji character string by selecting one conversion candidate from a list of conversion candidates. An input conversion learning method to perform,
A character string processing detection step of detecting character string processing for a character string handled by the application;
A character string decomposing process for decomposing the character string detected by the character string process detecting process into a vocabulary;
A vocabulary weighting process for performing weighting according to the character string process for each vocabulary obtained by the character string decomposition process;
A vocabulary registration processing step of registering the vocabulary weighted in the vocabulary weighting processing step in a conversion learning database together with the weighting and reading of the vocabulary.

(Supplementary note 6) A kana-kanji input conversion conversion candidate learning process in a kana-kanji conversion system that converts a kana character string input in an application into a kanji character string by selecting one conversion candidate from a list of conversion candidates. An input conversion learning device to perform,
A character string processing means for detecting character string processing for a character string handled by the application;
A character string decomposition processing unit that decomposes the character string detected by the character string processing unit into a vocabulary;
Vocabulary weighting processing means for performing weighting according to the character string processing for each vocabulary obtained by the character string decomposition processing means;
Conversion learning storage means for storing the vocabulary weighted by the vocabulary weighting processing means together with the weighting and reading of the vocabulary;
An input conversion learning device, comprising: the conversion learning storage means comprising: a vocabulary registration processing means for registering the vocabulary weighted by the vocabulary weighting processing means together with the weighting and reading of the vocabulary.

The present invention automatically captures a language model in accordance with a character string operation, orders the vocabulary of sentences included in the language model, and enables conversion candidates to be selected from a list of conversion candidates according to the ordering. This is useful when it is desired to perform automatic, easy and efficient kana input conversion.

It is a figure which shows the concept of a system configuration. It is a figure which shows the process example of an automatic learning function. It is a functional block diagram which shows the structure of an automatic learning system. It is a figure which shows the table image of a morphological analysis result data table. It is a figure which shows the table image of a language dictionary table. It is a figure which shows the table image of an event table. It is a flowchart which shows a language dictionary table registration process procedure. It is a flowchart which shows a language dictionary table read-out process procedure. It is a figure which shows the example of a display of the conversion candidate in a language input system.

Explanation of symbols

DESCRIPTION OF SYMBOLS 100 Automatic learning system 101 Event detection determination processing part 102 Target character string reading processing part 103 Morphological analysis processing part 104 Morphological point processing part 105 Storage part 105a Event DB
105b Morphological analysis result data DB
105c Language Dictionary DB
106 Conversion processing detection unit 107 Conversion candidate addition priority display processing unit 200a Web browser 200b E-mail application 200c Editor 300 Language input system 300a Language input application 305c Conversion dictionary DB

Claims (3)

By selecting one conversion candidate from the conversion candidate list, the computer executes a kana-kanji input conversion candidate learning process in the kana-kanji conversion system that converts the kana character string input in the application into a kanji character string. An input conversion learning program for
A character string processing detection procedure for detecting character string processing for a character string handled by the application;
A character string disassembling procedure for decomposing a character string detected by the character string processing detecting procedure into a vocabulary;
A vocabulary weighting processing procedure for performing weighting according to the character string processing for each vocabulary obtained by the character string decomposition processing procedure;
An input conversion learning program for causing a computer to execute a vocabulary registration processing procedure for registering a vocabulary weighted by the vocabulary weighting processing procedure in the conversion learning database together with the weighting and reading of the vocabulary. Input conversion learning that performs conversion candidate learning processing for kana-kanji input conversion in a kana-kanji conversion system that converts a kana character string input in an application into a kanji character string by selecting one conversion candidate from a list of conversion candidates A method,
A character string processing detection step of detecting character string processing for a character string handled by the application;
A character string decomposing process for decomposing the character string detected by the character string process detecting process into a vocabulary;
A vocabulary weighting process for performing weighting according to the character string process for each vocabulary obtained by the character string decomposition process;
A vocabulary registration processing step of registering the vocabulary weighted in the vocabulary weighting processing step in a conversion learning database together with the weighting and reading of the vocabulary. Input conversion learning that performs conversion candidate learning processing for kana-kanji input conversion in a kana-kanji conversion system that converts a kana character string input in an application into a kanji character string by selecting one conversion candidate from a list of conversion candidates A device,
A character string processing means for detecting character string processing for a character string handled by the application;
A character string decomposition processing unit that decomposes the character string detected by the character string processing unit into a vocabulary;
Vocabulary weighting processing means for performing weighting according to the character string processing for each vocabulary obtained by the character string decomposition processing means;
Conversion learning storage means for storing the vocabulary weighted by the vocabulary weighting processing means together with the weighting and reading of the vocabulary;
An input conversion learning apparatus, comprising: the conversion learning storage means comprising: a vocabulary registration processing means for registering the vocabulary weighted by the vocabulary weighting processing means together with the weighting and reading of the vocabulary.

Images