JPH08190551A - Text input device - Google Patents

Abstract

PURPOSE: To improve the text input efficiency by a natural method where operator can use a text input device without paying his attention of his memory independently of his personal memory or the like by providing an input means, a dictionary means, a judging means, an output means, and a control means to perform a specific input processing. CONSTITUTION: An input part 2, a dictionary part 3, a control part 4 which executes a program to control a display part 1, the input part 2, the dictionary part 3, etc., and a memory part 5 are included. Input data is collated with each word in the dictionary in the stage before input of all of character data, namely, in the middle of input, and when not only all of character data coincides with a word in the dictionary but also it is judged based on the collation result including head and end coincidence judgement that input data is a unique word or one of a specific number of words or a word in a specific number of ranges in the dictionary, contents of words registered in the dictionary are read in, and the uninputted part of input data of a desired word is corrected or input data is displaced with dictionary register contents to eliminate a need of following input, and thus, the word is completely inputted by input of a smaller number of data.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a text input device for reducing the text input load in information processing devices, communication control devices and the like.

[0002]

2. Description of the Related Art One of conventional text input methods for reducing input load is to use abbreviations and abbreviations.
For example, there is one that has an abbreviation dictionary, and if a character string of a preset abbreviation is input, the registered word corresponding to the abbreviation is fetched from the dictionary and replaced with the input character string to reduce the load.

[0003]

However, in the above case, a desired word is searched by memorizing the abbreviation and pressing a key for instructing the conversion. The efficiency depends on the memory ability of the user. There are many dependent factors. Further, in particular, in text input, a method in which the abbreviation conversion key must be pressed each time, or without pressing the conversion key, for example, all candidate words that match the input character string are displayed and selected from among them, etc. This method is not suitable for continuous text input in practice.

In the present invention, not only when all the character data match, but at the stage before that, that is, in the middle of input, the input data is matched with each word or phrase in the dictionary, and the matching judgment of the head and tail is made. Based on the collation result including, when it is determined that there is only one or a specific number or a specific range number of words in the dictionary, the contents of the dictionary registration word is read, the remaining input portion of the input data of the desired word is corrected, or The input data is replaced by the contents registered in the dictionary, the subsequent input is not required, and the word input can be completed with a smaller number of data inputs. Therefore, it is possible to provide a device that enhances text input efficiency by a natural input operation that is not particularly conscious of dictionary registration contents and does not depend on an operator's memory ability or the like.

[0005]

According to a first aspect of the present invention, input data is collated with a dictionary every time character data is input, and if there are a plurality of words that include the input data or the input data and the top data match, the If the common part of is matched, each time subsequent character data is input, the character data is compared with the tail data of the character data of the plurality of words and phrases, and the matching unique or specific number or specific range number of words is found. If there is no match, if there is no match, the character data of each word, after the part that has already been collated with the input data, is the only word including the last input data or a specific number or a specific range of words. It is determined whether there is any, and the original phrase of the data including the input data, which is determined to be the unique number, the specific number, or the specific range number, is output, or the data is combined and output. According to claim 2, each time the character data is input, the input data is collated with the dictionary, and if there is no word that includes the input data or if the input data and the head data do not match, the input data and the head data are input before the character data is input. Of the character data of the word that was determined to match the data or contain the input data, after the part that has already matched the input data,
Determine whether there is a unique number, a specific number, or a specific range number of words that contains the last input character data, and output the original phrase of the data that was determined to be the unique, specific number, or a specific range number that contains the input data Or combine and output the data. In claim 3, when the character data is input, the dictionary is indexed to determine whether the input data is equal to the leading and trailing characters and other characters between the leading and trailing characters are concatenated with the matching character data. Included regardless of the number of unique or specific number or specific range,
When the data in the dictionary means is detected, the original phrase is fetched from the dictionary and output, or the data is synthesized and output.

[0006]

According to the first aspect, each time character data is input by the input means, it is added after the character data being input, and the input character data is collated with each word / character data in the dictionary means. If there are multiple words that include the input character data or the input data and the beginning data match and the common parts that they have match, when inputting the character data thereafter, the input character data and the above multiple words The suffix data is compared to find a matching unique number, a specific number, or a specific range of words. If they do not match, in the character strings after the part of the plurality of words that has been matched with the input character data, a unique or specific number or a specific range of words including the last input character data is searched.
If there is a unique number, a specific number, or a specific range number of words, it is corrected from the dictionary means. In claim 2, as a result of collating the input character data with the character data of each word in the dictionary means, if there is no word that includes the input character data or that matches the input character data, it is not the first character data. , In the character data of the dictionary word, look for the unique or specific number or specific range number of words that match the input character data in the character data after the part that has already matched the input character data up to the last, and if there is,
Correct it from the dictionary means. According to claim 3, when the character data is input, the dictionary is indexed, and the unique or specific number or the specific range number of words including the input data and the leading and trailing characters and including other character data between the leading and trailing ends are detected. If so, correct the rest from the dictionary.

