| 摘要 |
PROBLEM TO BE SOLVED: To estimate even an unregistered word based on its head several characters in the next and following input steps as long as the word is once inputted by deciding the connection between a character string that is selected among those candidates of estimated character strings and a character string that is stored in a character string buffer in the preceding retrieval step. SOLUTION: A connection decision part 110 refers to the character types or the grammar information stored in a grammar dictionary 111 to decide the connection between a candidate character string that is selected by a user or a character string that is directly inputted by the user and a character string that is stored in a character string buffer 112 in the preceding retrieval step. When a connectable state is decided by the part 110, a character string register part 113 stores the character string that is selected or directly inputted by the user in the buffer 112. If an unconnectable state is decided by the part 110, plural character strings if inputted in the buffer 112 are connected together into a compound word which is registered in a character string learning table 106. Then the buffer 112 is cleared. |
