KR20230060649A - korean disambiguation swipe sentence input system for search - Google Patents

Abstract

The present invention facilitates the input of non-character phrases and sentences by applying a word prediction input method, which is generally used as a character input method in English-speaking culture, not only to letters but also to symbols and spaces. Furthermore, in the case of Hangul, the present invention provides a method of dramatically reducing the size of a database by configuring grammatical blank keys.

Description

Korean sentence prediction swipe input system {korean disambiguation swipe sentence input system for search}

Prediction input method

As mobile phones began to be used, text calls began to become commonplace, and as smartphones changed, text calls became more common than voice calls. Furthermore, smart phones do not simply transmit messages but function as a means of multimedia communication, resulting in a large number of non-word inputs such as web addresses and e-mails. Unlike general text input, such non-word input is inconvenient because there are cases in which characters and symbols must be input alternately. Nevertheless, when using a full keyboard of a computer, it is easy to input characters and symbols, but in a mobile device where only two fingers are used to input, it becomes much more difficult than when only characters are input. In particular, it is not difficult to input characters and symbols using a keypad composed of 12 keys based on the numbers 0 to 9 and * and #. In order to input only alphabetic characters, English culture has been using the word prediction input method (Disambiguity Input Method) using 12 keypads, but the above-mentioned input of phrases in which alphabets and symbols are mixed is inconvenient that letters and symbols must be input separately Ham is still there. Against this background, the present invention is developed for the existing 12-key keypad and allows the input of words, symbols, numbers, and even spaces by using a disambiguation input method widely used in the English-speaking world. We want to provide an input system.

In the case of a qwerty keyboard in which all letters and symbols are assigned to each key, web addresses or passwords in which letters and symbols are mixed can be easily entered, but when the keyboard input space is limited, such as a wearable device smart watch, You have to consider keyboards with numbers. Moreover, as a character input device required for devices for VR (virtual reality) and AR (augmented reality) that have recently emerged, the qwerty keyboard has limitations in usability, and a new input device is required. Unlike smartphones, these wearable devices are used for limited purposes because they do not have enough space for text input. Headsets and glasses developed for AR provide a sufficient screen compared to smart watches, but it is difficult to provide a keyboard for text input because it is difficult to input through touch (tactile sense) like a smartphone. In this regard, the present invention aims to provide an input system having about 10 keys that overcomes the limitations of wearable devices and has input efficiency.

As mobile phones were used, voice-oriented communication gradually developed into message-oriented communication. Accordingly, the qwerty keyboard used in computers was transformed into 12 keypads due to the limited space of the mobile phone, and an appropriate input system was developed. In particular, in the English-speaking world (including China and Japan), an ambiguous key in which several characters are assigned to each key is configured in a keypad of a mobile phone. A disambiguation input method is devised to extract and input words composed of characters assigned to these keys by pressing these non-confirmed keys once using non-confirmed keys in which several characters are assigned to one key. and has been widely used. The word prediction input method is a method of reducing the number of presses by allowing a desired word to be input even if a non-deterministic key designated with several letters is pressed only once. Referring to the keyboard shown in FIG. 1 as an example, in the case of a multi-tapping method where you press the key several times when you want to input the word 'boy', you press the 'abc' key twice to input 'b'. Press the 'mno' key three times to input 'o' and finally press the 'wxyz' key three times to input 'y' to enter 'boy'. On the other hand, in the word prediction input method, in order to input 'boy', 'b', 'o', and 'y' constituting 'boy' are designated keys, that is, 'abc', 'mno', and 'wxyz' non-confirmed keys, respectively. When pressed once in order, words that can be made up of combinations of characters assigned to these keys (e.g. 'any', 'amy', 'boy', 'box', 'cow', 'bow', 'cox') ', 'coy', etc.) is extracted from the dictionary database and displayed as a predicted word (indicated in italics in the key) as shown in FIG. For the word prediction input method, as shown in the above example, a dictionary word database in which words including 'boy' are registered must be prepared and used.

In the present invention, the composition of the keyboard is composed of non-confirmed keys including letters, symbols, numbers, and even spaces so that not only words recorded in such a dictionary database but also contents including phrases, sentences, and even clauses can be entered. With this configuration, it provides an input system with the same input efficiency as a qwerty keyboard even with a keyboard composed of about 10 keys.

The configuration of the present invention is to enable the prediction input method to input a whole sentence including a phrase including a symbol and even a space character ('space') from simple word input. For example, in order to enter the name "Arnold J. Toynbee", in a general prediction word input method, 'Arnold', 'J.', and 'Toynbee' are predicted in a dictionary database in order, respectively, and then entered, followed by a space character 'space'. Enter between words to complete the input of the name. However, in the configuration of the present invention, when a key input of the ambiguous key sequence shown in Equation (3) [Equation (3-1) to Equation (3-6)] is made, as shown in FIG. 5, 'Arnold J. The name 'Toynbee' is displayed in the keyboard area as a predictive phrase (in italics) so that it can be selected/entered.

'abc'-'pqrs'-'mno'-'jkl'-'def'-...(3-1)

'Sym' (an ambiguous key representing symbols containing the 'space' character) - ...(3-2)

'jkl'- ...(3-3)

'Sym' - ...(3-4)

'Sym' - ...(3-5)

'tuv'-'mno'-'wxyz'-'mno'-'abc'-'def'-'def' ...(3-6)

That is, in the word prediction input method, 'Arnold', 'J.', and 'Toynbee' are each predicted as words and then selected in three steps, whereas in the present invention, it is reduced to one step to improve the convenience and speed of input. it will add up Even if you enter only the ambiguous key sequence of Equation (4), in which the ambiguous key corresponding to the first letter of each word and the 'Sym' key representing the symbol (corresponding to L11 in FIG. 1a) are mixed, 'Arnold J. If it is registered in the database, it is extracted as a prediction phrase and it is possible to input the phrase (sentence) of 'Arnold J. Toynbee'.

'abc'-'Sym'-'jkl'-'Sym'-'Sym'-'tuv' ...(4)

In this context, the phrase prediction input method of the present invention using the 'Sym' key identically to the character amibiguous key has an effect of simplifying word prediction input. Furthermore, the input process to predict 'Arnold Toynbee' as a prediction phrase can be simplified as shown in Equation (5).

'abc'-'Sym'-'tuv'-'mno'- ...(5)

That is, for 'Arnold', enter only the first letter 'abc', then enter the 'Sym' key corresponding to 'space' and enter the letters of 'Toynbee' corresponding to the last name in order, then 'Arnold Toynbee' will be displayed as a prediction phrase. It is to provide a method that can be extracted. This will be described in more detail in Examples 5 and 6.

The configuration of the present invention is applied not only to the phrases examined above but also to sentences as follows. That is, when a key input corresponding to Equation (6) is made to input 'Where are you going?', the first letter of the first word constituting a sentence including 'Where are you going?' is 'w, x, One of y, z', the first letter of the second word is one of 'a, b, c', the first letter of the third word is one of 'w, x, y, z', the first letter of the fourth word Sentences that are one of 'g, h, and i' are listed, and 'Where are you going?'

'wxyz'-'Sym'-'abc'-'Sym'-'wxyz'-'Sym'-'ghi' ...(6)

This means that when a key input corresponding to the ambiguous key sequence 'abc'-'mno'-'wxyz' is made to input 'boy' in the word prediction input method, 'any' and 'amy' are predicted words including 'boy'. , 'cox', 'box', 'cow', 'bow', 'cmx', 'coy', 'coz', etc. to be selected/input, and furthermore, to input 'important', ambiguous key sequence ' Even if a key input corresponding to ghi'-'mno'-'pqrs'-'mno'-'pqrs'-'tuv' is made, it is the same principle that predicts not only 'import' but also 'important' so that it can be entered. .

When the above configuration is applied to a smart watch, which is a wearable device representing mobile devices after a smartphone, as shown in FIG. 9A, the efficiency is remarkable. In the case of a smart watch, it has a circular shape rather than a square. Correspondingly, a keyboard in the form shown in FIG. 9B is also provided so that the convenience and fast input speed of character input made in a smartphone can be implemented in a wearable device.

In this context, input of a web address essential for internet search can be easily performed. A web address such as 'www.fda.gov' may also be included. If there is an ambiguous 'Sym' key designated with symbols including '.', and key input is performed in the order shown in the following equation (1) to input 'www.fda.gov', as shown in FIG. 1(c) Likewise, 'www.fda.gov' is displayed as a prediction list (displayed in italics in the keyboard) so that it is entered when selected. That is, 'www.fda.gov' can be input with a key input corresponding to Equation (1) without having to change from character mode to symbol mode to input the symbol '.'.

'wxyz'-'wxyz'-'wxyz'-'Sym'-'def'-'def'-'abc'-'Sym'-'ghi'-'mno'-'tuv' ...... (One)

That is, 'www.fda.gov' can be input with only 11 keystrokes without conversion from character mode to symbol mode. And the keyboard shown in Figure 1 can be replaced with a keyboard consisting of 9 keys shown in Figure 9, and as a result, even with 9 keys, you can easily enter web addresses and character-symbol mixed phrases such as passwords as in qwerty keyboar. We want to provide you with a way to do it.

In addition, the details of the present invention will be described through definitions of terms to be used below.

Terms real example ambiguous key 'abc', 'def', 'ghi' ambiguous key sequence 'ghi'-'tuv'-'wxyz' numeric code '0', '1', '2' numeric code sequence '99902210368'

An ambiguous key indicates key input of the predictive input method by setting several characters to one key and pressing the key to mean all of the designated characters without selecting one of the designated characters. That is, as shown in the second column of Table 0, all characters assigned to the key are displayed within single quotation marks ('...'). The input sequence of these ambiguous keys is called 'ambiguous key sequence', and the conversion of ambiguous keys into numbers to convert them into numbers is called 'numeric code'. The relationship between the ambiguous keys in Table 1 and the corresponding 'numeric code' is set based on the key arrangement of the keyboard shown in Figure 1a, and the relationship in Table 1 changes when the key arrangement of the keyboard is changed. Therefore, 'ambiguous key sequence' expressed as ambiguous key is converted into 'numeric code sequence' using 'numeric code'. Therefore, the 'ambiguous key sequence' of equation (1) is converted to the numeric code sequence of equation (2) below. '99902210368'.....(2)

< Conversion relationship between ambiguous key and number code > ambiguous key
'abc'
'def'
'gi'
'jkl'
'mno'
'pqrs'
'tuv'
'wxyz' numeric code
One
2
3
4
6
7
8
9 ambiguous key
'Num'
'Sym' numeric code
5
0

The predictive input system examined above has been used in English-speaking languages based on the alphabet. Therefore, when applying the predictive input system to Hangul, there is difficulty in using it. The reason is that, unlike alphabet languages, in Hangul, words used as subjects and verbs are combined with postpositions and endings, resulting in thousands of variations. This is because the amount of the dictionary database for the predictive input system is vast. For example, in the case of English, when examining the sentence 'I went to school.', 'went' used as a verb does not change as a verb. However, in the case of Korean, when looking at 'I went to school' as a corresponding sentence, the verb 'go' is a combination of the stem 'go' and '-was', '-were', '- But, there may be hundreds or thousands of them. The meaning corresponding to these endings is conveyed by adding a separate word in English. 'had gone' is composed of 'have gone', 'had gone', and 'although (I) went', so 'have' 'had' already registered in the dictionary database ' and 'although' are used to indicate the meaning, so words added to the dictionary database do not increase. On the other hand, in the case of Hangeul, 'gone', 'gone', and 'gone' must be registered as separate words, resulting in an increase in the amount of database. There is no problem if there are only one or two of these, but if the number reaches thousands through suffix changes, a problem arises in that the size of the database increases thousands of times.

In the case of Hangul, the same problem occurs in the subject. As seen in the sentence 'Flowers bloom.' ', 'flowers', 'flowers', 'flowers', 'flowers', 'to flowers', 'like flowers', 'flowers', 'flowers', etc. A problem arises in that the number of words to be combined and recorded in the dictionary database as a single word increases in proportion to the type and number of investigations. In other words, if the number of postpositions that can be combined with indirect nouns is thousands of, the amount of words to be registered in the dictionary database increases thousands of times, and the capacity of the storage device for data storage increases proportionally. A problem arises in that the time taken to search the dictionary database increases thousands of times. In the case of English, since postpositions that are combined with Hangul words or endings that are combined with verbs use separate words to convey their meaning, the words corresponding to the postpositions and endings of Hangul are registered in a private database so that they can be combined with other words differently from Hangul. Since they do not combine to create another compound word, the amount of the dictionary database is relatively small. For example, if the word 'To Seoul' is expressed in English, it becomes 'To Seoul'. In English, 'To' and 'Seoul' are separated by a space ('space'), so 'To' is one in the dictionary database It is registered as a word and combined with words representing other places, used as 'To Busan', 'To Inchon', etc. In the word prediction input method, 'To', 'Busan', and 'Inchon' are predicted as words, respectively, There is no need to register 'Busan' and 'To Inchon' in the dictionary database as separate vocabularies. On the other hand, 'Seoullo' is not predicted as a word because 'Seoul' and 'Lo' are not distinguished from each other unlike in English, so 'Seoullo' is not predicted as 'Seoullo'. must be registered in the dictionary database, and 'to Busan' and 'to Incheon' must be registered in the dictionary database, respectively, to be able to be predicted as words. Therefore, instead of registering the words generated by the combination of these words and postpositions in the dictionary database, register the words and postpositions as different words in the dictionary database like English, and create a grammatical space to be used like English. The present invention provides a method for reducing the number of Hangul words recorded in a dictionary database by utilizing.

Until now, in the field of information and communication, the rules for input/output of characters in computers have defined each character as a code, and input/output has been performed using this code. However, in the present invention, a unique code ('numberic code' in Table 1) as shown in Table 1 is given to non-deterministic keys 'abc', 'def', etc. to which a number of characters are designated, and used for input / output of characters. Bring in the input system. However, what is different from the past is that the 'space' character ('space') is also included in the non-deterministic key, providing a way to easily output contents expressed as letters, numbers, and symbols, especially for tasks such as Internet searches. It provides the convenience of input so that content existing on the Internet can be easily found with only about 10 keys. In other words, it provides an input system that can replace the qwerty keyboard.

And in the case of Hangeul, it was difficult to use it because the dictionary database for the predictive input system was vast due to the investigation of the phrasal verb and the change of the ending of the verb. However, by creating a 'grammatical blank', the 'postposition' of a verb and the 'suffix' of a verb are recorded in the dictionary database as independent words, so that the word prediction input system can be easily used in Korean.

Figure 1 - Key input sequence for entering 'www.fda.gov' and a state displayed on the screen predicted as key input when 'www.fda.gov' is registered in the database
Figure 2 - Situation in which prediction words are displayed on the screen after key input to enter 'boy'
3 and 4 - process of inputting '123@ivy.net' according to the configuration of the present invention
5 and 6 - Process of inputting 'Arnold J. Toynbee' according to the configuration of the present invention
Figure 7 - Process of inputting 'Where are you going?' as a sentence prediction input method
Figure 8 - The process of entering 'www.fda.gov' into the search box as a phrase prediction input method
Figure 9 - Application of a 9-key keyboard for sentence prediction input to a smart watch
10 - Non-extended key input keyboard with 'sym' [symbol and 'space'('space') key and designated] key and menu expansion key assigned to keys to which characters are not designated in the form of a keyboard with 9 keys
Figure 11 - Example showing part of an address book for the Chicago area
Figure 12 - The process of registering and entering "My name is HanAll."
Figure 13 - Symbol input process in the state in which sentence prediction is made
Figure 14 - Configuration of a circular keyboard with independent 'space' and 'sym' keys
Figure 15 - Rectangular keyboard with independent 'space' and 'sym' keys
Fig. 16 - Remote control with 8-way keys

<Input 'boy' by word prediction input method>

2 is a prediction including 'boy' on the touch screen screen when keys are pressed in order according to the ambiguous key sequence ['abc'-'mno'-'wxyz'] to input 'boy' as a word prediction input method It shows the state in which the word is displayed. In these prediction words, the first letter of each word is one of 'a, b, c', the second letter is one of 'm, n, o', and the third letter is 'w, x, y, z' As a word composed of one, it is displayed by extracting what is recorded in the dictionary database according to the frequency of use.

Figures 2 (a) and (b) are cases where the prediction word is displayed inside the keypad, Figure 2 (c) is a case where the prediction word is shown in a separate area above the keypad. In the case of FIG. 2(c), in order to input a predicted word, touch the area where the word to be input is displayed among the predicted word list displayed above the keypad. In the case of FIGS. 2 (a) and (b), since the predicted word is displayed inside the keypad, touching the area where the predicted word is displayed corresponds to an operation of pressing each key, so a method for inputting the predicted word in this case After moving from the black key in the center of the keypad to the key on which the predicted word is displayed by dragging, when the finger is released, the predicted word displayed on the key is input. In the case of FIGS. 2A and 2B , input may be input even if the finger moves apart after moving a certain distance regardless of the direction while touching the key on which the predicted word is displayed. When the prediction word is input by one of the above two methods, the central black key L22 may be used instead of the 'Sym' key L21 of FIG. 2 . Compared to the method shown in FIG. 2C, the word prediction input method shown in FIGS. 2A and 2B does not require a separate area for displaying the predicted word, and thus has the advantage of reducing the keyboard input area. An example of utilizing these advantages is a keyboard in a smart watch shown in FIG. 9 .