[0007]

FIG. 1 is a block diagram showing an example of a text input device of the present invention. In FIG. 1, the text input device is
A display unit 1 made of a liquid crystal or the like for displaying input contents, edited results, etc., an input unit 2 made up of a keyboard for inputting character information, a reading unit including other handwriting input / recognition, R
ead Only Memory and Random A
access memory, a control unit 4 for executing a program for controlling the display unit 1, the input unit 2, the dictionary unit 3 and the like, and a memory unit 5 for storing a control program, an input text and the like. including.

2, FIG. 3, FIG. 4, FIG. 5, FIG. 6, FIG. 7, FIG. 8, FIG. 9, and FIG. 10 are flow charts for explaining the operation of the present embodiment. An input processing example will be described. The determination processing of the specific number or the specific range number of words also determines the specific number or the specific range number at the time of determining whether or not it is unique (single) in the following description.

At the start of processing, F001 initializes the contents of the program counter, flags, work area and the like. Next, in F002, character data is input.

At F003, it is judged whether or not the input content at F002 is an end designation code, and if it is the end code, F003.
The termination processing is performed at A and the processing is stopped. If not the end, F00
4 and subsequent processing.

In F004, it is checked whether or not the input content indicates a term delimiter, that is, whether or not it is an input term delimiter, and if so, the process proceeds to F004A, where the input term end processing is performed and the T flag is set. After turning off the F004
In B, the input phrase is added to the rear part of the input sentence storage area until then, and the process returns to the input process of F002. If the determination content in F004 is other than the input phrase separator, the process proceeds to F005.

In F005, the processing is divided depending on whether or not the input content is a period. F005A for period
F002, after initializing (clearing) the input sentence storage area before the input phrase (for ending the sentence),
Return to the input processing of. If it is not a period, the process is F0.
Proceed to 06.

In F006, it is determined whether or not the input content is normal character data, and if it is character data, the process proceeds to F006A. If it is not character data, F006
If the judgment result is not an ESC code, proceed to C judgment,
Since it is processing of other function codes and has no direct relationship with the description content of this method, description thereof will be omitted.

If the determination result of F006C is an ESC code, the process proceeds to F006D, and immediately before, it is determined whether or not a correction process for compensating the rest of the input character data from the dictionary has been performed, and Y
If es, in F006E, the process of returning to the input / display state immediately before correction is performed, and the process returns to the input of F002. If No, do nothing in this case and enter the next character data.
Return to F002.

If the determination result of F006 is normal character data, the process proceeds from F006 to F006A to display the input character data, and then in F006B, after the input character data before that, input character data is displayed. To form new character data. After that, the process proceeds to the determination of the T flag of F007.

In F007, it is determined whether or not the T flag indicating whether or not there is a word to be indexed is still on. If on, includes previously entered character data values,
Since it means that there are no more words in the dictionary to be indexed as to whether or not it is the only word in the dictionary, the processing returns to the input processing of F002. If the T flag is off, ie the target phrase to be indexed still exists in the dictionary,
Proceed to the dictionary index process of F008.

In F008, using the input character data,
Search the dictionary. At the same time, the T flag is also turned off to show that there are more words to be indexed. The contents of the search process will be described in S001 and later described below. After that, the process proceeds to F008A, and as a result of the dictionary index in F008, it is determined whether the input character data is included, or whether the input character data and the head data are the same and there is a candidate word that can be the only word in the dictionary. . If there is a candidate phrase, the process proceeds to F008B. If there is no candidate phrase, the process is F
Proceed to 010A. Next, in F008B, it is determined whether or not it is the only phrase. If it is unique, the process proceeds to F009B. If not unique, the process proceeds to F009. In F009,
The input data is collated with the plurality of candidate word / phrase data.
First, by matching one by one from the beginning, it is determined whether or not other input character data that have the same beginning and that follow, regardless of whether the matching character data are concatenated, have candidate word / phrase data included. Next, the input data and the plurality of candidate word / phrase data are matched one by one from the tail, and other input character data having the same tail and the following character data are connected regardless of whether the matching character data is concatenated. First, the presence / absence of candidate word / phrase data included is determined. As a result, the next F00
Perform at 9A. If it is determined in F009A that there is only one data, the process proceeds to F009B. If it is determined that there is a plurality, the process proceeds to F010A.

In F009B, a buzzer is sounded to notify the success of the index, and in the next F009C, the currently displayed contents are saved and correction / display is performed using only the data. F
In 009D, the input word is terminated to input the next word, the process proceeds to F009E, the input phrase for correction / display is added to the input sentence area, and then the process returns to F002. next,
Depending on the determination result of F008A or F009A, the process proceeds to here, and in F010A, a stem / abbreviation determination process is performed. When branching from F008A to here, the actual processing is S021 and thereafter. The details of this processing will be described in S020 and the subsequent steps.

Next, in the determination of F010B, if the specific processing is unsuccessful, the process returns to the input of F002. If the identification is successful, the process proceeds to F010C, and it is determined whether or not the identification is successful.
Proceed to the correction process after B. If the determination of F010C is not unique, the process proceeds to F011 and thereafter.

If the judgment result of F010C is not unique,
The process proceeds to F011, and it is determined whether or not the word or phrase to be indexed still remains. If it remains, the process returns to the input process of F002. If there are no more words to be indexed, the T flag is turned on in F012, and it is indicated in the program that the index is unsuccessful. Then, in F012A. A buzzer informs the user that the index has failed, and the process returns to the input process of F002.

S001 is the entrance of the dictionary index program. In S002, it is determined whether or not there are any more index words in the dictionary. If there is no more index words, the process proceeds to S002A, the flag without index words is set to ON, and this subprogram exits (S002B).

If there is still an index word in the judgment of S002,
Proceeding to S003, the phrase at the intermediate position between the upper limit and the lower limit of the index target area is taken out, and the process proceeds to S004. In this case, the upper limit refers to the limit in the direction of large values of character data, and the lower limit refers to the limit in the direction of small values of character data.

In step S004, the head character data of the word / phrase fetched from the dictionary and the value of the input character data are compared to determine whether the head character data of the word / phrase on the dictionary side is larger than the input character data. If it is larger, the process proceeds to S005, and since the dictionary word is larger, there is a possibility that there is only one word in the lower limit direction, that is, in the lower half area of the index target area. Therefore, the index target area is narrowed to the lower half. . After that, the process is S0
Return to 02.

If it is determined in step S004 that the dictionary word is not larger, the process proceeds to step S006. In step S006, the values of the input character data and the first character data of the word extracted from the dictionary are compared, and the dictionary word It is determined whether the leading character data and the input character data are equal. If they are equal, the process proceeds to S007, and it is determined whether or not there is a unique word or phrase. If there is no unique phrase, the process proceeds to S012 and subsequent steps. If the unique word is present, the process proceeds to S008, and the unique word flag indicating that the unique word is present in the dictionary is turned on and the dictionary index program is exited. S006
If they are not equal, the processing proceeds to S009.

In S009, the values of the first character data of the words and phrases retrieved from the dictionary are compared with the values of the input character data to determine whether the first character data of the words and phrases on the dictionary side is smaller than the input character data. If it is smaller, the process proceeds to S010,
Since the dictionary word is smaller, there is a possibility that there is only one word in the upper limit direction, that is, in the upper half area of the index target area,
Therefore, the index target area is narrowed to the upper half. After that, the process returns to S002. If the result of the determination in S009 is not small, it is determined that something abnormal has occurred, the process proceeds to S011, and error processing is performed. (Here, description is omitted because it is not directly related to the present invention).

If there is no unique phrase in the determination of S007, the process moves to this step, and in S012, the range of the dictionary phrase equal to the input character data is specified, so that the upper half of the current / index target area in the dictionary is specified. At this time, a process of searching for a word of the first character data larger than the input character data is performed.

Next, if it is determined in S013 that there is no word of the first character data larger than the input character data in the upper half area, the process proceeds to S014, in which case the upper half area is equal to the input character data. Since it is occupied by the dictionary word of the first character data, the upper limit at the time of executing S012 is set as a new upper limit as it is, and the process proceeds to S016 to set the lower limit. If it is determined in S013 that there is a phrase of the first character data larger than the input character data in the upper half area, the process proceeds to S015.

In step S015, the position of the dictionary word in the first character data larger than the input character data is used as a new upper limit of the dictionary index. Thereafter, the process proceeds to next S016.

In step S016, the lower half area of the dictionary is searched for a word of the leading character data smaller than the input character data. Thereafter, the processing proceeds to S017.