Include web addresses such as 'www.fda.gov'. And among the keys used for word search, there is an ambiguous 'Sym' key designated with symbols including '.' in addition to the key designated with letters, so to input 'www.fda.gov', the following sequence of keys When an input is made, as shown in FIG. 1(c), 'www.fda.gov' is displayed as a prediction list (indicated in italics in the keyboard) so that it is entered when selected. That is, 'www.fda.gov' can be input with a key input corresponding to Equation (1) without having to change from character mode to symbol mode to input the symbol '.'.

'wxyz'-'wxyz'-'wxyz'-'Sym'-'def'-'def'-'abc'-'Sym'-'ghi'-'mno'-'tuv' ...... (One)

That is, 'www.fda.gov' can be input with only 11 keystrokes without conversion from character mode to symbol mode. And the keyboard shown in Figure 1 can be replaced with a keyboard consisting of 9 keys shown in Figure 9, and as a result, even with 9 keys, you can easily enter web addresses and character-symbol mixed phrases such as passwords as in qwerty keyboar. We want to provide you with a way to do it.

< Input of e-mail address '123@ivy.net' by phrase prediction input method >

2(c) shows the keyboard configuration of a general word prediction input method. In order to input the e-mail address '123@ivy.net' in this general word prediction input method, the following process is performed.

(i) Enter '123' in number mode

(ii) Switch to symbol mode and input '@'

(iii) Switch to 'English mode and input 'ivy' as word prediction input

(iv) 'Switch to symbol mode to '.' input

[In one of the keys located in the leftmost column of the keyboard in FIG. 2(c)

If '.' is specified, symbol mode switching can be omitted.

* In this case, it is not necessary to switch to English mode in the process of (v)]

(v) Switch to English mode and input 'net' as word prediction input

Even if the input of '123@ivy.net' is made by word prediction input, the input process is inconvenient because the mode must be changed. On the other hand, if the phrase prediction input method is used with the keyboard configuration shown in FIG. 1, '123@ivy.net' is input without changing the mode. In the process, when a key is input according to the ambiguous key sequence corresponding to Equation (7) below, the prediction phrase '123@ivy.net' is displayed in the keyboard area as shown in FIG. 3 (a), and '123@ivy. net' is selected/entered. The method of selecting '123@ivy.net' is the same as the method of selecting the prediction word 'boy' in FIG. 2 . That is, after moving from the black key in the center of the keypad to the key marked '123@ivy.net' by dragging, release your finger or touch the key marked '123@ivy.net' and move a certain distance regardless of the direction. After moving, separate your fingers to input '123@ivy.net'.

'Num'-'Num'-'Num'-'Sym'-'ghi'-'tuv'-'wxyz'-'Sym'-'mno'-'def'-'tuv' ..... (7)

Here, the 'Num' key refers to L31 in FIG. 3 and is an ambiguous key assigned with 10 numbers from 1 to 0.

< How to register a phrase in the dictionary database >

As shown in Example 1, the phrase prediction input method of the present invention provides a fast input method without mode conversion ("character mode <-> symbol mode") compared to the multi-tapping method. Despite these advantages, one disadvantage of the predictive input method is when the word (phrase) to be input is not registered in the dictionary database. And until the key input is actually completed, it is not known whether the word (or phrase) to be input has been registered. As a way to overcome this problem, we will explain how to complete the input by registering the phrase in the database even if the phrase to be entered is not registered in the database when the ambiguous key input is completed.

4 shows a process of registering '123@ivy.net' in the database when '123@ivy.net' is not registered in the database. Actually, the registration process of FIG. 4 starts in the situation shown in FIG. 3(b). That is, in order to input '123@ivy.net', a key input corresponding to equation (7) is performed, but no phrases including '123@ivy.net' are registered in the dictionary database. So, as shown in FIG. 3(b), instead of the prediction word, the numeric code sequence '55503890629' is displayed in the keyboard area, and the phrase 'Reg' is displayed together like the prediction word. The 'Reg' phrase is responsible for the function of performing the registration process shown in FIG. 4 and is always displayed on the keyboard even when the predicted word is extracted to prepare for the registration process. The reason is to prepare for the case where the phrase corresponding to the entered ambiguous key sequence is not already registered in the dictionary database. And, the method of selecting the 'Reg' phrase to execute the registration process is the same as the method of selecting the prediction word in FIGS. 2A and 2B. Therefore, when the phrase 'Reg' is selected, the registration process is executed as shown in FIG. 4 . If this registration process is explained in the case of '123@ivy.net', the corresponding extensions are activated in order according to the numeric codes that make up the numeric code sequence '55503890629', and the input proceeds. For reference, Table 2 shows the composition of the extension version corresponding to numeric code.