In S017, it is determined whether or not there is a phrase of the first character data smaller than the input character data. If there is no phrase, the process proceeds to S018. In this case, the lower half area is occupied by the phrase equal to the input character data. S016
Apply the same lower bound as when executing and set a new lower bound. The process then exits the dictionary index program.

If the result of determination in S017 is that there is a phrase of the leading character data smaller than the input character data, the processing moves to S019, and in S019, the position of the phrase of the leading character data smaller than the input character data is applied. Then set it as the new lower bound and exit the dictionary index program.

Steps from S020 onward are the procedures of the stem / abbreviation determination process referred to in F010A. In S020,
It is determined whether or not the common parts of the plurality of candidate phrases, that is, the stems match. If they match, the process proceeds to S020A,
In S020A, it is checked whether or not there is the only candidate word having the last character data equal to the last input character data. If there is not, the process proceeds to S021, and if there is,
In S020B, the specific success flag and the unique word / phrase flag are set to on, and this determination processing subprogram is exited.
If the result of determination in S020 is that they do not match, the process proceeds to S021.

In S021, it is determined whether or not the input character data is finally included in the character data of the candidate phrase after the portion that has been collated with the input character data. If it is included, the process proceeds to S021A to check if the corresponding phrase is single. If not, the non-corresponding phrase is excluded from the subsequent collation target in S021B, and this subprogram is exited.
If it is single, the specific success flag and the unique phrase flag are set to ON in S021C, and then this subprogram is exited.

If it is determined in the above S021 that the input character data is not included at the end, the specific failure flag is set to ON in S022, and this subprogram is exited.

11 and 12 show examples of the contents of the index dictionary used for text input according to this embodiment. Referring to FIG. 12 and an example of the second handwriting dictionary, first, in step 1, character stroke data and the like are input. For example, /-\ |. ． ． Enter the stroke as shown. ｀ Then,
In step 2, the input data is added after the input data, and the input data is collated with the dictionary. If the dictionary contains the input data or the input data and the top data are equal,
If there is only one data, or if there is only one data in which the input data is the same as the leading / trailing data and contains other characters, a correction process is performed to replace it with the input data. If there is no corresponding data in the dictionary, after displaying no registration, the process returns to step 1 and data is input again.

In the example of the dictionary of FIG. 12, assuming that "correct" is input, for example, when the first character "" is input, the dictionary words # 3 (correct), # 4 (updated) are input. ) Exists. When the next "|" is entered, only # 3 is applicable. Therefore, the original character string "correct" can be retrieved from the dictionary and replaced with the displayed content.

[0037]

According to the text input method of the present invention, in the middle of text input, in claim 1, every time character data is input by the input means, the character data is added after the character data being input, and the input character is added. If the data and each word / character data in the dictionary means are collated, and there is a plurality of words / phrases that include the input character data or the input character data and the first character data match and their common parts match, When inputting the character data of, the input character data and the last character data of the plurality of phrases match, or
If there is a unique or specific number or a specific range number of words including the last input character data among the character data after the portion already matched with the input character data, it can be corrected from the dictionary means and the subsequent input can be omitted. In claim 2, as a result of collating the input character data with the character data of each word in the dictionary means, if the word contains the input character data or there is no word that matches the input character data, unless it is the first character data, , If there is only one or a specific number or a specific range number of words / phrases that include the input character data in the character data after the part that has already matched the input character data up to the last in the character data of the dictionary word, from the dictionary means You can correct it and omit the subsequent input. According to claim 3, when the character data is input, the dictionary is indexed so that the input data and the leading and trailing characters are equal, and other characters between the leading and trailing characters are included regardless of whether or not the matching character data is concatenated. If there is only one, a certain number of words, or a certain range number of words, correct the rest from the dictionary. By the above processing, the text input efficiency can be improved by a natural method that can be used without depending on the memory ability of the operator and without being too conscious of that.

[0038]

[Brief description of drawings]

FIG. 1 is a block diagram of a processing device that realizes a text input device according to an embodiment of the present invention.

FIG. 2 is a flowchart relating to processing of input, editing, display, and dictionary index portion which is a part of the text input device according to the embodiment of the present invention.

FIG. 3 is a flowchart related to a correction process which is a part of the text input device according to the embodiment of the present invention.

FIG. 4 is a flowchart relating to stem / abbreviation determination processing, presence / absence of index words, etc., which is a part of the text input device according to the embodiment of the present invention.

FIG. 5 is a flowchart relating to determination of presence / absence of an index word / phrase and extraction of the dictionary word / phrase of the dictionary index subprogram which is a part of the text input device according to the embodiment of the present invention.