<Contents of extension version corresponding to numeric code> numeric code Corresponding extension version contents One Composed of 'a', 'b', 'c', 'A', 'B', 'C' keys 2 Composed of 'd', 'e', 'f', 'D', 'E', 'F' keys 3 Composed of 'g', 'h', 'i', 'G', 'H', 'I' keys 4 Composed of 'j', 'k', 'l', 'J', 'K', 'L' keys 5 Composed of '1', '2', '3', '4', '5', '6', '7', '8', '9', '0' keys 6 Composed of 'm', 'n', 'o', 'M', 'N', 'O' keys 7 Composed of 'p', 'q', 'r', 's', 'P', 'Q', 'R', 'S' keys 8 Composed of 't', 'u', 'v', 'T', 'U', 'V' keys 9 Composed of 'w', 'x', 'y', 'z', 'W', 'X', 'Y', 'Z' keys 0 32 symbols assigned to the qwerty keyboard plus the 'space' character (space)
` ~ ! @ # $ % ^ & * ( ) - _ = + [ ] { } ; : '" , . ? <> / | \

In this background, the first step of the registration process of '123@ivy.net' is the extension version corresponding to the first numeric code '5' of the numeric code sequence '55503890629' of '123@ivy.net' as shown in Figure 4a. This is the process of activating the numeric keypad and inputting '1', the first letter of '123@ivy.net'. [ In FIG. 4, a dotted line circle means a pressing operation. ] Subsequently, in Figures 4b and 4c, since the second and third numeric codes of the numeric code sequence '55503890629' are '5', the numeric keyboard is activated as in Figure 4a, and the second and third numbers of '123@ivy.net' This is the process of inputting the characters '2' and '3'. 4D is a process for inputting '@', in which the symbol keyboard corresponding to the fourth ambiguous key code '0' of the numeric code sequence '55503890629' is activated, and '$@~' including '@' on the symbol keyboard 'This is the process of touching a key. The following is a registration process in the context of FIGS. 4(a) to 4(d).

4E shows that when the '$@~' key is touched, '$', '@', and '~' are extended to the left and right, and '@' is input by removing the finger from the original key position. 4F shows that the keyboard composed of 'g', 'h', 'i', 'G', 'H', and 'I', which are the alphabets of the 'ghi' key, is activated to input 'i'. By touching the designated key, input of 'i' is completed. When 'i' is entered, the keyboard consisting of 't', 'u', 'v', 'T', 'U', 'V' is activated so that the next alphabet 'v' can be entered automatically. 'v' is input by touching the designated key. 4H to 4M are processes of sequentially inputting 'y', '.', 'n', 'e', and 't'.

When this registration process is completed, as shown in FIG. 4(m), the device is internally registered in the dictionary database and at the same time '123@ivy.net' is entered in the input window (L41), and the user inputs the phrase There is no need to worry about whether or not it is registered in the database. After registration of '123@ivy.net', if a key input corresponding to the numeric code sequence '55503890629' [corresponding to Expression (7)] is made, as shown in Fig. 4(n), '123' appears in the keyboard area. @ivy.net' is displayed as a predictive phrase so that selection/input can be made and there is no need to re-register.

<Process of inputting phrases including spaces using the predictive input method>

According to the configuration of the present invention, a process of inputting a person's name 'Arnold J. Toynbee' including spaces is shown in FIG. 5 at once. As the input process of '123@ivy.net' has already been described in Example 2, the ambiguous key sequence for inputting 'Arnold J. Toynbee' using the keyboard shown in FIG. 1 is as shown in Equation (3). Here, the difference between 'Arnold J. Toynbee' and '123@ivy.net' is that the space is treated like a symbol, and the ambiguous key input for the space is made with the 'Sym' key.

When the key input process according to Equation (3) is completed, 'Arnold J. Toynbee' is displayed as a prediction phrase in the keyboard area and is selected/input as in Example 2. If there is no phrase corresponding to equation (3) in the dictionary database for the predictive input method, the numeric code sequence '17664204008696122' of equation (3) is displayed as a prediction word in the keyboard area as shown in Figure 5b and entered in the dictionary database. Indicates that the phrase corresponding to the numeric code sequence '17664204008696122' is not registered. In this case, if you select the 'Reg' phrase shown in the keyboard area, the process of registering this phrase in the dictionary database is executed. Here, the method of selecting the 'Reg' phrase is the same as the method of selecting the predicted word already described, and even if 'Arnold J. Toynbee' is already registered in the dictionary database, the 'Reg' phrase is always registered in the keyboard area so that it is displayed. is to prepare to do The reason is that the dictionary database registers only the phrases that are mainly used, so that the database can reduce the weight of the device's memory, and furthermore, by reducing the size of the database, the phrase prediction process is quickly processed, and all phrases are registered in advance. This is preferable to eliminating the need for additional registration.

6 shows a process of registering 'Arnold J. Toynbee' in a dictionary database. In this registration process, the extensions corresponding to each numeric code constituting the numeric code sequence '17664204008696122' of 'Arnold J. Toynbee' are activated in order according to the rules in Table 2, and the characters and symbols constituting 'Arnold J. Toynbee' are activated. (including space characters) are entered in order. Specifically, when moving from the black key in the center to the 'Reg' key with a touch-and-drag operation in the state of FIG. 5a and removing the finger from the keyboard, the first screen of the registration process shown in FIG. 6a is displayed with 'a', 'b', and 'c'. ', 'A', 'B', 'C' is displayed. If you touch the 'A' key, which is the first letter, 'A' is entered on the screen and the process of being registered in the database starts at the same time. When the registration of FIGS. 6B to 6T is completed, 'Arnold J. Toynbee' is entered into the input window and registered in the database at the same time. In this way, after 'Arnold J. Toynbee' is registered in the database, when the key input is completed in the key sequence of Equation (3), 'Arnold J. Toynbee' is displayed on the screen as a prediction phrase as shown in FIG. / can be entered.

In addition, in order to input the 'space' character (space) included in the 'Arnold J. Toynbee' phrase during the 'Arnold J. Toynbee' phrase registration process, the symbol keyboard shown in FIG. 6g is activated and the black key in the center is touched. [In the registration process of FIG. 6, the dotted line circle indicates the location touched by the finger on the activated expansion keyboard.] As shown in FIG. 6h, a total of 9 symbols including the 'space' key are arranged and 'space' Since the character is assigned to the black key in the center, it is input when you lift your finger without moving to the surrounding key.

In this way, blank characters are treated like characters or symbols, so that phrases and even sentences containing blank characters can be easily entered using the predictive input method.

<Sentence input by predictive input method>

As shown in Embodiment 1 and Embodiment 3, numbers, symbols, and spaces can also be entered through the predictive input method, so sentences can also be easily entered through the predictive input method. For example, when 'Where are you going?' is entered as a general word prediction input method, each word constituting the sentence 'Where', 'are', 'you', 'going' is extracted and entered into a dictionary database, While a 'space' character should be entered between each word, the predictive input method that treats the symbol as the same as a character in the present invention is Equation (8) [Equation (8-1) ~ Equation (8-7) )], as shown in FIG. 7(a), 'Where are you going?' is displayed on the keyboard area like a predicted word, and is selected and entered like a word.

'wxyz'-'ghi'-'def'-'pqrs'-'def' ... (8-1)

-'Sym' ... (8-2)

-abc'-'pqrs'-'def' ... (8-3)

-'Sym' ... (8-4)

-'wxyz'-'mno'-'tuv' ... (8-5)

-'Sym' ... (8-6)

-'ghi'-'mno'-'ghi'-'mno'-'ghi' ... (8-7)

-'Sym' ... (8-8)

< The process of easily registering sentences in the dictionary database >

As shown in FIGS. 4 and 6, if the phrase (word) to be entered in the predictive input method is not in the dictionary database, the method of registering it in the database is to activate the extensions corresponding to each number in the numeric code sequence in order. The letters, numbers, and symbols constituting the phrase were entered one by one in order. There is no problem with this method of registering a phrase when the phrase is short, but as in Example 4, if the sentence to be entered is not registered in the dictionary database and the sentence is long, it is inconvenient to register the letters constituting the sentence one by one. . As a way to overcome this problem, the word prediction input method is used in the sentence registration process. That is, if the sentence “Where are you going?” is not registered in the sentence database after performing ambiguous key input corresponding to Expression 8, “Where are you going?” is not displayed as shown in FIG. 7(b). Instead, the numeric code sequence '93272017209680363630' is shown in the keyboard area as a predicted word. In this case, the 'Reg' key shown in FIG. 7(b) is selected to enter the 'Where are you going?' registration process. The registration process shown in this embodiment differs from the registration process in Example 2 as follows. In Example 2, when the 'Reg' key was selected, the extensions corresponding to the numeric codes constituting the numeric code squence were activated in order based on Table 2, and the characters constituting the characters were registered one by one. On the other hand, in the registration process of the present embodiment, if words or numbers constituting a sentence can be input by the word prediction method, only the parts excluding these words are registered one by one as in the second embodiment. Therefore, the first step of the registration process of this embodiment is the process of dividing the numeric code sequence of a sentence into symbols and non-symbols. In other words, in order to subdivide the numeric code sequence '93272017209680363630' into symbols and non-symbol groups, the ambiguous key code '0' representing symbols is subdivided as follows.

[ '93272', '0', '172', '0', '968', '0', '36363', '0' ] ...(9)

For the part other than '0' in this subdivided segmented numeric code sequence, the sentence registration process is performed by the word prediction input method. Equation (9) Since the first numeric code sequence '93272' of the segmented ambiguous numeric code sequence is a numeric sequence corresponding to a character, as shown in Fig. 7(c), the prediction word 'where' corresponding to the numeric code sequence '93272' If you select this as a method of selecting a prediction word, 'where' is registered as the first phrase of the sentence and entered into the input window at the same time. (L71)

[In Fig. 7(c), 'w', the first letter of 'Where', is displayed in capital letters. is in an altered state. In FIG. 7(c), the shift key (L73) is displayed in italics, which means that the 'shift' key (L73) is pressed.]

If 'where' is not registered in the dictionary database, as shown in Fig. 7(d), the number string '93272' is displayed in the keyboard area like a predicted word, and in this state, to execute the registration process of 'where', '93272' is displayed. Reg' is selected, according to the configuration in Table 1, the extension version corresponding to the number string code '93272' is activated in sequence, and in the same way as shown in Examples 2 and 4, by entering the letters of 'where' one by one 'Where' is registered in the dictionary database and 'Where' is entered in the input window. (L74) When the step corresponding to '93272' is completed, the 'space' character (space), which is the next step of 'Where', is automatically ), and as shown in FIG. 7 (e), the symbol keyboard is activated. In this state, if you touch the black key in the middle and then release your finger, a space is input, and the word prediction input step corresponding to the second number string '172' of equation (9) is executed, which is the next step. As shown in (f), 'are' is displayed in the keyboard area as a predicted word so that it can be selected / input. Hereinafter, the registration process corresponding to 'you' and 'going' proceeds in the same way, and the sentence registration process ends, and at the same time, 'Where are you going?' is entered in the input window.

[For reference, the above process of registering 'Where' in the dictionary database is performed as part of the sentence registration process, so the 'W' of 'Where' is registered as a capital letter, but 'Where' is not registered in the dictionary database. If not, it is desirable to register it in the dictionary database as 'where', a lowercase letter. Because there is no problem if 'where' needs to be entered in lowercase later, but if 'where' is registered as 'Where' as a single word that is not part of a sentence, the word corresponding to the key input numeric code sequence '93272' As 'Where' is displayed as a prediction word, in this case, there is no way to change 'W' of 'Where' to lower case, so 'where' must be distinguished from 'Where' and registered as a new word in the dictionary database. Because. ]

As seen above, if words are registered as part of the sentence registration process, this brings about the effect that words are registered in the dictionary database at the same time as sentence registration. Therefore, when the sentence registration process of this embodiment is applied to the registration process of 'Arnold J. Toynbee' of Example 3, if 'Arnold' and 'Toynbee' are registered in the dictionary database, FIGS. ) and the process of FIGS. 6 (m) to 6 (s) are reduced to one step of predicting / selecting / entering 'Arnold' and 'Toynbee' in the dictionary database, so that the dictionary registration and input process brings the advantage of simplification. If 'Arnold' and 'Toynbee' are not registered in the dictionary database, the process of FIG. 6 may be performed as is.

<Simplified overview of phrase and sentence prediction key input method>

In Examples 1, 3, and 4, a method of inputting phrases and sentences including not only symbols but also spaces was exemplified by the predictive input method. A method for simplifying key input for the predictive input method of such phrases and sentences will be described.

The ambigous key sequence for inputting 'Who is he?' as a sentence prediction input is Equation (10-2) according to the method of Example 3. Unlike equation (10-2), equation (10-3) corresponds to the first letters 'w', 'i', and 'h' in the case of words constituting 'Who is he?' in (10-1) As an ambiguous key sequence in which only the ambiguous key that corresponds to the first letter of a word is entered, the sentence is predicted. In the word prediction input method, even if an ambiguous key corresponding to 'import' is input to predict 'important', not only 'important' but also 'importance' and 'important' whose front part matches are predicted from the dictionary database. It is in the same context as the method. The key to simple key input as in Equation (10-3) is to make the sentence predictable even if only some of them are input, except for symbols and blank characters among the elements constituting the sentence to be input.

Who is he? ...(10-1)

'wxyz'-'ghi'-mno'-'Sym'-'ghi'-'pqrs'-Sym-'ghi'-'def'-'Sym' ...(10-2)

'wxyz'-'Sym'-'ghi'-'Sym'-'ghi'-'Sym'...(10-3)

Therefore, the criteria for extracting predicted sentences are specified in Table 5 so that sentences can be predicted even if only a part of the words constituting the sentence is keyed in as above, and this criterion is applied to the sentences in Table 3 and the ambiguous key input in Table 4 and registered in the database. The process of extracting the sentences in Table 3 as predicted sentences according to the ambiguous key input in Table 4 will be explained.

< 6-I. Calculate the predicted sentence extraction variable numeric code sequence from the sentence registered in the database>

As shown in Table 3, the sentences registered in the database are represented by the corresponding ambiguous key sequence, and the ambiguous key sequence expressed in this way is subdivided at the boundary of the 'Sym' key. Arrange them sequentially from the top of the first column. Then, a numeric code sequence is calculated from the ambiguous key sequence of each segment according to Table 1, and this numeric code sequence is written in the corresponding segment of the second column of Table 3.

< 6-II. Calculate prediction sentence extraction variable numeric code sequence from key input>

As in the above paragraph <6-I>, a numeric code sequence is calculated based on Table 1 from the ambiguous key sequence of key input for sentence prediction, and then written in the relevant segment.

The numeric code sequence calculated in paragraph <6-I> (corresponding to the numeric code sequence of the database sentence) and the numeric code sequence calculated in paragraph <6-II> (corresponding to the numeric code sequence of key input) are shown in Table 6. When the criteria are compared and both criteria 1 and 2 are satisfied, it is determined that the key input for sentence prediction coincides with the sentence in the database, and the sentence in the database is extracted as the predicted sentence. With the above contents, the numeric code sequence of 'Where are you going?', a sentence registered in the database of Table 3, and the numeric code sequence of the ambiguous key input of Table 4 were compared, and the key input of Table 4 was the sentence of the database of Table 3. The process of determining whether or not can be extracted will be described by referring to the criteria in Table 5.

In other words, comparing the numeric code sequence of key sequence 1 (hereinafter referred to as 'A') in Table 4 and the sentences in Table 3 (sentences registered in the database - hereinafter referred to as 'B') according to the criteria in Table 5, the following same.

When comparing the number of digits of the numeric code sequences of A and B for each segment based on standard 1, in the case of the first segment, the numeric code sequence of B is '93272', so the number of digits is 5, and the numeric code sequence of A is '932', the number of digits becomes 3, which is smaller than the number of digits in the numeric code sequence of B, so it satisfies the standard. Below, from the 2nd segment to the 7th segment, the number of digits of the numeric code sequence of A is less than or equal to the number of digits of the numeric code sequence of B, and satisfies the criteria. Finally, in the 8th segment, since there is no numeric code sequence of key input, the number of digits corresponds to 0, and since the numeric code sequence of the database sentence is '0', the number of digits corresponds to 1, so criterion 1 is satisfied.

Based on criterion 2, when comparing whether the numeric code sequences of A and B for each segment match from the beginning, in the case of the first segment, the numeric code sequence of B is '93272' and the numeric code sequence of A is '932', so they match from the beginning. Therefore, it satisfies the criterion. Then, when comparing the second segment to the seventh segment, the numeric code sequence of A matches the numeric code sequence of B from the beginning, so the criterion is satisfied. And in the case of the 8th segment, since there is no number code sequence of key input, it satisfies the criterion, so criterion 2 is also satisfied. Therefore, key sequence 1 corresponding to the key input of Table 4 satisfies the criteria of Table 5, and 'Where are you going?' is extracted from the database as a prediction sentence, and selection/input is possible.

Just as key sequence 1 in Table 4 was compared with the database sentence above, when key sequence 2 in Table 4 is compared with the sentence 'Where are you going?' in Table 3, the sentence in Table 3 is only up to the 8th segment, whereas key sequence 2 Since there is also a ninth segment, the condition of criterion 2 is not satisfied, so 'Where are you going?' cannot be extracted as a prediction sentence.

Where are you going? ambiguous key sequence number code sequence Segment 'wxyz'-'ghi'-'def'-'pqrs'-'def'- 93272 1st 'Sym' - 0 2nd 'abc'-'pqrs'-'def' 172 3rd 'Sym' 0 4th 'wxyz'-'mno'-'tuv' 968 5th 'Sym' 0 6th 'ghi'-'mno'-'ghi'-'mno'-'ghi' 36363 7th 'Sym' 0 8th

key sequence 1 key sequence 2 ambiguous key sequence number code sequence Segment ambiguous key sequence number code sequence 'wxyz'-'ghi'-'def' 932 1st 'wxyz' - 9 'Sym' - 0 2nd Sym'- 0 'abc'-'pqrs'-'def' 172 3rd 'abc' - One 'Sym' 0 4th Sym' 0 'wxyz'-'mno'-'tuv' 968 5th 'wxyz'-'mno'-'tuv' 968 'Sym' 0 6th Sym'- 0 'ghi'-'mno'-'ghi' 363 7th 'ghi'-' 3 8th 'Sym' - 0 9th 'abc' - One

criterion 1
When comparing the number of digits of the number code sequence in each segment
The number of digits in the number code sequence of the key input
The number of digits in the number code sequence of the database sentence must be less than or equal to.
(However, if there is no number code sequence in the segment, the number of digits is treated as 0 (zero) and compared.)

criterion 2
When criterion 1 is met,
in each segment
The number code sequence of key input
It must match the number code sequence of the database sentence by comparing it from the beginning.
(However, if there is no number code sequence of key input, criterion 2 is satisfied.)

key sequence 3 key sequence 4 ambiguous key sequence number code sequence Segment ambiguous key sequence number code sequence 'wxyz' - 932 1st 'wxyz' - 9 'Sym' - 0 2nd Sym'- 0 'abc'-' 172 3rd 'abc' - One 'Sym' - 0 4th Sym' 0 'wxyz'-' 968 5th 'wxyz'-'mno'-'tuv' 968 'Sym' - 0 6th 'ghi' - 3 7th

By applying the criteria of Table 5 examined above, key sequence 3 and key sequence 4 shown in Table 6 are compared with the sentences in Table 3 (assumed to be database sentences), so they satisfy the criteria of Table 5, so key sequence 3 and key sequence 4 Key sequence 4 extracts 'Where are you going?' as prediction sentences from the database so that they can be selected/input. That is, even if only the first letter of each word of 'Where are you going?' is input, it can be extracted as a prediction sentence (in the case of key sequence 3), and even when an ambiguous key corresponding to 'you' is input in the middle of the sentence (In the case of key sequence 4) 'Where are you going?' is guessed as a prediction sentence and selected/input. In order to implement simple key input for this convenience, if the criteria of Table 5 are applied to the process of extracting prediction sentences from the database, it is possible to extract prediction sentences even with only part of the sentence, so simple key input is implemented. .

<Enter a simple web address>

The sentence prediction input method described in Example 6 can also be applied to web address input. For example, in order to input the web address phrase "www.fda.gov", a key input represented by Equation (11) must be performed.

'wxyz'-'wxyz'-'wxyz'-'Sym'-

'def'-'def'-'abc'-'Sym'-'ghi'-'mno'-'tuv' ....(11)

However, if the simple input method of the sentence prediction input method of Example 6 is applied, 'www.fda.gov' is extracted from the dictionary database and can be selected/inputted even with a key input corresponding to Equation (12).

'wxyz'-'Sym'-'def'-'def'-'abc'-'Sym'-'ghi'-'mno'-'tuv' ....(12)

Since a web address generally starts with 'www.', 'www.fda.gov' can be extracted from the dictionary database and entered even if keyed in as shown in Equation (12).

< Internet search and dictionary database utilization by predictive input method >

Until Example 7, the phrase or sentence prediction input method was input through the process of extracting the sentence from the dictionary database. In addition, the word prediction input method has been used as an input method for mobile devices with a limited number of keys. Since most of these mobile devices are connected to the Internet, using a dictionary database stored in an Internet server for a word prediction input method is more efficient than using a dictionary database built into the mobile device. In the case of words, a dictionary database can be built with a memory of several megabytes, but in the case of sentences, a much larger memory capacity is required, so it is advantageous to use the memory of an Internet server rather than storing a database in a mobile device. In the query process of extracting data from the database, using the high-performance processor of the Internet server can process the input process more quickly than performing the query process in a mobile device. This means that the mobile device's Internet transmission speed reaches gigabytes per second, and the process of transferring the processing result from the Internet server to the mobile device becomes close to real time, so there is no need to have a database in the mobile device.

If the sentence prediction input method can be applied to searches of Internet search engines such as google, yahoo, and bing, it provides a way to easily search even when it is difficult to input with general input methods due to the limited number of keys, such as in smart watches. is to do However, for this, the index of the database that each search engine is building must be built as shown in Table 7. That is, indexes corresponding to words (phrases, web addresses, sentences, etc.) must be constructed not only with general string codes but also with ambiguous key sequences. Since the numeric code sequence in Table 7 is calculated based on Table 1, it should be changed accordingly if the contents of Table 1 are changed.

string code ambiguous key sequence numeric code sequence
according to
Table 1 "www.fda.gov" 'wxyz'-'wxyz'-'wxyz'-'Sym'-'def'-'def'-'abc'-'Sym'-'ghi'-'mno'-'tuv' '99902210368' "www.efa.gov.in" 'wxyz'-'wxyz'-'wxyz'-'Sym'-'def'-'def'-'abc'-'Sym'-'ghi','mno','tuv'-'Sym'-'ghi ','mno' '99902210368036' "We will be back." 'wxyz'-'def'-'Sym'-'wxyz'-'ghi'-'jkl'-'jkl'-'Sym'-'abc'-'def'-'Sym'-'abc'-'abc '-'abc'-'jkl'] '920934401201114'

As shown in Table 7, when the search engine database is built, an ambiguous key input corresponding to equation (13) is made in the input window of the search program and when executed, a link to the US Food and Drug Administration homepage site as shown in FIG. 8 ( link) You can select the address ('www.fda.gov') displayed in the keyboard area when the list of items is displayed, or select 'www.fda.gov' by touching 'www.fda.gov' among the list sites displayed on the screen. .

'wxyz'-'wxyz'-'wxyz'-'sym'-'def'-'def'-'abc'-'sym'-'ghi'-'mno'-'tuv'

... (13)

As such, even with the keyboard shown in FIG. 1, Internet sites can be easily connected and even text input can be easily performed. Even on a smart watch, which is currently drawing attention as a next-generation mobile device of a smartphone, internet search, input of everyday sentences, and even password input are easily performed without any difference from smartphones.

<Application of non-deterministic key keyboard to touch-type devices and push-type devices>

Although the sentence prediction input method examined in the above embodiments has been examined for key input of a screen touch method, it can be executed even when applied to a press-type keypad. The only difference is that in the case of the touch method, the function of selecting a predicted word is given to the drag operation, and touching the key is an ambiguous key input, and the drag operation is in charge of selecting/inputting the predicted word or predicted sentence, and is distinguished. However, since the drag operation is impossible in the keypad press input method, if the drag operation is replaced with a long press operation, the sentence prediction input method of the present invention can be applied to a keypad having a press key.

For the sentence prediction input method of the present invention, a symbol or a blank character is designated and inputted as an ambiguous key like a character. However, in the case of a space character, it does not have a separate ambiquous key, and it is possible to reduce the number of keys by dragging a key in a state of touching it and taking charge of inputting a character designated for the key and a space character at the same time. That is, when the 'abc' ambiguous key is touched and moved over a certain distance, the same function as 'abc'-'Sym' key is input. In this case, the function of selecting/inputting a prediction word (sentence) by touching and dragging the 'abc' key must be implemented in a different way.

< Display priority of search contents in non-confirmed search using non-confirmed keys>

As reviewed in Example 8, the use of the input system using non-deterministic keys of the present invention is a search engine that does not have a database of words, sentences, and phrases for ambiguous input in the user's device, such as Internet search, but instead Even if a database exists in the database, it can be used as an input system. However, as seen in Example 8, in the case of Internet search, unlike the limited contents registered in the user database, the amount of expected search contents cannot be predicted, so search contents extracted for non-determined key inputs to increase search efficiency. It is desirable to extract and display in the following order. That is, in Example 6, a string code extracted for an ambiguous key sequence according to a non-deterministic key input is extracted according to the following priority order.

Priority 1:

If the number code sequence corresponding to the searched content exactly matches the input number code sequence, it is extracted first.

Priority 2:

The number code sequence corresponding to the searched content does not exactly match the input number code sequence.

If it meets the criteria in Table 5, it is extracted preferentially.

Looking at the extraction according to the above priority order with reference to Table 7 below, when a non-deterministic key input is made according to key sequence 3, the extracted sentences can be extracted according to the criteria of Table 5, but all sentences 1 to 3 are possible. According to this, the extracted sentence 3 is displayed as the highest priority, and the extracted sentences 2 and 3 are displayed in order so that the user can select them. If only one extracted sentence is displayed, only extracted sentence 3 is displayed. And when non-confirmed key input is made according to key sequence 2, extracted sentences 2 and 3 are extracted according to the criteria of Table 5, and extracted sentence 2 is displayed preferentially among them. Therefore, in key sequence 3, the entire sentence 'My name is United.' When 3 is searched, the remaining characters of 'United' are entered sequentially and there are many extracted search contents, so the process of selecting among them can be omitted.

extract sentence 1
My name is United . My name is United. extract sentence 2
My name is Uni . My name is Uni. extract sentence 3
My name is U . My name is U. key sequence 1 'mno' -
'wxyz' 'Sym' 'mno' -
'abc' - 'Sym' 'ghi' -
'pqrs' 'Sym' 'tuv' -
'mno' -
'ghi' -
'tuv' -
'def' -
'def' 'Sym' key sequence 2 'mno' -
'wxyz' 'Sym' 'mno' -
'abc' - 'Sym' 'ghi' -
'pqrs' 'Sym' ''tuv'-
'mno' -
'ghi' - 'Sym' key sequence 3 'mno' -
'wxyz' 'Sym' 'mno' -
'abc' - 'Sym' 'ghi' -
'pqrs' 'Sym' 'tuv' 'Sym'

<Composition and advantages of 9-key keyboard with 'sym' key and menu (expansion) key with symbols and 'space' ('space') designated >

10 shows a circular keyboard and keyboard layout for inputting a non-confirmed search. The feature of this keyboard is that it has a menu key and a 'Sym' key separately, and the layout of the character keys maintains the layout of the qwerty keyboard, and the character keys at the top are divided into three, representing 'qwer', 'tyu', and 'iop'. It has 3 non-deterministic keys. The middle and bottom are composed of two keys each, and the consonant arrangement of the qwerty keyboard is divided into left and right sides. Moreover, numbers are also assigned to character keys. '0' and '5' are assigned together to the 'qwer' key, and '1' and '6' are assigned to the 'tyu' key together. That is, the number shown on the key and the number obtained by adding '5' to this number are assigned to each key so that the number can be searched without a separate key for the number. And the 'Sym' key includes the symbol corresponding to the numeric code '0' in Table 2, including the 'space' ('space'). In addition, the 'menu' key of this keyboard performs various functions. When one of them touches this key, the 'category (,)' key is activated as shown in FIG. 10 (b), making it easier to extract phrases or sentences. perform a function that makes

The following describes a process in which a non-confirmed key is entered using the 'category' key to search a database of US postal addresses. 11 shows a part of an address book in Chicago, USA. In order to clearly indicate the address, the 'space' ('space') is indicated by '-' (hyphen) in FIG. 11 . In the addresses shown in Table 11, '-' (hyphen) is converted to 'space' ('space') and displayed as actually used, as shown below.

1723 WEST 107TH STREET,

City of Chicago, IL

60643

To search for the above addresses, the addresses are arranged in a row as follows. The separated addresses indicated by ',' (comma) are 'zone separator' symbols to facilitate address identification.

1723 WEST 107TH STREET, City of Chicago, IL 60643

Therefore, if such a 'zone separator' symbol ',' (comma) is applied and entered as the separator 'category' key in FIG. The peculiarity is that when the 'category' (,) key is used, an ambiguous key input is more abbreviated than a simple input according to the criteria of Table 5, resulting in an advantage of easy search. In other words, even if the non-confirmed key corresponding to 'STREET' is not entered by inputting the category key, it informs that the non-confirmed key entered after the category key corresponds to the first letter of 'City of Chicago', which corresponds to 'STREET'. Even if the input of the non-confirmed key is omitted, the address search is possible. However, in order to utilize the category key, there is a limitation that the search content must be searched according to these rules must be set in advance. However, if these rules are set, the category key can be used as shown in the configuration of the keyboard shown in FIG. The following embodiment 13 describes a search in which the category key of the keyboard configuration shown in FIG. 11 is actually utilized.

'1tuy'-'2iop'-'2iop'-'3asdf'- : '1723'

'sym' - :

'0qwer' - : 'W' (est)

'sym' -

'1tyu'-'0qwer'-'2iop'-'1tyu'-'ghjkl'- : '107TH'

'category' -

'4zxcv' - : 'C' (ity)

'sym' - :

'2iop' - : 'o' (f)

'sym' -

'4zxcv' : 'C' (hicago)... (14)

The advantage of the 'category' key examined in Example 12 is that it can have a structure in which sentences or phrases to be searched are not connected. In general, the 'space' connecting two words in Internet search means that the sentence or phrase contains both words at the same time, not that the two words are adjacent in the sentence, unlike the 'space' in the sentence. The difference between the two meanings is to be divided into 'sentence-space' and 'search-space'. That is, the 'sentence-space' key extracts phrases or sentences in which two words are adjacently attached when searching when two words are separated by 'sentence-space', and two words separated by 'search-space'. In the case of words, sentences and phrases containing two words are extracted.

The advantage obtained when the 'space' key is divided into the 'sentence-space' key and the 'search-space' key is to accurately search for the sentence or phrase to be extracted. For example, if you want to search for the music titles "Nocturnes, Op. 9 (Chopin)" in music search, enter the key sequence corresponding to 'Nocturnes' and 'Chopin' instead of entering all the key sequences corresponding to this title. Search-space' and input. However, in order to accurately search for the phrase "chopin nocturnes", the key sequences corresponding to 'Chopin' and 'Nocturnes' must be connected in 'sentence-space' so that "Nocturnes, Op. 9 (Chopin)" is excluded. Only the phrase "chopin nocturnes" is extracted, and the number of prediction sentences is reduced, so that selection/input of prediction sentences can be made more easily.

According to the rule of Example 11, if there is no content to be searched for, search is not performed. In this case, if the 'category' key is used, there is no need to find non-deterministic key input key sequences in order, and the key sequence located before and after the 'category' key. are respectively searched and extracted according to the criteria of Table 5.

'b n m'-'i o p'-'z c xv'-' t yu'-'ty u '-'qwe r '-' b n m'-'qwe r '-'qw e r'- 'a s df' ..(15-a)

'category' -

'zx c v'-'g h jkl'-'i o p'-'io p '-' i op'-'b n m' ...(15-b)

Therefore, the key sequence of Equation 15 is "Nocturnes" and "Chopin", which are predicted words corresponding to the key sequence of Equation 15 (a) and Equation 15 (b), separated by the 'category' key ('search-space' key). Search phrases are extracted so that the user can select them. For example, "Nocturnes, Op. 9 (Chopin)" satisfies the key sequence corresponding to 'Nocturnes' corresponding to equation (15-a) separated by category key and corresponds to 'Chopin' corresponding to equation (15-b). It is searched by satisfying the corresponding key sequence. If the 'space' key and the 'and-space' key are distinguished according to the configuration of this embodiment, if the user wants to search only the phrase "Nocturnes Chopin", if the 'space' key is input instead of the 'category' key in Equation 15, " Phrases such as "Nocturnes, Op. 9 (Chopin)" are excluded and only the phrase "Nocturnes Chopin" is extracted so that the user can easily select or input them.

The database used for inputting characters, phrases, and sentences through non-deterministic key input can have a dual structure of a user database and a server database. In the case of search, the database of the search engine is used, so it is necessary to use the user's database. there is no However, when non-confirmed key input is made to input characters, phrases, or sentences in the user's device, priority is set to detect the characters, phrases, or sentences to be entered by first searching the user database inherent in the user device. It is the configuration of this embodiment.

<The difference between the keyboard configuration that has the 'sym' key and the 'menu' key separately and the keyboard configuration that executes the 'sym' key and the 'menu' key at the same time>

The keyboard type shown in FIG. 10 (a) is configured by dividing the 'menu' (extension) key and the 'sym' key for symbol input, and can be applied to both touch-type and key-press type devices, whereas in FIG. 9 The configuration of the keyboard shown is that the black key in the middle must simultaneously perform the 'sym' key for symbol input and the 'menu' key to perform various functions, so the touch input method device has the ambiguous key of the present invention It is possible to perform the predictive input method using the key press method, but in order to perform the functions of the 'sym' key and the 'menu' key together, the black key in the center is a simple pressing operation such as increasing the number of presses or long-pressing the key. It is accompanied by the inconvenience of having to provide a way to distinguish it from For example, in the case of the keyboard shown in FIG. 9, in a touch-type device, a black key in the center is simply touched, and when the finger is released, it is used as a function of the 'sym' key, and while the finger is touched, 'Fig. 10b ', the 'category' key is activated, drag your finger to the 'category' key, and then release your finger from the keyboard to perform the function of the 'menu' key that performs the function of the 'category' key. It is possible to distinguish the function of the 'sym' key. However, since touch/drag operations are not possible in keypad input devices with a simple push key method, unlike touch-type devices, the 'sym' key function is performed with a simple push motion, and the 'menu' key function is performed if the key-press motion continues for a long time. However, it is not easy to distinguish between actual long press and simple press operation, which causes inconvenience. As shown in FIG. There is an advantage in that the operation configuration of the same keyboard can be brought to a touch-type input device and a push-type keypad input device as distinguished from.

This is the difference between the keyboard form shown in FIG. 10 and the keyboard form shown in FIG. 10(c) is a form in which the keyboard of FIG. 10(a) is applied to a rectangular device, and the difference from the keyboard of FIG. 10(a) is an ambiguous 'sym' with symbols and space characters ('space') designated. The point is that the keys are placed downwards.

<How to register a sentence in the user database using a 9-key keyboard with non-deterministic keys 'sym' and 'menu' keys>

The process of performing the method of registering the sentence shown in Example 5 in the user database with the keyboard shown in FIG. 10 (a) will be described in this embodiment. In Example 5, since the keyboard is composed of more than 10 keys, it is easy to designate various function keys, including the 'shift' key, in addition to character keys. You will use the 'Menu' (expand) key. The keyboard of FIG. 10 is a configuration that can perform easy character input such as qwerty keyboard with only 9 keys by utilizing the menu (extension) key. As an example, this configuration will be described as a process of registering the sentence "My name is HanAll."

'bn m ' - 't y u' - (16a)

'sym' - (16b)

'b n m'-' a sdf'-'bn m '-'qw e r'- (16c)

'sym' - (16d)

' i op' - 'a s df' - (16e)

'sym' - (16f)

'g h jkl'-' a sdf'-'b n m'-' a sdf'-'ghjk l '-'ghjk l'- (16g)

'sym' (16h)

In FIG. 12A, in order to input the sentence "My name is HanAll.", the non-confirmed key key sequence of Equation (16) corresponding to this sentence is input. However, since there is no predicted phrase (sentence) detected from the database, the predicted word is not displayed in the keyboard as shown in FIG. displayed in colored letters. (The reason why 'REG' is displayed in red color means that the 'REG' key must be activated by pressing the 'menu' key.) The reason there is no prediction sentence is that 'HanAll' is unique among the words constituting the sentence. This is because it was omitted as a noun, and if a proper noun called 'HanAll' was registered in the database, the sentence would have been extracted and displayed. Therefore, in order to register "My name is HanAll." including 'HanAll' in the database as a sentence, a process of registering 'HanAll' in the dictionary database is included in the middle. And the first process of registering "My name is HanAll." is to press the 'menu' key in the keyboard state shown in Figure 12 (a) to activate the 'registration' (REG) key as shown in Figure 12 (b) Then you have to press the 'REG' key.

In this way, when the 'sentence registration' (REG) key is activated and pressed, the sentence registration process starts. As shown in FIG. 12(c), the first process is 'my ' is extracted and displayed in the dictionary database. To make a capital letter, press the 'Cap' key. Then, as shown in FIG. 12(d), the extracted words are changed to uppercase, and 'My' is input when a key designated for 'My' is pressed among the extracted words. Subsequently, a symbol and a space keyboard corresponding to the 'sym' key corresponding to Equation (16b) appear as shown in FIG. 12 (e). Input of 'space' is made by pressing the key designated with 'space' ('space'). Subsequently, when the extracted words corresponding to the key sequence corresponding to Equation 16(c) are displayed on the keyboard as shown in FIG. 12(f), 'name' is input by pressing the key area designated 'name'. 12(f) to (h), when input of 'space' ('space'), 'is' and additional 'space' ('space') is completed in the same way, 'HanAll' must be entered. Unlike 'my', 'name', 'is', etc., 'HanAll' is not registered in advance, so it is not displayed as an extracted word on the keyboard, and 'reg', which means that 'HanAll' is not registered and needs to be registered, is also helpful. 12(j). Here, a difference between FIG. 12(j) and FIG. 12(b) is that a sign indicating registration is displayed in lowercase letters as 'reg' instead of 'REG'. That is, 'REG' in FIG. 12(b) means that the sentence (or phrase) registration process should proceed because the sentence is not registered in the database, and 'reg' in FIG. 12(j) indicates that word registration should begin. it means. Accordingly, when a key designated 'reg' is pressed in FIG. 12(j), the word registration process corresponding to FIGS. 12(k) to (p) proceeds. When the word registration process performed during the sentence registration process ends, the input of '.' (period-period) corresponding to Equation 16(h) is finally made as shown in FIG. 12(q), resulting in 'My name is HanAll.' input is made. If 'My name is HanAll.' is registered in the database in this way, if the key sequence corresponding to equation (16) is input later, it is displayed on the keyboard as an extracted sentence and can be selected/entered.

In the case of word prediction input using non-deterministic keys, common words are registered in the dictionary database, so prediction is possible in most cases. Since it cannot be registered, the direct registration method was described in Example 16 as a way to supplement this. Nevertheless, in order to supplement this, in this embodiment, a new sentence prediction method is configured so that sentence registration can be easily supplemented. For example, when trying to input "My name is HanAll" of Example 16 as a sentence prediction method, when a key input corresponding to Equation 16 is made, the entire sentence is not searched in the database, so the registration process by the method of Example 16 is performed. In this configuration, a method of searching for phrases existing on the database and combining searchable phrases before proceeding with the sentence registration process is extracting sentences. That is, assuming that phrases searched on the Internet are registered on the database of a search engine, the phrases "My name is" and "HanAll" are not searched as linked sentences, but are searched as individual phrases and words. are connected to be extracted as one prediction sentence. Therefore, "My name" + "HanAll" is connected by 'space' and extracted to "My name is HanAll", and shown in FIG. 13 (a), "My name is HanAll" is displayed in the keyboard as a prediction sentence and can be selected. there will be And when "My name is HanAll" is selected and entered, as shown in Figure 13 (b), finally, the symbol keyboard corresponding to the 'sym' key, which is the last key sequence of Equation 16, is displayed, and the period ('.') input can be made. If the predicted sentence shown in FIG. 13(a) is not "My name is HanAll", the sentence registration process shown in FIG. 16 is performed by pressing the 'ret (urn)' key in the center.

<Changing contents of ambiguous 'sym' key according to search and sentence input situations and setting keyboard by dividing 'space' key into 'sentence-space' key and 'search-space' ('&space') key>

In Example 18, the 'sym' key was set to mean 'space' and explained. In fact, when the 'sym' key is an ambiguous key including all symbols as shown in Table 2, the key input represented by Equation 16 is "My name" is HanAll.", it is desirable to distinguish between the symbol and the 'space' (more precisely, 'sentence-space') key. In order to search for a sentence, the character represented by the 'sym' key is often a 'space' (space character) rather than a symbol, so the arrangement of the keyboard shown in FIG. 10 is changed as shown in FIG. When the key input of Equation 16 is made by separating the input from the symbol, 'sym' of Equation 16 is efficiently searched by pressing the 'space' key of the keyboard shown in FIG. 14A. Furthermore, when a key input is made to search for a web address, when a key input is made using the keyboard shown in FIG. 14a, the 'menu' key is pressed for symbol input to activate the extended keyboard shown in 'You have to press the key. However, since there is no 'space' in the web address, in this case, the 'sym' key is placed instead of the 'space' key as shown in FIG. The inconvenience of having to press a key can be eliminated.

<Prediction sentence extraction process using group key sequence when there is no content that exactly matches the input key sequence>

The search process of Example 17 will be described with key input using the keyboard of FIG. 14A. The key sequence corresponding to Equation 16 can be conceptually expressed as Equation 17 below. In Equation 17, the 'space' key is indicated by '+' and the 'sym' key is indicated by #. A, B, C, and D mean key sequences corresponding to the words 'my', 'name', 'is', and 'HanAll', respectively.

A+B+C+D# ....(17)

In the key sequence comparison for sentence and phrase search, in order to predict the entire sentence, first compare the key sequence of the sentence (or phrase) in the database with “A+B+C+D#” in Equation 17 to see if there is a match. If it searches and doesn't find a match, it compares "A+B+C" then "B+C+D"; It selects a large phrase, compares and searches the key sequence of phrases or words that do not belong to the phrase with the database, extracts matching ones, and then goes through the process of displaying them as prediction sentences by combining them with the contents of the largest phrase already searched. If there is a phrase that matches “A+B+C” and a phrase that matches “B+C+D”, the extracted sentence is determined by dividing it into two parts.

(I) In the first case, the content corresponding to "B+C" in the phrase corresponding to "A+B+C" corresponds to "B+C" in the phrase corresponding to "B+C+D" If the contents are the same, extract the prediction sentence (or phrase) by connecting the contents corresponding to "A" in the passage corresponding to "A + B + C" to the passage corresponding to "B + C + D". In Table 9, case 1 matches “A+B+C” in Equation 17, case 2 matches “B+C+D” in Equation 17, and the contents corresponding to “B+C” in both cases match. In No. 1 of Table 9, the contents corresponding to "A" are extracted, and in case No. 2 of Table 9, the contents corresponding to "D" are extracted, and "My name is HanAll" is extracted as a prediction sentence.

(II) In the second case, in case No. 2 and No. 3 in Table 9, in case No. 3, “A + B + C” in Equation 17 matches, but “name is” and 3 corresponding to “B + C” in No. 2 Since "oboe is" corresponding to "B+C" of No. does not match, in this case, select case 2 of Table 9 where "B+C+D" matches, and replace the part corresponding to "A" with Table 9 of 3 By selecting "My" in the number, "My name is HanAll" is extracted as a prediction sentence. In other words, if "A+B+C" matches and "B+C+D" matches, the content that matches "B+C+D" at the end of the key sequence is first selected and the rest is a short key. It is to select the matching sequence group "A".

A B C D One My name is Tom 2 His name is HanAll 3 My oboe is this

When key input is made with the keyboard shown in FIG. 14A for Equation 16 corresponding to the key input of the embodiment, the key for inputting 'space' is not the 'sym' key, but the 'space' key designated as 'space' alone. Therefore, Equation 16 is changed to Equation 18. In this way, when the registration process is executed by pressing the 'REG' key to proceed with the registration process because the prediction sentence through the search is not extracted after the key input is made in Equation 18, FIG. 12 (e), (g), (i) It does not matter if the displayed 'space' input is omitted, which brings the advantage of simplifying the sentence registration process. That is, when a keyboard having a 'space' single key shown in FIG. 14a is used, not only the search process is efficient, but also the registration process when there is no extracted sentence after the search is efficient.

'bn m ' - 't y u' - (18a)

'space' - (18b)

'b n m'-' a sdf'-'bn m '-'qw e r'- (18c)

'space' - (18d)

' i op' - 'a s df' - (18e)

'space' - (18f)

'g h jkl'-' a sdf'-'b n m'-' a sdf'-'ghjk l '-'ghjk l'- (18g)

'sym' (18h)

<Configuration of a circular keyboard and a rectangular keyboard>

The keyboard of FIG. 14 has a circular shape, and application of this to a rectangular device is shown in FIG. In addition, this quadrangular shape can be easily applied to the remote control-type direction key keypad shown in FIG. 16, so that it can replace the keyboard on the remote control and sufficiently perform functions as an input keyboard such as text writing and Internet search through easy text input. In addition, it brings the advantage that it can be applied even to the joy-stick of the game console. Therefore, it has the advantage of maintaining uniformity as an input device for wearable devices as well as circular and square mobile devices.

17 and 18 show keyboards for Hangul prediction input. Hangul prediction input using this keyboard is configured to simultaneously predict words and sentences.

17 (A) is a prediction sentence display area, (B) is a key area of the keyboard, (C) is a currently input character display window, and (D) is a prediction word display area.

FIG. 18 shows 10 key areas, which are areas (B) of FIG. 17 . The predictive input method using this keyboard is the same as the predictive input method of the English keyboard shown in FIGS. 1 and 9, and each key and its corresponding numeric code are shown in Table 10.

ambiguous key
'ㅋㄲ
ah
qwer
0'
'nl
ᅕ
tyu
One'
'D'
ㅗㅛ
iop
2'
'sorry
TT
asdf
+5'
'Ph
ㅡㅣㅢ
ghjkl
3'
'ㅅㅎ
ㅐㅒ
zxcv'
'jjjjj
ㅔㅖ
bnm
4' numeric code
One
2
3
4
5
6
7 ambiguous key
'grammatical space'
'space' numeric code
8
9

If you want to input "I went to Seoul", you can press the key corresponding to each letter according to the configuration of Table 10, and the key input sequence is as shown in Equation (19) below.

To Seoul: ⑥②④④②-⑧-④⑦- (19a)

<Blank>: ⑨- (19b)

I went: ①①⑥-⑧-④②④③ (19c)

In other words, 'To Seoul', the first phrase of 'I went to Seoul', is a verb that includes the postpositional word 'e', and to input it, enter the key configuration corresponding to the verb 'Seoul' and the postpositional word 'e' in the following order. You can do it. Enter the numeric code '⑥②④④②' corresponding to 'Seoul' and the numeric code '④⑦' corresponding to the postposition 'e', but press '⑧', the 'grammatical space' key between them, ⑥②④④②' Prediction words are extracted from the 'words (nouns, pronouns, numerals)' group of the dictionary database, and 'Seoul', 'excuse', 'preface', 'spoof', 'seomul', 'seoul' 'Seowun', 'Seoyun', etc. are extracted as prediction words. Next, 'E', a prediction word corresponding to the key input sequence '④⑦' of the investigation, is extracted from the 'Investigation' group in the dictionary database, and these prediction words and the investigation prediction words are combined to create 'to Seoul', 'To the sheath', 'To the preface', 'To the sheath', 'To the sheath', 'To the seoun', and 'to the seoyun' are displayed in the prediction word display area as integrated prediction words (precisely, the prediction 'gu') . Therefore, you only need to select and input the one you want to input among them, and in the prediction input system, 'to Seoul', which is extracted as the first predicted word, is temporarily input into the sentence input window (FIG. 17-(B)). . If 'preface' extracted as a predicted word is a word to be input, if the input device is a touch screen, touch the prediction word input window area where 'preface' is displayed in FIG. By executing the method, 'To Seoul' displayed in the input window is displayed as a default prediction word.

As seen above, if words corresponding to cheheom and words corresponding to postposition are classified into different groups and classified as predicted words to be extracted, as shown in Equation (19a), the key '⑧' corresponding to the grammatical blank The front key input is used to extract the word, and the key input after the key '⑧' is used to extract the search word.

In the case of a predicate part involving the use of the ending of a verb or adjective, as in the case of a predicate part, the ending of the predicate corresponding to the particle of the pronoun and the stem of the predicate corresponding to the pronoun are stored in the dictionary database, respectively, in the 'stem' group (群) and 'stem' group. By constructing a group, the key sequence before and after the 'grammatical blank key' is applied to extract the stem words and ending words from these groups. In other words, the stem prediction words extracted according to the key input sequence in front of 'grammatical blank key' and the key input sequence in front of 'grammatical blank key' are extracted from the database separated into verb stem group and ending group. Combine the predicated prediction words and select/enter them so that they are displayed in the prediction word input window as a verb prediction word (precisely, a prediction phrase). To explain Equation (19c) as an example, since 'I went' corresponding to the verb 'I went to Seoul' is composed of 'I went' corresponding to the stem and 'Yo' corresponding to the ending, the key input order is the stem 'Go' '①①⑥' corresponding to ' and '④②④④③' corresponding to the ending 'yo' are connected by '⑧' which is a grammatical blank symbol. Therefore, by using grammatical blank keys, in the case of the word part, the word and the postposition are distinguished, and in the part of the word, the stem and the ending are classified and registered in the dictionary database as the word group, the particle group, the (verb) stem group, and the (verb) ending group. In this case, it provides a way to drastically reduce the number of words ('phrases', to be precise) corresponding to the verb part formed by combining the verb and the postposition and the verb stem and ending. To explain this in detail, assuming that the number of words in the case of the word part is 100,000, and the number of postpositions that can be combined with the word is 1000, the number of phrases in which the word and the postposition are combined reaches 100 million. In the case of the verb part, if the number of verb stems is 100,000 and the number of stems that can be combined is 1,000, the number of verb phrases that stems and endings are combined reaches 100 million. However, the number of endings that can be combined with the actual stem is simply '-da' ('ga'+'da'->'go'), '-is' ('ga'+' is'->'go' ) to '-even though' ('ga' + 'even though' -> 'even though'), showing the number of cases where the number exceeds 100,000, so the number of phrases combining these endings in the stem is 1 billion. exceeds the dog. Therefore, in the case of classifying the stem and ending of a word and registering it in the dictionary database, 200,000 words, the sum of 100,000 of the number of stems and 100,000 of the number of endings, need to be registered in the dictionary database. The capacity is about 50,000 times smaller than the case. The difference in size is also a problem with this reduced capacity, but in fact, the time to search the database to extract the predicted word (phrase) from the database is more than 10,000 times different, so it is not comparable in terms of practicality.

In the case of English, when forming a phrase, the phrase corresponding to 'to Seoul' in Korean is expressed as 'To Seoul', so the preposition 'To' and 'Seoul' corresponding to the phrase are 'To' due to the space. Since 'Seoul' and 'Seoul' are distinguished, there is no need to predict the indirect part in which prepositions and indirect words are combined, so the word registered in the database is the sum of the number of prepositions and the number of indirect words (nouns). Therefore, even if the number of prepositions is as large as the number of words (nouns), the number of registered words increases by about twice. On the other hand, since the postposition (corresponding to a preposition in English) and the epithet (corresponding to a noun in English) are combined in Hangeul, this is intentionally inserted between the postposition and the postposition (the stem and the ending in the case of a verb) to 'grammatically blank' in the present invention. This dramatically reduces the number of words that need to be registered in the dictionary database, such as English, to prevent the need to increase the storage capacity of the dictionary, and furthermore, the reduction in the number of registered words has the effect of dramatically reducing search time. .

The Hangul predictive input method using the 'grammatical space' key examined in Example 22 shows how to drastically reduce the database of Hangul word phrases (word phrases, verbs). In order to use the 'grammatical space' key that brings these advantages, the user must have a grammatical understanding that can clearly distinguish between a verb and a postposition, and the stem and ending of a verb. However, in the case of 'To Seoul', it is easy to distinguish between 'Seoul' and 'Eh', but in the case of the verb 'I went', it is not easy to distinguish whether it is 'I went' + 'I went' or 'I went' + 'Yo'. This can cause user confusion. Even in the case of 'I went', it becomes more difficult to distinguish. In order to overcome this problem, in this embodiment, a 'grammatical space' is inserted between each syllable of Hangul, so that even if the user does not recognize the location of the actual 'grammatical space' key, word phrases (phrasal phrases and phrases) can be retrieved from the dictionary database. Shows how to extract it.

Taking 'I went to Seoul' as an example, 'to Seoul' corresponding to the phrase phrase is easy to distinguish between the phrase and the postpositional phrase, so 'I went to' corresponding to the phrase phrase is selected and the key input sequence is the method of Example 22. corresponds to equation (19c). However, if a 'grammatical blank' key is inserted for each syllable according to the concept of the present embodiment, the key input sequence becomes Equation (20) below.

I went: ①①⑥-⑧-④②-⑧-④③ (20)

When the key input sequence as shown in Equation (20) is made, the method of extracting phrasal verbs from the database extracts the predicted stem word and the suffix word corresponding to the key input sequence before and after each 'grammatical space' key from the stem group and the suffix group, respectively. is to combine That is, the key input sequence of equation (20) is converted into the following two equations (21a) and (21b) in the prediction word extraction process, and the stem word and the stem word corresponding to the key input sequence before and after the 'grammatical blank' key of each expression goes through the extraction process. If this is explained in light of Table 23, which shows the process of predicting word phrases including grammatical spaces, the process of predicting phrases and verbs according to the key input sequence including grammatical spaces is predicted by executing the grammatical spaces inserted between syllables. phrases are extracted. In the case of Equation (20) above, the word phrase prediction process using grammatical spaces shown in Table 23 is performed twice. In this way, in order to predict 'I went', a grammatical space is input between each syllable rather than entering a grammatical space exactly once between 'I went' and 'I went', and the process of Table 23 is performed once more. Still, even if the user does not know exactly where to input a grammatical space, the advantage of being able to input a word phrase to be input is obtained by extracting it from a dictionary database.

I went ^ : ①①⑥-⑧-④②④③ (21a)

I went^yo: ①①⑥④②-⑧-④③ (21b)

I went: ①①⑥④②④③ (21c)

In the extraction process using the key input sequence corresponding to equation (21a), 'gone' is extracted, but in the case of equation (21b), the verb part is not extracted because the word 'gone' is not registered in the stem group of the database. because it doesn't Therefore, when a key input is made by inserting a 'grammatical blank' key between each syllable, the user can predict a desired word phrase without worrying about grammar.

And, in the case of Korean, since there may be words that do not require grammatical spaces that do not combine with postpositions or endings, as shown in equation (21c), independent words in addition to word phrases containing postpositions or endings must be searched in the dictionary database. In the case of the key input sequence corresponding to (21c), apart from Table 23, word prediction input for Korean must be entered as well as English word prediction input, and independent word groups for this must be included in the dictionary database. And the extraction of these independent words is the same as the English word prediction method, and in FIG. 23, it is the same process as extracting the chain word list from the chair group. Independent words extracted in this way are combined with the phrase list and the phrase list and included in the entire word (phrase) prediction list so that the user can select/enter them.

This embodiment describes a method of applying 'grammatical spaces' inserted between each syllable shown in Example 23 above to extract syllables of Hangul. As already reviewed in Example 22, the dictionary database for predictive input of Hangul has a problem that the size of the word phrase itself becomes too large when registering the word phrase itself, so that the word phrase is divided into a group of words and a group of particles (in the case of verbs, the stem group and Classified into mother groups) and registered. However, the problem is that if it is not registered in these databases, it is necessary to provide a way to enter it, but the size is too large to register unusual words such as people's names and place names. It is to provide a method for users to combine by extracting each syllable of unspoken words.

The key input sequence of 'I went to Seoul' according to the configuration of this embodiment is as shown in Equation (22). According to Equation (22), when a key input corresponding to 'to Seoul' is made, syllable prediction as shown in FIG. The extracted syllables are displayed on the window. 'Seo', 'Heo', 'Seo', 'tongue', and 'Seo' corresponding to the key input '⑥②' of the first syllable of equation (22a) are extracted, and the second 'Moon', 'Water', 'Un', 'Wool', 'Wo', 'What', 'Yoon', 'Yul', and 'Mule' corresponding to the key input '④④②' of the syllable are extracted, and the last 'E', 'Ye', 'Me', and 'ㅞ' corresponding to the key input '④⑦' of the syllables are extracted and displayed. That is, in the case of the syllable shown in FIG. 22(E), when looking at the predicted syllable corresponding to the second syllable, 'mun' has a higher frequency than 'wool', so 'mun' is arranged before 'wool'. The order of the first letters of the extracted syllables is indicated by 'Seo', 'Moon', and 'E' That is, it is predicted differently from 'To Seoul', which is the first of the predicted phrases shown in Fig. This is because the arrangement order of the prediction phrases is also arranged according to the frequency of words (verbs or verbs) in the phrase phrase, so that the frequency of use of 'Seoul' is greater than the frequency of use of 'Preface'. ', 'In the preface' are listed in the order.

'To Seoul' : ⑥②-⑧-④④②-⑧-④⑦- (22a)

<Blank>: ⑨- (22b)

'I'm gone' : ①①⑥-⑧-④②-⑧-④③ (22c)

In the case of Hangeul, the number of usable syllables is 11172, so the number of commonly used verb stems is about hundreds of thousands (approximately 500,000 vocabularies included in the standard Korean language dictionary published by the National Institute of the Korean Language in 1999). As shown in Equation (22), syllable prediction is made as easy as word prediction for key inputs separated by 'grammatical blank' keys, so that it functions complementary to the word prediction input method so that words not registered in the database can be entered. do. As a result, as described in Example 23, by entering the 'grammatical space' key between each syllable, it is possible to easily use word prediction input without having to familiarize yourself with the grammatical structure of the word phrase and to input words that are not registered in the dictionary database. It brings the advantage of simultaneously implementing a method that can be implemented.

In the above, it has been shown that word prediction input of Hangul can be easily implemented using the 'grammatical space' key. The implementation of such word prediction input in Hangeul enables sentence prediction input as in English, thereby further increasing input efficiency.

The sentence prediction input method in Korean is applied in the same way as the sentence prediction input in English. This is a method in which a sentence is predicted even if only a part of each word group is input in a key input sequence separated by a blank key. 20 and 21, when a part of the key input sequence corresponding to 'to Seoul' and a part of the key input sequence corresponding to 'I went to Seoul' are entered in the key input sequence for 'I went to Seoul', 'I went to Seoul' is entered. It is extracted from the sentence database and displayed on the 'predictive sentence display window' (Fig. 20(A), Fig. 21(A)).

20 shows that even if a key input corresponding to 'I went to Seoul' is made, 'I went to Seoul' is extracted from the database and displayed in the 'prediction sentence display area', and FIG. 21 shows the first letter of each phrase of 'I went to Seoul'. Even if a key input corresponding to 'I went to Seoul' is made, 'I went to Seoul' is extracted from the database and displayed in the 'predictive sentence display area'.

Table 11 shows the key sequence of 'I went to Seoul' registered in the dictionary database. There are two key input sequences in this table. Method 1 is the key input sequence including 'grammatical spaces' in the word group, and Method 2 is the case where 'grammatical spaces' are not included. In the Korean sentence prediction of the present invention, as shown in Method 2 of Table 11, there is no problem even if the key input sequence is set without the 'grammatical blank' key. The reason is that the word phrase corresponding to 'to Seoul' is already specified in the dictionary database in order to extract 'I went to Seoul' as a sentence, so there is no need for a 'grammatical blank' key. Therefore, unlike word phrase prediction in which words and postpositions are extracted and combined to reduce the number of word phrases, the method of registering sentences in the dictionary database for sentence prediction input is according to Method-1 or Method-2 in Table 11. You can register the key input sequence of sentences. Even if the dictionary database for sentence prediction is set as Method-2 in Table 11, and the key input sequence is as in the key sequence-A in Table 12, the key input sequence input by the user in the sentence extraction process You can use it after removing 'grammatical spaces' from and converting to key sequence-B in Table 12.

In the key input order of Tables 12 and 13, sentences are extracted from the dictionary database and input is possible in light of the criteria for sentence prediction (Table 5) even if a part of the front part of the phrase constituting the sentence is input. That is, Tables 12 and 13 are key input sequences corresponding to the input situations shown in FIGS. 20 and 21, respectively. It shows that the key input sequence corresponding to a part of each phrase of 'I went to Seoul' was made in the database for predicting Hangul sentences.

sentence to Seoul gap went key sequence Method-1 ⑥②④④②-⑧-④⑦ ⑨ ①①⑥-⑧-④②④③ Method-2 ⑥②④④②④⑦ ⑨ ①①⑥④②④③

sentence first key sequence gap second
key sequence key sequence-A ⑥②④④②-⑧-④⑦ ⑨ ①①⑥ key sequence-B ⑥②④④②④⑦ ⑨ ①①⑥

sentence first key sequence gap second
key sequence key sequence-A ⑥② ⑨ ①①⑥

This embodiment informs a method for searching the Korean database structure (word phrase, phrase phrase) shown in FIG. 23 without using a grammatical blank key. In other words, in the case of Hangul, unlike English, there are changes in postpositions and endings at the end of verbs and verbs, so each verb and verb has too many changes to have, so to reduce the database, it is necessary to divide the group of words and verbs into postpositions and endings. That is the crux of Figure 23. That is, when the 'grammatical space' introduced in Example 22 is unfamiliar to users and they do not know exactly where to designate a grammatical space in an actual phrase, and for this purpose, it is cumbersome to input a key corresponding to a grammatical space for each syllable. In both cases, it can be cumbersome for users. Therefore, it is intended to provide a method for searching the Korean database shown in FIG. 23 without inputting a grammatical blank key.

When the user inputs key input as shown in key sequence-B in Table 12 without a key corresponding to a grammatical blank to input 'I went to Seoul', the method of searching the Korean database is as shown in Table 14. That is, assuming that the input key sequence '⑥②④④②④⑦' is located next to each key, it is divided into key inputs corresponding to group words (word groups) and postpositions (suffixes), corresponding to search sequences 1 to 8 in Table 14. In the process of searching the database, phrases (phrases) are extracted by combining predicted words corresponding to group of words (group of words) and postposition (suffix) obtained from the database.

search order Cheongun (Yongeongun) investigation (mother) One ⑥②④④②④⑦ 2 ⑥②④④②④ ⑦ 3 ⑥②④④② ④⑦ 4 ⑥②④④ ②④⑦ 5 ⑥②④ ④②④⑦ 6 ⑥② ④④②④⑦ 7 ⑥ ②④④②④⑦ 8 ⑥②④④②④⑦

If there is no word corresponding to any one of the group of words (phrasal verbs) or particles (suffixes) in the database, it is assumed that there is no predicted word. For example, in the case of search order 3 in Table 14, even if a word matching the key input sequence '⑥②④④②' corresponding to the group of words (word group) exists in the database, the key input sequence '④⑦' corresponding to the particle (suffix) If the matching word does not exist in the postposition (suffix) part database, it is determined that there is no phrasal verb (phrase) for search order 3, and the phrasal verb group is determined only when both the word group (verb group) and words matching the postposition (suffix) exist. It is to extract a phrase corresponding to a phrase (or verb) by combining the extracted words of (Dragon Group) and the extracted word of Particles (Suffix).

In general, since the number of words registered in the database is greater in the number of words (groups of words) than the corresponding postpositions (suffixes), one of the ways to speed up the search order shown in Table 14 is to Regarding the key input sequence, first, the database is searched to see if there is a (postposition or ending) word that matches the key input sequence, and if there is no matching (partition or ending) word, the database is searched for. Skip the search. In this way, the entire search process can be performed efficiently by reducing the search process.

Japanese has a grammatically similar structure to Korean, except that there are no spaces. A postpositional particle is attached to the inflectional part to make its meaning clear, and the inflectional change of the verb part is diverse, so that one verb has many forms. Therefore, unlike English, the contents of Examples 22-26 can be applied to Japanese in order to reduce the database according to postpositions and verb ending changes. However, in the case of Japanese, there is no space in the sentence, so if a space is given arbitrarily like in Korean, the content of Examples 22-26 can be applied to build a database of group words (groups of words) and postpositions (suffixes) to easily apply word prediction input. Furthermore, the sentence prediction input of the present invention can be applied.

division sentence part of speech verb part (One) I am a student I am I'm a student (2) わたしがくせせです
(privately live) (3) Watashiha_gakuseidesu watashiha I'm sorry (4) watashiwagakuseidesu (5) watashiwa gakuseidesu watashiwa gakuseidesu

In this regard, in the case of Japanese, it is the idea of this embodiment to apply blank characters like Korean to implement word prediction input. Table 15 shows 'I am a student' in Korean and Japanese. (1) in Table 15 is a Korean sentence of 'I am a student', and the subject 'I' and the verb 'I am a student' are separated by blanks. On the other hand, in Japanese, '私は生です' does not have a space between '私は', which corresponds to 'I', and '生 DESU', which corresponds to 'I am a student'. In addition, for Japanese prediction input, when inputting in the romanji method, which is an English expression of Japanese, it is expressed as shown in (4) of Table 15. Again, there are no gaps. However, if grammatical blanks are inserted according to the configuration of this embodiment, it is expressed as shown in (5) of Table 15. In this case, the indirect part and the verb part are separated, and 'watashiwa' corresponding to the indirect part is replaced with 'gakuseidesu' corresponding to the verb part. It is to separate and extract from the database. As for the method, the method of Example 26 may be adopted. In other words, in the database, 'watashi(私)' corresponding to 'I' in Hangul is registered in the Cheon group, and 'は' corresponding to the postpositional word 'is' is registered in the investigation department, so predictions corresponding to the group and postposition respectively are registered. After being extracted as a word, it is combined and input as a predictive word (phrase). And for predictive input of the sentence of the romanji expression method shown in (4) of Table 15, the keyboard shown in FIG. 9 (a) is used, and the predictive input method is the predictive input method of the present invention. The criteria given in should be applied.

So far, the sentence prediction input method has been a process for inputting actual sentences. However, the sentence prediction input method of the present invention can be applied even when there is no grammatical structure. For example, when selecting a song from a music streaming service or a movie from a video streaming service, in the case of music, the name of the composer, lyricist, performer, singer, etc. is used in addition to the song name to search. As shown in Table 16, if each song is classified, in order to select a song, the name of the song, the name of the composer, and the name of the performer must be input separately to select the desired song. For each song in Table 16, a key sequence for classification (song name, composer, performer) is displayed.

No sentence key sequence One Nocturne Chopin Seoul Symphony Orchestra 41614131-9-63564-9-624426513614411312 2 Nocturne Chopin Berlin Symphony Orchestra 41614131-9-63564-9-5725225213614411312 3 Moonlight Sonata Beethoven Seoul Symphony Orchestra 44221314632131-9-5733572-624426513614411312 4 Moonlight Sonata Beethoven Berlin Symphony Orchestra 44221314632131-9-5733572-5725225213614411312

As shown in Table 16, if the music list is databased, in order for the user to extract song No. 1 (Chopin's Nocturne, Seoul Symphony Orchestra) from this database, the sentence corresponding to 'Nocturne Chopin Seoul Symphony' is a sentence prediction input method. The key sequence corresponding to this is the key sequence of song 1 in Table 16, and the key input sequence that the user actually needs to input is shown in Equation 23. Enter the key arrangement '④①⑥①④①③①' corresponding to the name of the song 'Nocturne', enter the blank key '⑨' to separate the items of the song, and then distinguish the items from the key arrangement '⑥③⑤⑥④' corresponding to the composer 'Chopin' Then enter the blank key '⑨' and finally enter the key arrangement '⑥②④④②⑥⑤①③⑥①④④①①③①②' corresponding to the performer 'Seoul Philharmonic Orchestra', then the standard of Table 5 (designation of the ambiguous key corresponding to each character follows the contents of Table 10). Based on the sentence prediction input method, song No. 1 is selected and extracted from the song list database in Table 16.

Nocturne: ④①⑥①④①③① (23a)

gap : ⑨ (23b)

Chopin: ⑥③⑤⑥④ (23c)

gap : ⑨ (23d)

Seoul Symphony Orchestra: ⑥②④④②⑥⑤①③⑥①④④①①③①② (23e)

In addition, in the sentence prediction input method according to the criteria of Table 5 of the present invention, song No. 1 of Table 16 can be extracted even if a key input corresponding to a part of a phrase constituting a sentence is performed as shown in Equation 24. That is, the key input corresponding to the (front) part of each item (song title, composer, performer) constituting the song No. 1 of Table 16 is performed, and the song No. 1 of Table 16 is extracted. That is, the sentence prediction input method of the present invention provides a way to easily select music or movies even when a non-sentence such as music or movie is selected through a key input as shown in Equation 24. In Table 16, each song is displayed as a sentence, and the items (song title, composer, performer) of each song are separated by 'blank' and can be extracted by the sentence prediction input method of the present invention, and key input abbreviated as in Equation 24 can be easily extracted.

Nocturne: ④① (24a)

gap : ⑨ (24b)

Chopin: ⑥③ (24c)

gap : ⑨ (24d)

Seoul Symphony Orchestra: ⑥②④④② (24e)

In the case of a sentence, the order of the phrases that make up the sentence is fixed due to the grammatical structure. For example, if you say 'I'm going to school', don't say 'I'm going to school'. Therefore, in the case of registering the sentence 'I am going to school' in the database of the sentence prediction input method of the present invention, the key arrangement corresponding to 'I am going to school' is entered in the form shown in Table 16 together with this sentence will register However, as shown in Table 16, the key arrangement that users input to select music or movies from the streaming service can be keyed in as 'Nocturne Chopin Seoul Symphony Orchestra' to select song No. 1, but 'Chopin Nocturne Seoul Symphony Orchestra' '. In this case, when the composer is input first, if the database is configured as shown in Table 16, it is impossible to extract the first song. In this regard, as shown in Table 17 in the case of song No. 1 in Table 16, so that users can select the desired song even if they input 'song title, composer, and performer' in any order in the process of selecting a music song or movie In addition to the key sequence corresponding to the original sentence 1-a, 5 key sequences such as 1-b, 1-c, 1-d, 1-e, and 1-f are additionally converted into key sequences corresponding to song 1 in Table 16. Add and register in the database. In fact, the sentences that the key arrangements of 1-a to 1-f mean are the sentences shown in parentheses under each key sequence in Table 17. However, what is registered as a sentence corresponding to each key sequence in the actual database is 'Nocturne Chopin Seoul Symphony Orchestra' for all key sequences from 1-a to 1-f. Therefore, when a user inputs a key arrangement in 1-a to 1-f, in the process of extracting a sentence from the database, it is extracted as 'Nocturne Chopin Seoul Symphony Orchestra' so that the actually selected song is No. 1 in Table 16 will be.

No key sequence sentence 1-a 41614131-9-63564-9-624426513614411312 Nocturne Chopin Seoul Symphony Orchestra 1-b 41614131-9-624426513614411312-9-63564
[Corresponding to 'Seoul Symphony Orchestra Chopin'] Nocturne Chopin Seoul Symphony Orchestra 1-c 63564-9-41614131-9-624426513614411312
[Equivalent to 'Chopin Nocturne Seoul Symphony Orchestra'] Nocturne Chopin Seoul Symphony Orchestra 1-d 63564-9-624426513614411312-9-41614131
[Corresponds to 'Chopin Seoul Symphony Orchestra Nocturne'] Nocturne Chopin Seoul Symphony Orchestra 1-e 624426513614411312-9-41614131-9-63564
[Corresponds to 'Seoul Philharmonic Orchestra Nocturne Chopin'] Nocturne Chopin Seoul Symphony Orchestra 1-f 624426513614411312-9-63564-9-41614131
[Corresponds to 'Seoul Philharmonic Orchestra Chopin Nocturne'] Nocturne Chopin Seoul Symphony Orchestra

Therefore, if the extended key sequence for the same sentence (song) is registered in the sentence database of Table 16 as shown in Table 17, users can easily select the same song even if they key in regardless of the song name, composer, or performer. . That is, as shown in Equation (25), even if the user inputs a key, it matches the key arrangement corresponding to 1-c in Table 17, so song 1-c (actually, the selected song is the same as song 1 in Table 16) is extracted. As a result, the same result as extracting song 1 of Table 16 is obtained.

Chopin: ⑥③ (25a)

gap : ⑨ (25b)

Nocturne: ④① (25c)

gap : ⑨ (25d)

Seoul Symphony Orchestra: ⑥②④④② (25e)

In Example 29, all cases in which phrases constituting a sentence can be arranged by changing the order of phrases in a sentence in the database so that sentences can be extracted regardless of the order of the phrases constituting the sentence in the character prediction input. Registered. However, in this embodiment, as shown in Table 17, a database containing a list of key arrangements including the order of all phrases constituting a sentence is not used, and as shown in Table 16, only one key arrangement corresponding to one sentence is registered. A method of extracting sentences in which the order of phrases in a sentence does not change even if the user changes the order of phrases in a sentence, as shown in Equation 25, will be described. That is, a method for extracting sentence No. 1 of Table 16 even when the user inputs a key as shown in Equation 25 will be described.

The content of Table 5, which is the standard of the sentence prediction input method so far, checks whether the key sequence of the user's input key and the key sequence of the registered sentence in the database match from the first key sequence of the sentence, and if they match, the key sequence registered in the database extract sentences On the other hand, in the present embodiment, the key sequence input by the user is compared with the key sequence of the sentence registered in the database regardless of the order of the phrases constituting the sentence, and if any phrase in the sentence matches the corresponding key sequence, this sentences are extracted. This will be described using Equation 25 as an example, and the first key sequence input in Equation 25 is '63' in Equation 25a. So far, this key sequence '63' has been compared with the key sequence corresponding to the first phrase of all sentences in the database to extract only matching sentences. Compare the key sequence with the key sequence '63' of the user's first phrase and check if there is a matching key sequence. If there is a matching sentence in this process, a temporary sentence list for the next search process is formed. This is the first step. (Step 1) If there is a temporary sentence list in the first step, the key array '41' corresponding to the second phrase entered by the user is searched in the same way as the first step. . If there are matching sentences in this process, the temporary sentence list is reconstructed and proceeds to the next step, and this process is the second step. It is to search the list and extract matching sentences. This process is the third step. Assuming that Table 16 is a database, step 1 to step 3 are sequentially explained as follows.

< Step 1 >

Among sentences 1 to 4 of Table 16, sentences having a key sequence matching the key sequence '63' (Equation 25a) input by the user are sentences 1 and 2. That is, sentence 1 and sentence 2 match because the key sequence corresponding to the second phrase of these sentences is '63564' and starts with '63'. (Here, whether or not the whole is identical does not mean that the whole is identical, but it is determined that the input key sequence and the key sequence corresponding to the same number of keys from the beginning of the key sequence of the corresponding passage in the database are identical by comparing them from the beginning. That is, Table 18 Since the key arrangement corresponding to the first phrase of sentences 1 and 2 of is '41614131', the first two keys are the same as '41', so a match is determined.) Sentence 1 and sentence 2 in Table 16 for the next step search A search sentence list is constructed.

< Step 2 >

For sentences 1 and 2 in Table 16, which is the search sentence list in step 2, it is searched whether the second key array '41' (Equation 25c) input by the user matches. The key sequence corresponding to the first phrase of these sentences is '41614131', which matches because it starts with '41'. Therefore, Sentence 1 and Sentence 2 in Table 16 become the search sentence list in the next step.

< Step 3 >

For sentences 1 and 2 of Table 16, which is the list of search sentences in step 3, it is searched whether the third key sequence '⑥②④④②' (Equation 25e) input by the user matches. In the case of sentence 1 among these sentences, the key sequence corresponding to the third phrase is '624426513614411312' and starts with '⑥②④④②', so it matches. On the other hand, in the case of sentence 2, the key sequence corresponding to the third phrase is '5725225213614411312' and does not start with '⑥②④④②', so it does not match. Therefore, sentence 1 of Table 16 is selected as the extracted sentence.

Looking at the example shown above, the criteria for the sentence prediction input method shown in Table 5 can be summarized as shown in Table 18. In particular, for further explanation of criterion 2 of Table 18, when the key arrangement input by the user is equal to Equation (26), the process of extracting sentences from the database of Table 16 is as follows. First, among the key arrangement input by the user, the longest segment separated by blanks is '416' in equation (26c). Therefore, when '416' is compared with the database in Table 16, sentence 1 and sentence 2 match in the first phrase, so sentence 1 and sentence 2 become the next search sentence list. The second search step compares the key array '63' in equation (26a) with sentences 1 and 2, which are the second-level search sentence list. The next step is a search sentence list. Subsequently, comparing the key array '41' of equation (26e) with sentences 1 and 2, which are the list of search sentences in step 3, they match the first part of the first verse of these sentences, but this phrase is already the key sequence of equation (26c) in the first step. Since it is matched with, it is determined to be matched by overlapping, so the user key input represented by Equation (26) does not have a matching sentence. That is, in Equation (26e), the key arrangement is '41', but this is a key input corresponding to 'Ashkenazy' by the player, so a matching sentence (song) cannot be found in the database of Table 16.

criterion 1
The number of segments separated by blank keys in the key array entered by the user
It must be equal to or smaller than the number of segments constituting the sentence registered in the database.
criterion 2
When criterion 1 is met,

The number code sequence corresponding to the segment separated by the blank key in the key array entered by the user must compare and match the number code sequence corresponding to the phrase from the beginning for at least one phrase among the phrases constituting the sentence registered in the database. .

but,
Segments separated by blank keys in the key array input by the user must match different segments of the sentences registered in the database.
That is, a segment separated by a blank key in the key array input by the user must not overlap and match the same segment of a sentence registered in the database.

Chopin: ⑥③ (26a)

gap : ⑨ (26b)

Nocturne: ④①⑥ (26c)

gap : ⑨ (26d)

Askenage: ④① (26e)

As shown in steps 1 to 3 above, a search method that can extract the desired sentence from the database even if the order of the phrases constituting the sentence is changed using Table 16 was investigated. That is, without enlarging and converting FIG. 16 as shown in FIG. 17 , sentences can be extracted from the database even if the search process is changed and the order of the phrases constituting the sentence is input differently by the user. In other words, the order is not important when entering the selection elements (song name, composer, performer) necessary for selection to select music (or movie, etc.). When considered, the user cannot know in what order these elements are arranged in the database, so the present embodiment and the 29th embodiment provide a method to apply the sentence prediction input method to these non-sentential elements.

In addition, in executing this embodiment and embodiment 29, when the database has a small number of sentences registered in the database as shown in FIG. 16, even if only equation 25a is input, sentences 1 and 2 are extracted and can be easily selected. there is Comparing FIG. 16 and FIG. 17, the database in FIG. 16 can be organized more concisely than in FIG. 17, but the search process can be lengthy because key inputs input by the user must be compared for all phrases in the search process. On the other hand, in FIG. 17, the search process can be simplified, but the size of the database increases.

In Example 29 and Example 30, in order to select a song or movie that is not in the form of a grammatical sentence, the selection elements (title, composer, performer, etc.) are configured in the form of a sentence, and extracted from the database using a sentence prediction input method and input. I looked into the case of In these embodiments, each element constituting the database (title of song, composer, performer) is separated by a blank key and expressed as a single phrase in a sentence. However, there may be cases where the song title, composer, and performer are not a single phrase and contain spaces in themselves. For example, in the case of 'Chopin' as the composer, 'Frederic Chopin' can be displayed, and if this is displayed as number 5 in Table 19, even if the key input shown in Equation (25) is made, the method shown in Example 30 When the database represented by Table 19 is searched for, song 5 along with song 1 can be extracted and selected. In this respect, the elements that make up the sentence (song) registered in the database are not 'title', 'composer', or 'performer', but subdivided elements separated by blanks in each component constitute an actual database. Therefore, Table 19 shows 'song title', 'composer', and 'performer' in sentences representing songs in order to extract songs or movies displayed in sentences to the database when non-grammatical things such as music or movies are displayed in sentence form. It is not necessary to distinguish 'space' to distinguish between 'space' and 'space' included in the song title itself. Not only the name of the composer but also the name of the song has been expanded so that it is not 'Nocturne' but 'Nocturne C minor (C minor)' (Table 19 lists 'C minor' as the name of the song No. 6 in 'C minor' for the convenience of entering only the Korean keyboard) '), even if the key input shown in Equation (25) is made, song No. 6 can be extracted and selected. In this respect, if song number 5 is registered in Table 19, there is no problem even if song number 1 is deleted. However, in the case of No. 6 music, since a part of Chopin's Nocturne is specified, it is possible to register No. 1 and No. 6 music at the same time so that they can be distinguished. Therefore, as shown in Table 19, the blank key in the key arrangement representing the song is used not only for distinguishing the components (name of song, composer, performer) but also for spacing within each component to construct the key array of the database. If so, it is possible to select a song by extracting a sentence from this database using the sentence prediction input method based on the criteria shown in Table 18.

No sentence key sequence One Nocturne Chopin Seoul Symphony Orchestra 41614131-9-63564-9-624426513614411312 2 Nocturne Chopin Berlin Symphony Orchestra 41614131-9-63564-9-5725225213614411312 3 Moonlight Sonata Beethoven Seoul Symphony Orchestra 44221314632131-9-5733572-624426513614411312 4 Moonlight Sonata Beethoven Berlin Symphony Orchestra 44221314632131-9-5733572-5725225213614411312 5 Nocturne Frederic Chopin Seoul Symphony Orchestra 41614131-9-552737251-9-63564-9-624426513614411312 6. Nocturne in C Minor Frederic Chopin Seoul Symphony Orchestra 41614131-9-552737251-9-63564-9-624426513614411312

Table 19 shows that the sentences constituting the database, such as sentence 6, can also be applied to general sentences. In other words, regardless of whether the sentence components separated by spaces are originally song names or composers, all phrases as one element are compared with the key arrangement input by the user to determine whether they match, and can be extracted and selected from sentences registered in the database. It was confirmed that there is In this sense, if the criteria of Table 18 are applied to general sentences, it can be used for general searches such as Internet searches, rather than selecting music or movies.

In this respect, the sentence prediction input method of the present invention applies the sentence prediction input method to Internet search, and the Internet can be easily searched with a keyboard having an ambiguous key shown in FIGS. 10A and 18 . For example, if the sentence 'I'm going to school' is input as shown in Equation (27) using the predictive input keyboard shown in Table 18, the search engine (eg 'Google' or 'Bing' of Microsoft) As shown in FIG. 24, sites including the subject sentence 'I am going to school' are extracted and displayed. If the query index corresponding to the subject sentence of each site is defined as an ambiguous key sequence as shown in Table 20, sentences 1, 2, and 3 in Table 20 when key input is performed by the user as shown in Equation (27) Since it meets Table 10, which is the criterion of the sentence prediction input method, selection input is possible by being extracted from the database of the search engine configured as shown in Table 20.

As described above, when a user inputs a key with a keyboard made of ambiguous keys as shown in FIG. can be extracted. In this respect, since almost all commonly used sentences exist on the Internet, it is the most ideal database for sentence prediction input of the present invention. The reason is that the inconvenience in using the predictive input method is when words, phrases, or sentences are not registered in the database. To solve this problem, as in Example 5, registering words, phrases, or sentences that are not registered in the database It is inconvenient to perform a separate process in the input process. However, since almost all sentences commonly used by people are registered in the search index database of Internet search engines, it is possible to avoid the input process through a separate registration process as in Example 5, so sentence input through predictive input can be performed using a full keyboard. It can bring about the same effect as inputting sentences using it.

I am : ②①②⑤② (27a)

gap : ⑨ (27b)

at school : ⑥①①①③④⑦ (27c)

gap : ⑨ (27d)

going : ①①⑥②⑤③① (27e)

No website keyword sentence search index key sequence One I'm 8 years old, going to school. 21252-9-423225-9-612-9-6111347-9-1162531 2 I wear gloves to school. 21252-9-714115452-9-1513-6111347-9-1162531 3 I go to school. 21252-9-6111347-9-1162531

One of the advantages of the sentence prediction input method of the present invention is that the sentence can be predicted and input even if only a part of each word constituting the sentence is input. In addition, if the initial consonant input method of Hangul is applied to the sentence prediction input method, sentence input becomes easier and easier. Therefore, as shown in No 2 of Table 21, when registering a sentence in the database of the sentence prediction input method, the key sequence corresponding to the sentence is the key input sequence of each word constituting the sentence corresponding to the initial consonant of each word. Even if it is composed of , if the sentence is predicted, the key input corresponding to each word is reduced by more than half, so that the sentence prediction input is more convenient. That is, the key sequence corresponding to 'I am going to school' corresponds to '22' corresponding to 'ㄴㄴ' which is the initial consonant of the first word 'I', and 'ㅎㄱㅇ' which is the initial consonant of the second word 'to school'. If '614' and '123' corresponding to 'ㄱㄴㄴ' corresponding to the initial consonant of the last word 'going' are registered as a key sequence, even if the initial consonant of each word is entered, 'I am going to school' can be predicted and entered easily. there will be

No sentence key sequence One I go to school. 21252-9-6111347-9-1162531 2 I go to school. 22-9-614-9-123

In the sentence prediction input method of the present invention, even if English and Korean are designated as one ambiguous key, sentences in which English and Korean are mixed can be registered in the database without distinguishing between Korean and English. As shown in Table 10, as the English alphabet is also designated as an ambiguous key, if a key sequence is calculated and registered accordingly, sentences composed of English and Korean can be freely registered and extracted without distinguishing English and Korean as separate keyboards. Even numbers, as well as English, can be assigned to ambiguous keys so that numbers, English, and Korean can be mixed. The keyboard for this is shown in FIG. 25. Unlike English and Korean, the numbers '5, 6, 7, 8, 9' were made with two key inputs in order to designate only one number on one ambiguous key in the case of numbers, and to display this, ' 5, 6, 7, 8, 9' are marked in pink. This means that '5' means '+5' (the pink rectangle of the 'ㅁㅇ' key in FIG. 25 means +5, so it means '6' when combined with '1', and '7' when combined with '2' .) to press the designated 'ㅁㅇ' key and '0' designated 'ㄱㅋ' ('6', '7', '8', '9' press the 'ㅁㅇ' key corresponding to '+5' Next, press the keys corresponding to '1', '2', '3', and '4' respectively) to ensure that all numbers are accurately distinguished. The reason for doing this is that in the case of letters, words made up of combinations of characters assigned to each key are limited, but in the case of numbers, if two or more numbers are assigned to the ambiguous key, the numbers that can be combined with multiple ambiguous keys are pressed. Since the loss increases in proportion to the number of keys, only one number should be specified for the ambiguous key. 25 shows an example of a sentence extracted by key input using an ambiguous keyboard designated together with numbers, English, and Korean. When a user presses and inputs a key corresponding to the key sequence '3912' corresponding to '2NE1' to search for a song of singer '2NE1', as shown in FIG. 25, the song titles of '2NE1' are sentence prediction input method It is extracted from the database and displayed on the prediction sentence display window. Therefore, the configuration of the present invention provides a method for predicting and inputting English, Korean, and numbers using the same keyboard without mode conversion.

As shown in the 34th embodiment, the configuration of the present invention allows English to be input together with Korean, so that a web address can be input easily without keyboard conversion for English input. In particular, the '.' (period) symbol of the web address is regarded as a blank symbol and treated as a sentence, and the web address is registered in the database for the predictive input method as shown in Table 22, and the web address can be entered as the sentence predictive input method. there will be Furthermore, as shown in Figure 26, when the cursor is positioned on the web address input menu to input a web address, the database is set up so that only the web address can be selected from the database of the sentence prediction input method, so that the sentence extraction is searched in the area separated only by the web address. If configured, it increases the search speed and enables efficient sentence prediction. Figure 27 shows the case where the searched sentence consists of only the web address when the cursor is located in the web address bar as shown in Figure 26. The reason why the database configuration for the sentence prediction input method is subdivided to extract desired sentences is to reduce the number of sentences extracted in the sentence prediction input method so that the sentences to be input are extracted as predicted sentences.

web address key sequence first second third www.google.com 111 63361 739 www.bbc.com 111 997 739 www.youtube.com 111 2322291 739 www.daum.net 111 4129 912 www.naver.com 111 94711 739 www.cnn.com 111 799 739

In the sentence prediction input method, the sequence of extracting sentences is prioritized according to the frequency of predicted sentences, and the most frequently used sentences are listed first so that the user can select them. This is to apply to one word in the case of word prediction input. In the present invention, a high priority is given when the key sequence of each word constituting the sentence matches the input key sequence in addition to the frequency of the sentence. So, the case where the key sequence matches is preferentially arranged. For example, referring to the case of FIG. 28, the currently input key sequence is '22'. And the Korean word corresponding to this is 'you', the number corresponds to '11', and there is 'TT' in English. Therefore, the sentences including these have a higher priority than the sentence 'November illusion' including 'November', which does not completely match, and are arranged first in the prediction sentence display window. To summarize, it is shown in Table 23. That is, for the sentences extracted from the sentence prediction input method database according to Table 5, the key sequence of each word constituting the sentence and the key sequence of the corresponding input key are compared, and the number 'n' of words having the same key sequence is calculated. At the same time, by calculating the number of words constituting the sentence 'm', a sentence with a large 'n' is given a high priority, and if 'n' is the same, a sentence with a small 'm' is higher than a sentence with a large Sentences are arranged in order of priority so that the most appropriate sentence is selected. If 'n' and 'm' are the same, the priority order (the higher the frequency, the higher the priority) is determined according to the frequency of each sentence and arranged. In light of these standards, 'November illusion' in FIG. 28 is n = 0 and the rest of the sentences are n = 1, so 'November illusion' is arranged last in the prediction sentence display window.

Priority
output order detail One Calculate the number (n) of input key sequences that match the key sequence constituting the sentence 2 Calculation of the number of words constituting a sentence (m) 3 A statement with a large n has a higher priority. 4 For sentences where n is equal,
Statements smaller than m have higher precedence.

29 shows an example of a Korean keyboard for the sentence prediction input method of the present invention. This is different from the Korean keyboard shown in FIG. 28, the 'ㅅ' key is placed at the bottom left, and among the vowels, 'ㅜ, ㅔ, ㅔ' are arranged in order from the top to the left, and 'ㅗ, あ, ㅐ' are arranged sequentially from the top. And, 'ㅡ, ㅣ, ㅢ' is assigned to the top key in the center. The background of this arrangement is to make it similar to the arrangement of Cheonjiin in the case of consonants so that users can easily understand the location of consonants, and in the case of vowels, it is easy to input complex vowels (ㅝ, ㅞ, ㅘ, ㅙ) In order to do this, 'TT, sh, ㅔ' and ㅗ, A, ㅐ' are arranged on a straight line, and 'TT' and 'ㅗ' are arranged adjacent to 'ㅣ' to make it convenient to input 'ㅚ, ㅟ' will be.

30A is a swipe method (in the input method having a touch sensor, in order to input the word 'few' in the word prediction input method, the key to be input is not touched one by one, but the key at the position where the finger first touches the touch sensor is first If you start with a letter and pass the key corresponding to the letter you want to input while your finger is in contact with the touch sensor, it will be input) 'few' is input as the finger trajectory. Also, in this swipe method, even if the same key needs to be input twice or more, the input is completed with a single touch (in the dragging process, the character passes through the designated key only once). The keyboard shown in FIG. 30A is a Google Pinyin keyboard, and Chinese and English (a word prediction input method is applied) can be input. When the 'wxyz' key is touched and the fingers are separated, 'few' is input as shown in FIG. 30A. However, 20 predicted words are displayed in the predicted word display window 302 on the left side of FIG. 30A. In fact, in the keyboard system of FIG. 30A, the predicted word display window 302 capable of showing predicted words can show 16 words, so that the last line 303 is hidden by touching the arrow 304 next to the predicted word display window. (302) should be shown and then selected. That is, key input is fast with the swipe method, but when the space for displaying the predicted word is limited, it takes a long time to display and select the predicted word on the display window 302, so the situation in which the speed is lowered when looking at the entire input process gets hit Therefore, in order to increase the speed of the overall input, the number of predicted words must be reduced, and for this, the swipe method must be supplemented in two aspects. The method can be summarized in two ways as shown in Table 24 below.

Method 1 Distinguishes between a case in which key input is performed only once for a key that the swipe trajectory passes through, and a case in which key input is performed more than once. Method 2 If method 1 applies,
Arrange the keys on the keyboard so that the straight line trajectory of the swipe does not cover more than 3 keys

Method 1 is a configuration corresponding to an algorithm applying the swipe input method. Therefore, in this solution, after the swipe trajectory is made, only a word corresponding to one key input sequence (key sequence) in which one or more key inputs are performed for the key that the trajectory passes is predicted. On the other hand, Method 2 is not realized by an algorithm, but is accompanied by a change in the shape of the keyboard in a way that brings about a geometric change in the key arrangement.

Looking at Method 1 in relation to the input of 'few', the predicted word for the swipe trajectory 301 in FIG. It shows that method 1 is not applied. Therefore, if Method 1 is to be applied, the swipe trajectory 301 of FIG. 30A must be modified. In general, in order to apply the method of Table 1, when the same key needs to be input twice or more, a circular trajectory is drawn within the same key area so that the key is repeatedly input, unlike the trajectory that simply passes by. Alternatively, when the finger stays on the corresponding key for a short time, one key input is performed, and when the finger stays on the key for a long time, the number of inputs is increased according to the stay time. In this way, even if the swipe trajectory has the same geometric shape, the occurrence of multiple key input sequences (key sequence) in the same swipe trajectory is prevented from occurring by distinguishing the number of key input repetitions by differentiating the staying time or the staying shape of the key, FIG. 30a Since the words 'few' and 'ex' predicted by the trajectory 301 are distinguished, the trajectory drawn to input 'few' (lengthen the time the finger stays on the 'def' key, or make a circle from the 'def' key) drawing motion), words such as 'ex', 'DX', 'DW', and 'ez' are not extracted from the prediction word list. That is, method 1 of Table 24 includes repetitive inputs of keys that the swipe trajectory passes through, so that the number of predicted words can be reduced by arranging them. And, in relation to method 2 of Table 24, the input of 'few' in FIG. 30A will be reviewed. In order to satisfy Method 1 of Table 24, the swipe trajectory 301 for inputting 'few' in FIG. 30A draws a circular trajectory from the 'def' key or lengthens the staying time, and then uses the 'def' key and 'wxyz' It should be modified to draw a trajectory that connects the keys in a straight line. Even if the trajectory is modified in this way, since the swipe trajectory cannot avoid the 'mno' key located in the middle of these keys in the keyboard of FIG. can't make it If the trajectory is changed in order not to pass the 'mno' key, the neighboring key 'jkl' is passed, so the 'mno' key cannot be avoided. Therefore, in order to implement Method 2 of Table 24, another key is arranged so that no other key is located within a straight line connecting any two keys on the keyboard. To this end, FIG. 30B schematically explains the process in which the keyboard of FIG. 30A is deformed. (a) of FIG. 30B describes a situation in which method 2 of Table 24 should be applied. That is, as shown in (a) of FIG. 30B, the trajectory 305 connecting the keys (keys 1, 3, 5, and 7) located at the corners is located in the middle (keys 2, 4, 6, and 8) , and the position of the key located in the middle must be changed to implement method 2 of Table 24. And Fig. 30b (b) shows that the positions of keys 2, 4, 6, and 8 were changed to implement method 2 of Table 24. In summary, in the state in which keys 1, 3, 5, and 7 located at the corners of the keyboard are fixed in (a) of FIG. 30B, the swipe trajectories 305 connecting the keys located at these corners are The 2nd, 4th, 6th, and 8th keys are moved so as not to pass through the center of the key, and in the case of the 0th key, the position of the 0th key is vacated because there is no proper position to move. And when keys 2, 4, 6, and 8 are moved in this way, the shape of arranging keys at the vertices of an octagon is naturally formed. The point to be considered here is that the moving distance of the 2nd, 4th, 6th, and 8th keys from their original positions must be set to some extent. If (C) and (D) of FIG. 30B are described as an example, it may be good if the 4th key moves as far as possible from the trajectory 306 connecting the 3rd and 5th keys, but as the distance becomes longer While the 4th key can move away from the trajectory 306, a situation occurs in which the 2nd, 3rd, and 4th keys are located on the same line, so the 2nd, 4th, and 6th keys as shown in FIG. 30B (b) , The form in which key 8 is arranged at the vertex of a regular octagon is most preferable, and specifically, the trajectories 306 and 307 shown in (c) and (d) of FIG. 30b are distinguished by the swipe trajectory determination algorithm You can adjust the distance within the range. Summarizing the above, in the case of a keyboard with 8 character keys, when the swipe method is applied to the word prediction input method, the central area of the octagon is emptied to reduce the number of predicted words, and 8 character keys are arranged at the vertices to form two The keyboard is configured such that the number of predicted words is minimized by making the linear trajectory connecting the two character keys deviate from the center of the other character keys. That is, the trajectory connecting the two keys to be input does not pass the center of the key not to be input, so that only one key input sequence (key sequence) is made for the swipe trajectory.

The keyboard shown in FIG. 31A has seven character keys arranged at the vertices of a heptagon based on the configuration presented in Example 38. .) In order to use the key arrangement of the English qwerty keyboard, a regular 7-sided keyboard is applied. 'qwer', 'tyu', 'iop', 'asdf', 'ghjkl', 'zxc', 'vbnm' character groups are assigned to the seven keys. Looking at its characteristics, it is a form in which keys are arranged at positions corresponding to each vertex of a regular hexagon. The advantage obtained from the swipe-type input method by arranging the keys in this way is that no other letter keys are located between the two keys in the finger trajectory toward the key to be input. For example, it will be described by comparing the finger trajectory for inputting the Korean word 'mosquito' in the swipe method with the keyboard shown in FIG. 31B and the general keyboard type (FIG. 31C). 31c shows a lattice type keyboard composed of 9 keys in the form of a general keypad. The traces (red traces) of FIGS. 31B and 31C show finger traces for inputting 'mosquito'. In other words, the touch starts from the key designated by 'ㅁ', passes through the key designated by 'ㅗ' and the designated key by 'ㄱ', and finally reaches the designated key by 'ㅣ', separates the finger from the keyboard, and inputs the swipe method. way is done From this swipe trajectory, 'mosquito' can be predicted and entered. However, in the trajectory shown in FIG. 31c, the same trajectory is passed even when the word 'grid' is input in the swipe method in addition to 'mosquito'. That is, in the process of moving to the key designated by 'ㅗ' and the key designated by 'ㄱ', an unwanted key (the key designated by 'ㄴ') is passed by, resulting in a situation in which an unwanted key is pressed. On the other hand, in the key arrangement of the keyboard shown in FIG. 31B, since the trajectory of moving the key designated by 'a' from the key designated by 'ㅗ' does not pass through other key areas, unlike Fig. 31c, unwanted keys are not input. That is, in the key arrangement of the keyboard shown in FIG. 31B, there are no other keys on a straight line trajectory from one key to the remaining six keys, so the input method by the swipe method requires the key corresponding to the letter of the word to be input. It is to bring about the same result as pressing one by one. That is, in the case of the general lattice keyboard shown in FIG. 31C, when three keys located on a straight line are passed, it is unclear whether or not the middle key must be input, so the key sequence and intermediate key input do not include the input of the intermediate key. Due to the key sequence including , two key sequences occur. If there are two cases where the swipe trajectory passes through three keys on a straight line, a total of four key sequences, two for each trajectory passing through the three keys, is generated, and only one key sequence is generated. FIG. 31B The number of words to be predicted increases 4 times compared to the keyboard shown in . Therefore, the selection process becomes difficult due to the increased number of predicted words. When this situation is applied to sentence prediction, assuming that there are 3 words constituting the sentence and that 4 key sequences occur for each swipe trajectory, there are 64 key sequence combinations for sentence prediction. Furthermore, if four sentences are predicted for each key sequence combination, the total number of predictable sentences is 265. It becomes practically impossible to select a desired sentence from such a large number of predicted sentences. In this respect, when an ambiguous key keyboard is input in a swipe method, it is important to arrange the keys so that unwanted keys are not located on the path connecting the key to be input. In this regard, as shown in FIG. 31B, the vertices of the heptagon (a heptagon is formed by connecting the centers of each key in FIG. 31B) or the keys are arranged on each side of the heptagon so that each key when inputting the swipe method It is possible to prevent unwanted keys from being located on the shortest distance trajectory connecting . The structure of the thirty-eighth embodiment and this embodiment is the same in that a swipe trajectory connecting two vertices by arranging letter keys at the vertices of a polygon has only one key input sequence. However, in the heptagonal keyboard form of this embodiment, the keys of the commonly used qwerty keyboard are grouped into 7 and assigned to 7 keys so that the user can easily recognize the key arrangement (arrangement of characters) in the keyboard. Example 38 The octagonal shape of is transformed into a heptagonal keyboard.

In the swipe-type input method by arranging keys at the vertices of the heptagon examined in Example 39, the unity of the key sequence for the swipe trajectory (when there is only one key sequence corresponding to one swipe trajectory) In order to maintain the key), it is necessary to ensure that the straight line trajectory from each key to the second neighboring key does not pass through the center of the immediately neighboring key. For example, since the trajectory 307 shown in FIG. 32A passes through the center of the No. 4 key, the No. 4 key is input, and the trajectory 306 passes through an area away from the center of the No. 4 key, so no key input is performed. That is, it is determined whether or not the trajectory has passed through the No. 4 key according to the degree of bending of the trajectory in the area of the No. 4 key. The contents of the trajectory determination criterion should be adjusted according to the pointing device designating the point where the touch is made on the keyboard. For example, if a pointing device that touches a keyboard can accurately know the touch point, such as a stylus pen, the user can accurately distinguish and follow the traces 306 and 307 of FIG. You can't tell if a point is the center of a key or not. Therefore, although the user intends the trajectory corresponding to 306, the user may actually move along the trajectories 308, 309, and 310. Therefore, the criterion for judging the trajectory in consideration of the various trajectories 306, 307, 308, and 309 shown in FIG. By distinguishing the difference in trajectory, the standard is established. That is, whether or not the number 4 key is input is determined according to the geometric shape (degree of bending) of the trajectory passing through the key 4, so as shown in FIG. There are times when it doesn't support it. Therefore, if the criteria created in this way do not match the trajectory created by the user's finger or pointing device, users may go through a process of adapting to this criterion through trial and error, or change the trajectory judgment criteria to suit the user's habit. You can do it. That is, the swipe input method has a probability of error compared to the input method in which each key is input in the touch method. In order to reduce the rate of occurrence of such errors, a method of reducing the size of each key disposed at the vertex of the polygon is considered. As one of these methods, as shown in FIG. 32B, the size of the keys disposed at the vertices of the regular polygon is reduced. The regular polygons shown in FIG. 32B are figures inscribed in a circle of the same size as shown in (a) of FIG. 32b. In addition, the size of the key arranged at the vertex of each figure is adjusted so that the trajectory connecting the two keys does not pass the other key, and the key in FIG. 32B has the maximum showing the size. That is, as shown in (c) to (f) of FIG. 32b, the straight line trajectories (324, 325, 326, 327) connecting the second closest key from key 1 of each regular polygon to key 3 are It becomes the outer boundary of the region 320 of the trajectory moved by the key #. Accordingly, in the case of the No. 2 key, it comes into contact with the boundary lines 324, 325, 326, and 327 of the trajectory area 320 connecting the No. 1 key and the No. 3 key. The configuration of this embodiment is to adjust the size of the keys arranged at the vertices of the regular polygon so that the trajectory connecting the two keys does not pass other keys. Therefore, in the keyboard form of FIG. 32B, the criterion for determining the swipe trajectory is set to "include all keys that pass the trajectory in the key sequence". You have the advantage of not having to worry about it. That is, in the key arrangement shown in FIG. 32A, since the user cannot accurately grasp the trajectory judgment criterion for distinguishing trajectory 306 (no key input of key 4) and trajectory 307 (key input of key 4), input after drawing the trajectory While it is necessary to check the result to see whether or not the input has been accurately performed, in the key arrangement of FIG. 32B, the overpassed key area can be visually checked, so the user can visually check whether the trajectory meets the criterion, so the trajectory of FIG. 32A Since the confirmation process according to the judgment standard can be omitted, quick and convenient input is provided.

As shown in FIG. 32B, the maximum size each key can have in order to satisfy the condition that a straight line connecting two keys does not pass through another key area decreases as the number of vertices of a regular polygon increases. . Furthermore, since the key shown in FIG. 32B is the maximum size that can not pass another key, which is the trajectory connecting two keys, if the size of the key becomes smaller, the trajectory connecting the key No. 1 to the No. 3 key in FIG. 32B is the No. 2 key The probability of passing is low. On the other hand, if the user wants to increase the size of the key while maintaining the distance between the keys to facilitate key selection, the number of vertices of the polygon should be reduced as shown in FIG. 32B. That is, the number of keys must be reduced. Conversely, if you want to increase the number of keys, the number of vertices of the regular polygon increases, and accordingly, the size of the keys arranged at the vertices of the regular polygon inevitably decreases. That is, the number of keys and the size of a key are inversely proportional. If you want to increase the size of the key to facilitate key selection, you need to reduce the number of character keys arranged in the polygon. In this case, as a result, the number of characters to be assigned to each key in the predictive input method is It brings a lot of downsides. That is, if the number of characters assigned to one key increases, the number of words predicted from the same key input increases accordingly, so the size of the key increases, making key selection easier, but the number of predicted words increases. The process of selecting a desired word from prediction words is difficult. In order to compensate for this disadvantage, a method of maintaining unity of a key sequence for a siwpe trajectory without reducing the number of keys as a method of increasing the size of the key is shown in FIG. 33 . In summary, if you increase the size of keys arranged in the same regular polygon, a part where the siwpe trajectory overlaps with an unwanted key occurs. By inactivating this overlapping part, even if the size of the key increases, the unity of the key sequence for the swipe trajectory is maintained. way to do it In detail with reference to FIG. 33 , FIG. 33A is a state in which keys are arranged at the vertices of a regular heptagon and unity of key sequence is maintained for all linear trajectories connecting keys 1 and 3. Doubling the diameter of the key is shown in Figure 33b. When the diameter of the key is doubled, the area (the area between 333 and 335) through which the straight trajectory connecting the key 1 and the 3 passes overlaps half of the key 2. When this is overlapped, both the case where the key sequence is '1'-'3' and the case of '1'-'2'-'3' are possible for the trajectory connecting keys 1 and 3 As a result, the unity of the key sequence for the swipe trajectory collapses, so the trajectory 333 is moved to 334 to reduce the area through which the straight trajectory passes, and this virtual area (the area between 334 and 335) overlaps with the second key. area is considered to be a non-overlapping area. If the non-overlapping area is defined in this way, if the contact point of key 1 stays in the area 336 before the area is enlarged, the trajectory of moving to key 3 is less likely to overlap with key 2, so key input for the swipe trajectory The key sequence is determined as '1'-'3'. In general, when a finger touches a touch sensor, since the finger is approximately positioned close to the center of a key, the actual user's swipe process is similar to the process occurring in the arrangement of keys as shown in FIG. 33A. Therefore, as shown in FIG. 33C, the area obtained by applying the reduced area (the area between 334 and 335) of the connection trajectory of the 1st and 3rd keys from the 2nd key to the 7th key in sequence (the 2nd key and Key 4, Key 3 and Key 5, Key 4 and Key 6, Key 5 and Key 7, Key 6 and Key 1, Area Between Key 7 and Key 1) A regular heptagonal area 337, which is a virtual area, is formed. In other words, by defining this virtual area as a non-overlapping area, if you pass this area during the swipe process, even if the finger contact point (when the contact point corresponds to the mouse cursor, the location point of the cursor) passes the key, it is not recognized as a key input. It is a design of an embodiment. Based on these contents, in order to increase the user's convenience, a method for adjusting the distance from the trajectory line 333 to the user's desired virtual trajectory line 334 defining the size of the key and the non-overlapping area may be provided. there is. In addition, it is possible to provide a method of defining the swipe trajectory 334 as an arc rather than a straight line and applying it according to the user's finger movement (or mouse cursor movement). When the non-overlapping area provided in this embodiment is set, the size of the key is increased without damaging the unity of the swipe trajectory, thereby promoting the ease of key selection and the convenience of the swipe operation. Furthermore, as shown in FIG. 34, various geometric shapes that are not circular in shape of keys can be applied, and as shown in FIG. Non-character input and other various functions that are not in charge of the key can be added. In addition, these keys (keys 'a' to 'four') located in the non-contact virtual area 337 are located in the non-contact virtual area even if the swipe trajectory for the word prediction input method passes these keys, so 1 to 7 No input is made due to these keys in the swipe operation started from the key. However, if the contact starts from these keys and the contact ends from these keys, the function assigned to these keys is performed, and if the contact ends from these keys, When a drag (swipe) operation continues, additional functions may be performed according to the trajectory, thereby increasing input diversity and efficiency.

In the word prediction input method, when a key is input by a swipe method, if the same key needs to be input twice or more, the word can be predicted even if it is passed only once. That is, the swipe trajectory shown in FIG. 35A is the trajectory for inputting 'need'. Start touching from key 5 where 'n' is designated, move to key 1 to input 'e' with your finger touching the touch sensor (if you pass key 1, not only words containing only one 'e' , Words containing two or more 'e' are also extracted in the database), then move to the number 7 key where 'd' is designated and then take your finger off the touch keyboard, 'need' is extracted ('need' as well as 'e' 'Ned' containing only one is also extracted) and input. In this case, the key input sequence is interpreted as '5'-'1'-'7' and '5'-'1'-'1'-'7'. However, when input is made by the swipe method in the word prediction input method, when a key is passed by a swipe trajectory as shown in FIG. Since it is included, it is necessary to pass the number 1 key twice, but in the general grid keyboard shown in FIG. has the same effect as On the other hand, the keyboard of the present invention shown in FIG. 35 drags to the area outside the key (the area including the non-contact virtual area) and returns to the key again, resulting in the result of skipping twice. -(1)-(1)-(7) is determined in order and 'need' is predicted. On the other hand, in the case of FIG. 35A, since the key area where the finger passes is (5)-(1)-(7), 'need' composed of 4 letters cannot be predicted, and instead 'Ned' composed of 3 letters it is predicted 35(c) shows the trajectory of inputting 'pioneer'. This is because the trajectory of FIG. 35 (b) moves to the non-overlapping area to input 'e' of 'need' twice and then returns to the number 1 key, whereas the trajectory of FIG. 35 (c) shows the 'pioneer' To input p', 'i', 'o', move to the outside of the non-overlapping area (outside of the heptagon connecting the letter keys), return to the number 3 key, and press the same key 3 times It is to be recognized as a process. Similarly, after passing key 5 to input 'n' to input 'eer' of 'pioneer', move to key 1, move to the area outside the non-overlapping area, get out of key 1, and return to key 1 again. Then, when the fingers are separated, it is recognized as a process of inputting the number 1 key corresponding to 'eer' three times, and the trajectory of 35(c) becomes the swipe trajectory for inputting 'pioneer'. 35b and 35c, when one key is touched, it escapes to the non-overlapping area, and when it returns to this key, key input is performed once more, and it escapes to the outer area of the polygon corresponding to the non-overlapping area The idea is to have it go through two more keystrokes when it comes back. In this way, it is possible to increase the convenience of key input by dividing the inner and outer areas of the polygon connecting the character keys and designating them as areas where the swipe trajectory passes. In addition, by matching the number of keys passing through the swipe trajectory with the number of letters constituting a word, the number of predicted words is reduced, making it easier to select predicted words. Furthermore, in the case of sentence prediction input, when duplicate input of keys that exceed the swipe trajectory is allowed, a plurality of key input sequences for each word constituting the sentence become plural, and as discussed in Example 38, The number is so large that it is difficult to choose. Therefore, the configuration of the 38th embodiment and this embodiment provides a keyboard with increased convenience and accuracy that satisfies the key sequence (key input sequence) unity for the swipe trajectory. Summarizing the above, the 38th embodiment provides a configuration for preventing unwanted key input, and this embodiment distinguishes between a single key input and multiple key inputs, and only one key input for the swipe trajectory. It provides a way to minimize the number of predicted words by providing an order.

As described above, the sentence prediction input method of the present invention can improve the convenience and speed of input with a small number of keys, so it can demonstrate its effectiveness in mobile devices such as smart watches, and furthermore, the number of keys such as remote controls will be applied to limited input devices to overcome the situation where remote control has not been used for text communication so far, which will serve as an opportunity to further expand the usability of these devices. In the future, the input device in the form of a remote control to be used in VR (virtual reality) and AR (augmented reality) will provide efficient text input using 8-direction keys.

Claims (9)

A word prediction input method in which a number of characters are assigned to one key, and by pressing these keys to extract and input words made of combinations of characters assigned to these keys according to the key input order, not only letters but also symbols are like letters. An input system that implements a predictive input method that assigns multiple symbols to one key and presses the key only once without distinguishing between these symbols to extract not only words but also phrases and sentences containing the symbols assigned to the key. claim The input system according to 1, which implements the phrase prediction input method including spaces among the symbols input by the phrase prediction input method. In claim 1, when there is no sentence corresponding to the ambiguous key input for sentence input, in the process of registering the sentence according to the entered ambiguous key sequence, word prediction input for the rest except for the ambiguous key input corresponding to symbols and blank characters An input system that implements a method of registering sentences by applying
In claim 1, even if only a part of each word constituting the sentence to be input is entered by the ambiguous key input for sentence input, the sentence is extracted from the database as a predicted sentence, so that the input system is selected/entered.
A predictive input system for an input device having limited keys by assigning a symbol to one key in claim 1 and distinguishing between letters and symbols
In claim 2, the prediction input system distinguishes the meaning of 'space' from 'sentence-space' that classifies words in a sentence and 'search-space' that classifies search words or phrases during a search.
In claim 1, a predictive input system having a key arrangement in which the 'space' key and the 'symbol' key arranged in the keyboard are mutually switched according to the input environment and can be entered at once without using an extension key.
In claim 1, a sentence prediction input system using a word prediction input method that enables selection by displaying a predicted word in the keyboard in the process of registering in a database when there is no sentence or clause to be searched after key input for sentence prediction input is made.
claim In case of Hangul predictive input in 1, a grammatical blank key is specified, and in case of phrases and phrases, sentence prediction input system that extracts words and stems separately from postpositions and endings to a dictionary database and combines them with separately extracted postpositional and ending prediction lists.

Images