FIG. 6 is a flowchart relating to a comparison result (larger case, equivalent case) of the dictionary word and the input character data of the dictionary index subprogram which is a part of the text input device according to the embodiment of the present invention, and the corresponding processing. .

FIG. 7 is a comparison result (when small) of the dictionary word and the input character data of the dictionary index subprogram which is a part of the text input device of one embodiment of the present invention, the corresponding processing, and the word in the upper half area. It is a flow chart concerning search processing.

FIG. 8 is a flowchart for setting a new upper limit in the dictionary index subprogram which is a part of the text input device according to the embodiment of the present invention.

FIG. 9 is a flowchart relating to a new lower limit setting in the dictionary index subprogram which is a part of the text input device according to the embodiment of the present invention.

FIG. 10 is a flowchart relating to a stem / abbreviation determination process which is a part of the text input device according to the embodiment of the present invention.

FIG. 11 is an example of a handwriting dictionary.

FIG. 12 is an example of a second handwriting dictionary.

[Explanation of symbols]

 1 display unit 2 input unit 3 dictionary unit 4 control unit 5 memory unit

Claims (3)

[Claims] 1. Input means for recognizing and inputting character information, dictionary means for storing a plurality of words consisting of character stroke / radical / other basic component data and original phrases, and character data from said input means. For each input, the input data is collated with the dictionary means, and whether or not a word including the input data and having a unique number, a specific number, or a specific range number exists in the dictionary means, or The top data match,
It is determined whether a unique number, a specific number, or a specific range number of words exist in the dictionary means, and whether a plurality of character strokes, radicals, and other basic component data including the input data exist, When there are a plurality of character strokes, radicals, and other basic component data whose input data and head data are the same and the plurality of data groups have equal parts including the input data, Returning to the input of character data, at the time of subsequent data input, it is judged whether or not the input data matches the suffix character data of the plurality of character strokes, radicals and other basic component data, and if they do not match. Of the plurality of character strokes / radicals / other basic constituent element data, it is determined whether or not there is data including the last input character data after the portion already collated with the input data, and as a result, it is determined that Constant or a specific range of the number of character strokes,
Determining means for determining whether or not radical / other basic component data exists, and outputting the original phrase of the data determined to be unique, a specific number, or a specific range number by the determining means, or A text input device comprising: output means for synthesizing and outputting an output character according to the judged data; and control means for controlling each of the means. 2. Input means for recognizing and inputting character information, dictionary means for storing a plurality of words and phrases, radicals, other basic constituent element data, and original phrases, and data input from said input means. Each time, the input data is collated with the dictionary means, and a plurality of character strokes including the input data
If there is radical / other basic component data or a plurality of character strokes / radicals / other basic component data in which the input data and the head data match, the process returns to the data input from the input means to return the input data. If there is no character stroke, radical, or other basic component data that includes or starts with the input data, the input data is input at the previous data input, unless it is input of the start data. It is included or the character string / radical / other basic component data in the dictionary means determined to match the input data at the beginning part is input last after the part already collated with the input data. Judge whether there is only one data including character data, and if there are multiple data,
Returning to the input of character data from the input means, for each subsequent input of character data, a determination means for determining whether or not there is a word of the unique number, a specific number, or a specific range number; and a unique or specific number or specific range An output means for outputting the original phrase of the data determined by the determination means as a number, or for synthesizing and outputting an output character according to the determined data, and
A text input device including control means for controlling each of the above means. 3. Input means for recognizing and inputting character data, dictionary means for storing a plurality of words consisting of character stroke / radical / other basic component data and original phrase, and character data from said input means. For each input, the input data to which it is added is collated with each word of the dictionary means, whether the input data is included or the input data is equal to the head data, and a word of a unique number, a specific number, or a specific range number, When it is not possible to identify character strokes, radicals, and other basic component data that include the input data or have the same start data as the input data, determine whether the dictionary means exists or not. Match the data of each word of the above with the input data from the beginning,
The first character data matches, and it is determined whether there is data that contains other character data that follows, and at the same time, the same data is used to match from the tail, and the character data at the tail match, and other data before it It is determined whether or not there is data including the character data, and as a result, the input data and the character data at the beginning and the end match, and the other character data is included regardless of whether or not the matching character data is concatenated. The word in the dictionary means to be matched, which has been determined to be matched, that is, the character stroke, radical, and other basic constituent element data, exists in the dictionary means in a unique number, a specific number, or a specific range number. Determining means for determining whether or not, and outputting the original phrase of the data determined by the determining means, or
A text input device comprising an output means for synthesizing and outputting an output character according to the judged data, and a control means for controlling the respective means.