JP2006012188A - Document processing method and apparatus - Google Patents

Abstract

[PROBLEMS] To efficiently convert a document by inputting a mixed sentence of Japanese and foreign languages.
A document comprising input means capable of inputting Roman characters or Kana characters, and Kana document conversion means for converting a Kana character string input from the input means into a document character string via a Kana document conversion dictionary. In the processing device, there is provided a Kana alphabet conversion means for converting the Kana character string into an English character string according to a reverse Roman character rule, and an English character string generated according to the reverse Roman character rule is added to a word conversion candidate of the Kana document conversion dictionary. The above object can be achieved by making it possible to present / select.
[Selection] Figure 5

Description

  BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a kana input and / or Roman character input type document processing method and apparatus, and more particularly to a document processing method effective for creating a document in which Japanese and foreign languages such as English, German and French are mixed. And an apparatus.

  2. Description of the Related Art Conventionally, in Japanese word processing, personal computers, workstations, and other document processing methods and apparatuses related to Japanese, a Japanese input method using Roman-Kanji conversion or Kana-Kanji conversion has been widely used. Today, however, technological advances are so strong that new technical terms are born one after another, and the internationalization of information is very advanced. Therefore, not only Japanese words and sentences but also French and German are included in Japanese sentences. Foreign language words or sentences such as Japanese, Spanish, Italian, English, etc. may be used in Japanese sentences without spelling the original etymology or pronunciation Roman letters, rather than katakana notation. Not a few. In particular, computer-related technical terms, company names, names, etc. tend to be written as they are in alphabets, abbreviations, etc. in the Japanese text in manuals, academic journals, contracts, etc.

  To cope with such a situation, the Romaji character string input from the key input device etc. in the Romaji input mode is converted to a mixed character string of Kana-Kanji character strings and foreign language character strings without requiring any special operation. A kana-kanji conversion device that can do this is introduced in Japanese Patent Laid-Open No. 4-75162. Furthermore, Japanese Patent Publication No. 5-85055 discloses a Romaji-Kanji conversion device that can input Japanese characters with less burden on the user by utilizing the characteristics of adjacent relations of characters appearing in the inputted Romaji character string. ing.

  In such a conventional romaji input type Japanese document processing device, a romaji input character string is first converted into hiragana, and a character string that cannot be converted into hiragana is not regarded as Japanese but is regarded as a sub-language or English word. Dictionary conversion processing is performed by an English word dictionary / sublanguage dictionary that is distinguished from Japanese. In other words, conventionally, the character string that can be converted into hiragana in the input character string is a Japanese dictionary, and the character string that cannot be converted into hiragana is automatically classified and converted into a sub-language dictionary on the device side. For example, there is a problem that a word such as “DATE” indicating a date is not displayed and presented to the user as a candidate for conversion of a character read and input as “date”. Also, just registering the word “book (key input in lowercase, full-width mode)” in the sub-language dictionary will result in incorrect dictionary conversion when key-input is made with “BOOK”, “Book”, etc. This requires the user to register the word in the dictionary, and there is a problem that it is very troublesome to edit the foreign language word in the Japanese document processing.

  The present invention has been made for the above-mentioned circumstances, and an object of the present invention is to use an input character string including English letters / symbols, numbers, etc. in a Roman character input or Kana input document processing apparatus. When the key input operation is performed without distinguishing between foreign language and Japanese, the character string written in alphabet is not registered in the dictionary, and it is presented to the user with the reverse Roman alphabet rule and selected. Another object of the present invention is to provide a general-purpose document processing method and apparatus that automatically registers the reverse Roman character string in the dictionary and allows document processing without distinguishing between Japanese and foreign languages.

  The present invention is a kana input expression document comprising at least input means capable of inputting kana characters and kana document conversion means for converting a kana character string input from the input means into a document character string via a kana document conversion dictionary. The above object of the present invention is to provide a kana-alphabetic conversion means for converting the kana character string into an English character string according to a reverse romaji rule, and to the word conversion candidate of the kana document conversion dictionary, the reverse roman character This is achieved by allowing an English character string generated by a rule to be additionally presented / selected.

  The present invention also relates to a kana input type document processing method. The above object of the present invention is to input a kana character string through an input means capable of inputting at least kana characters, and a kana character input process. A kana document conversion step for converting a string into a document character string via a kana document conversion dictionary, and further, in this kana document conversion step, a kana character string to be converted as a word candidate for kana document conversion This is also achieved by providing a reverse Romaji conversion step capable of converting to an English character string by applying, and presenting the generated English character string to the user.

  Furthermore, the present invention relates to a Roman character input type document processing apparatus, and the above object of the present invention is to provide an input means capable of inputting at least an English character and an English character string input from the input means according to a Roman character rule. It is also achieved by comprising an alphabetic kana conversion means for converting into a string and a kana document conversion means for converting a kana mixed character string converted by the alphabetic kana conversion means into a document character string via a kana document conversion dictionary. The

  Furthermore, the present invention also relates to a Roman character input type document processing method. The above object of the present invention is to input an English character string through an input means capable of inputting at least English characters, The Kana conversion process to display the converted English character string into a Kana mixed character string according to the Roman rules, and the Kana mixed character string generated by this Kana Kana conversion process into the document character string via the Kana document conversion dictionary This can also be achieved by providing a kana document conversion process.

  In the present invention, the character string input in Roman characters is treated as the same character string without distinguishing between Japanese and English / alphabet, so the input character string must be distinguished between Japanese and another language. There is no. Therefore, the Roman character input does not require any mode switching operation between the Japanese text mode and the English text input mode, and the key input of the document is possible. In addition, it is possible to simultaneously input words such as Japanese and Roman characters / English in the sense of normal English key input without operating the English uppercase input key and English lowercase input key. In addition, when an English character string presented to the user after reverse romaji conversion is selected and confirmed as the notation of the conversion target word, this can be automatically detected within the document processing apparatus, so this new notation format The Kana document conversion dictionary does not require any user operation and can be automatically added and registered. When the same Kana character string is input after the second time, the Kana character string is automatically converted to an English character string. Efficiently create / edit Japanese sentences mixed with English characters.

  According to the document processing method and apparatus according to the present invention, it is possible to efficiently create a sentence in which Japanese and a foreign language are mixed by providing a reverse Roman character conversion section in the notation selection section. In addition, when creating sentences that include Japanese addresses and names in Japanese and Roman characters, such as “Patent Taro” and “TOKYOTARO”, just input the kana in Roman characters and request the next candidate. Romaji conversion is very convenient because it can be converted automatically, and words that have been converted to Romaji can be automatically registered in the dictionary in accordance with the environment setting parameters. It can be integrated and processed without distinction.

  Exemplary embodiments of a document processing method and apparatus according to the present invention will be explained below in detail with reference to the accompanying drawings.

(Embodiment)
FIG. 1 is a block diagram showing an example of a schematic configuration of hardware of a document processing apparatus according to the present invention. Various processes of the document processing apparatus are executed by an MPU (microprocessor) 2, and reading characters are read by a keyboard 4 or a mouse 5. Various user input operations such as column input, conversion instruction, and confirmation instruction are performed. The display means 6 such as a CRT or liquid crystal displays a document being input, Kana-Kanji conversion candidates, operation guide messages, and the like, and the ROM 10 contains various control programs executed by the MPU 2 and common data used by the execution programs. On the other hand, the storage means 12, such as a hard disk, an optical disk, or a flash memory, stores a document processing program, a kana document conversion dictionary 14a, a mathematical expression conversion dictionary 14b, a chemical expression conversion dictionary 14c, a postal code dictionary 14d, and a synonym dictionary 14e. ,..., Various medical dictionaries such as a medical term dictionary 14x are stored, and are appropriately referred to in the kana document conversion process. Further, the RAM 20 is appropriately set with a work area for the MPU 2 to execute various processes, a kana document conversion unit 22 read from the storage means 12, and the dictionaries 14a to 14x when the apparatus is started up. Yes. Further, the kana document conversion unit 22 includes an input / output control unit 30 for kana-kanji conversion and romaji conversion (these conversion processes are hereinafter referred to as kana document conversion) and a conversion engine section 70a for executing kana document conversion. The above-described units exchange data with each other via the bus 8.

  FIG. 2 is a functional block diagram of software showing the relationship between the kana document conversion unit 22 (input / output control 30 and conversion engine unit 70a) and the dictionaries 14a to 14x. From the document processing program execution unit 23 including the kana-kanji conversion processing and the like. When the input / output control unit 30 receives the output key operation information, the received key operation information is the data key information for the read character string output from the keyboard 4 by the determination processing unit 40 in the input / output control unit 30. Or the instruction information input such as conversion instruction, confirmation instruction, menu display instruction, etc. output from the keyboard 4 or mouse 5, and in the case of reading character string data key information, the kana input in the data key processing unit 42 It is processed by the processing unit 44 or the Romaji input processing unit 46 and is sequentially written into the reading character string buffer 52 provided in the storage unit 50. Going on. Note that a Roman character Kana conversion unit 48 is provided inside the Roman character input processing unit 46, and when a specific Roman character string is input, the Kana conversion table or the rules for inputting continuous consonant characters are used. Romaji character strings that can be converted are sequentially converted to Kana characters.

  On the other hand, in the case of instruction information input, the instruction content is checked by the determination processing unit 40. For example, in the case of a kana document conversion instruction, a kana document conversion command is output from the determination processing unit 40 to the conversion engine unit 70a, etc. A conversion target character string is extracted from the reading character string buffer 52, and a kana document conversion process such as kana-kanji conversion or kana romaji conversion is appropriately executed by the conversion engine unit 70a, and the conversion result is displayed in the display character string buffer in the storage unit 50. 54 and displayed on the display means 6 under the control of the display unit 60. The conversion engine unit 70a outputs the basic analysis unit 72 that estimates the segment break position by referring to the grammatical information 90 and the word information 92 stored in the dictionaries 14a to 14x, and the basic analysis unit 72, respectively. Grammar / word information is checked for phrase break candidates, a homophone selection process is performed with reference to the co-occurrence example information 94, and a phrase break processing unit 74 that further narrows down the phrase break candidates, and a phrase break process In the processing of the part 74, when the notation selection unit 80 that determines the notation for a phrase whose notation is not yet determined and the word determined by the notation selection unit 80 is a word that is not registered in the dictionary 14a or the like, An automatic dictionary registration unit 76 that automatically registers information such as readings, notations, parts of speech, etc. in the dictionary 14a, etc. Converts the-word portion of the clauses from kana characters into Roman characters characters, display character sizes alterable inverse romaji conversion portion 82 is further provided.

  The dictionaries 14a to 14x store grammatical information 90, word information 92, co-occurrence example information 94, learning information 96, and the like. The grammatical information 90 includes information on correctness of grammatical links between words, , Information on the strength of the connection. For example, information such as “noun (no particle) + suffix is strong, noun (no particle) + noun is strong” is stored.

  The word information 92 includes reading character strings, notation character strings, part-of-speech information, utilization information, and the like of each word.

The co-occurrence example information 94 is binary relation information between words having strong semantic connection. The co-occurrence example information 94 includes co-occurrence examples of attribute units such as “person” and “flower” and additional restriction information in addition to the two connections. Additional restriction information includes, for example, particle information such as “O” and “GA”, information on the direction in which it is established, and the like. Examples of co-occurrence examples are "hot-summer", "thick-book", "hot-hot water" ... (word connection)
"Meet people (he, girlfriend, teacher, lover, etc.)" ... (example of co-occurrence in attribute units)
"Flowers (tulips, chrysanthemums, etc.) bloom" ... (example of co-occurrence in attribute units)
"Speak-listen", "medicine-works", "promotion-works" ... (participant restriction information)
"Home-education", "Education-process" ... (direction restriction information)
And so on. The co-occurrence example information 94 as described above is semantic information, and the use of this information eliminates the ambiguity of homophones.

  For example, when an example of a homophone using the co-occurrence example information 94 is shown, when the conversion process is performed on the reading “hot / hon”, the “thick-book” information in the co-occurrence example information 94 indicates “ “Thick” is selected, and “hot, hot” or the like is not selected. Therefore, the conversion result of “thick / book” is obtained immediately. Thus, the conversion efficiency can be improved by using the co-occurrence example information 94.

  The learning information 96 is used when, for example, the most recently used notation is preferentially adopted.

  Further, the input / output control unit 30 is provided with an environment setting unit 62. When inputting data keys from the keyboard 4, an input mode setting function for switching between input as kana characters or input in Roman characters, Further, it is possible to appropriately select a romaji-kana conversion table data changing process, a conversion mode setting such as a continuous phrase / single phrase, and a code system such as JIS / shift JIS.

  In this configuration, the operation will be described. First, the operation principle of document processing will be briefly described with reference to FIG. 3. The document processing editing screen 100 displayed on the display means 6 displays various messages and states in addition to the text display area. Or an area 110 for displaying candidates for homonyms is provided at the bottom of the screen. The area 110 is shown in an enlarged manner on the right side of the figure, and the area 120 in the area 110 is a main area for displaying those word candidates when an instruction for displaying the next candidate group is given. Used for.

  Here, “insert” means that the character string input from the keyboard 4 is inserted immediately before the cursor 102, and “confirm” is selected by the user after performing kana-kanji conversion such as kana-kanji conversion. This means that you are in a mode where you do not want to read the word again later. “Kana-Kana” indicates that the Kana-Kanji conversion mode is continuous phrase and Kana input. The above-mentioned “Insert” and “Kana Han” can be appropriately changed between “Insert” and “Overwrite”, and “Kana Han” and “R Han” for Roman input by operating the predetermined control keys. It has become.

  Now, in the screen of FIG. 3, the user inputs a reading from the keyboard 4, but if necessary, the conversion key is pressed to execute a kana document conversion process for the reading input so far. As a result, a sentence (or phrase) consisting of a high-priority word converted by each reading is displayed in an undetermined state at the position of the cursor 102 on the screen. At this time, when the next candidate key is pressed, a candidate group of the first phrase among the displayed unconfirmed words is displayed in the area 120.

In this embodiment, the space key corresponds to the kana document conversion key and the next candidate key. That is, when the space key is pressed immediately after inputting a reading, it is determined as a kana document conversion key, and when the space key is subsequently input, it is processed as the next candidate key. Further, when a space key is simply input without inputting a reading, or when the control key, the shift key, and the space key are simultaneously pressed, the input is processed as an original blank character input. If the candidate is confirmed in the state (first candidate) when the conversion key is pressed, the return key is pressed at that time, or the reading key is subsequently pressed. When the candidate group is displayed in the area 120 by pressing the next candidate key, one of the candidates is selected (the candidate group is numbered and the number is input), and then the return key (confirmation key) is selected. ) To confirm.
[Description of Kana Document Conversion Processing in Kana Input Mode] The document processing operation of the present invention will be described in detail below with reference to the flowchart of FIG. 4 and the editing screen example of FIG. Prior to the description, both the kana document conversion process and the next candidate display process in this embodiment are executed by the space key. Whether or not the next candidate display process is performed may be determined by determining whether or not the immediately preceding character is in an unconfirmed state when the space key is pressed. Also, the unconfirmed candidate is confirmed when the confirm key (return key) is pressed in the unconfirmed state, or a new reading key (key for inputting the reading character) is input in the unconfirmed state. Is the time. Also, the return key entered when the reading is confirmed literally indicates a line feed key. Further, it is assumed that the environment setting unit 62 shown in FIG. 2 is activated, and the data key processing unit 42 is in the active state of the kana input processing unit 44 and the Roman character input processing unit 46 is in a paused state.

  When the keyboard 4 is input in the kana input mode and a character string as shown in FIG. 5B is input, it is determined whether or not each key is a character input (step S2 in FIG. 4). Therefore, these kana characters are sequentially stored in the read character string buffer 52 (step S4 in FIG. 4). In the example of FIG. 5B, a character string composed of all kana characters is shown as the kana character string. However, the kana character is expanded to include a kana character string mixed with English characters (for example, C O Mpa Q, In It will be apparent to those skilled in the art that the following processing can be applied to L, GM, Ge, BM, DoS, etc. Next, when the space key indicating the conversion instruction is pressed when all the character strings in FIG. 5B have been entered, the determination processing unit 4 interprets the space key as the conversion instruction (see FIG. 4). In step S6), a kana document conversion command is output to the conversion engine unit 70a.

  Thus, when the conversion engine unit 70a is activated, the reading character string to be converted shown in FIG. 5B is read from the reading character string buffer 52 into the conversion engine unit 70a, and the kana document conversion process is performed with reference to the dictionary 14a. Is executed (step S8 in FIG. 4). In this conversion processing, Japanese conversion processing with reference to the dictionary 14a based on the Kana-Kanji dictionary is first executed, and the phrase candidate of the read character string read by the basic analysis unit 72 is extracted, and the extracted phrase candidate is the phrase. The delimiter processing unit 74 checks grammatically and semantically to narrow down the phrase candidates, performs the phrase delimiter processing, and passes the kana-kanji converted document character string to the notation selection unit 80 in an indeterminate state, as well as the display character string It is also written in the buffer 54 and displayed on the display means 6 in a state as shown in FIG. 5C (step S10 in FIG. 4). However, in the dictionary 14a, the word “Intel L” is used for reading, the word “INTEL” is used for reading, the word “GE” is used for reading, and the word “DOS” is used for reading. Can be registered, and if these readings are registered in the dictionary 14a in advance, the registered word is processed preferentially and the phrase processing is performed.

  If this conversion result is correct, it is sufficient to continuously press the return key of the confirmation instruction. However, in the example of FIG. 5C, the desired result was not obtained, so when the space key is pressed as the next candidate key (FIG. 4, the reverse romaji conversion unit 82 provided in the notation selection unit 80 is activated, and in this example, “date” is converted into the roman character “DATE” using a conversion table as shown in FIG. The first candidate converted and expressed in full-width size, the second candidate converted to Roman “date” and expressed in half-width size, and the third to seventh candidates read out from the dictionary 14a are combined and combined as shown in FIG. ) Is presented in the candidate display area 120 in the format shown in FIG. That is, a candidate that is not registered in the dictionary 14a is displayed at the same time as a registered candidate and presented as a user selection target (step S10 in FIG. 4).

  Thus, when the number 1 key or the space key is further pressed to select “1.DATE” from among the next candidates presented in the area 120, the display of the area 120 changes as shown in FIG. Changes are made as shown in FIG. 5F (steps S8 and S10 in FIG. 4). Since a desired conversion result is obtained at this point, when the next kana character input key is pressed for a confirmation instruction or the return key is depressed, it is determined that the confirmation instruction is input by the determination processing unit 40 (FIG. 4). In step S12), the conversion result is transferred to the document processing program execution unit 23 (step S14 in FIG. 4), and at the same time, the conversion processing from the determination processing unit 40 to the notation selection unit 80 is performed, and words not registered in the dictionary 14a are converted. An inquiry command is output as to whether or not it has been selected, and since the word “DATE” that is not registered in the dictionary is adopted this time, when a message with an unregistered word is returned from the notation selection unit 80 to the determination processing unit 40 (FIG. 4, and the automatic dictionary registration command for the words converted into the reverse Roman alphabet is output from the determination processing unit 40 to the automatic dictionary registration unit 76 of the conversion engine unit 70 a. .

  Then, the automatic dictionary registration unit 76 receives the notation character string D100 and the reading character string D102 confirmed by reverse Romaji conversion from the notation selection unit 80, as shown in FIG. The unregistered word is additionally registered in the word information 92 of 14a, and the learning information 96 is updated (step S18 in FIG. 4). Thus, a new word could be automatically registered in the dictionary 14a without requiring any user dictionary registration operation. Therefore, for example, when the user next inputs “Kanato ni te ni te ni te ni ku” and presses the conversion key, for example, “DATE is entered for date confirmation”. ”And correct document conversion can be performed at once. In other words, even if you do not prepare a Japanese-English dictionary or English-Japanese dictionary, you can enter foreign words as they are and mix them in kana-kanji mixed text. There is no need for new registration.

In the above-described automatic dictionary registration operation for new words, the operation of automatically registering a dictionary has been described. However, since there are various types of part of speech settings, it is more convenient if there is a mode in which the user can confirm and select. In other words, the part-of-speech registration condition may be prepared, for example, by preparing three modes as shown in the following formula so that the environment setting unit 62 can select these modes as appropriate.
Part-of-speech registration condition mode 1: The part-of-speech is fixed and “general noun” is set.
Mode 2: Fixed part-of-speech that can be selected by the user [proprietary name, unique company name, noun change ...]
Mode 3: Simple interactive setting “Register. Are you sure? Y / n”
"Reading: c ompa q"
"Notation: COMPAQ"
“Part of speech: general noun, proper person name, proper company name, noun change,…”
In other words, all automatic registrations in mode 1 and mode 2 can be performed automatically. In mode 3, the part-of-speech candidates are presented from the automatic dictionary registration unit 76, and the user selects a desired candidate from these candidates, confirms Yes / No of registration, and registers the dictionary. . However, there is no need for user input for reading and writing of words.
[Description of Kana Document Conversion Processing in Roman Character Input Mode] Next, the document processing operation in the Roman character input mode of the present invention will be described in detail with reference to the flowchart of FIG. 4 and the editing screen of FIG. The operations of the return key, conversion key, next candidate key, etc. are the same as those in the kana input mode. Further, by operating the environment setting unit 62 shown in FIG. 2, it is assumed that the data key processing unit 42 is set to the kana input processing unit 44 in the paused state and the Roman character input processing unit 46 to the active state.

In such an initial state, when the romaji shown in FIG. 5A is key-inputted from the keyboard 4 in the romaji input mode, the romaji input processing unit 46 can convert these romaji characters according to the following rules. 48 is converted into kana and sequentially written into the read character string buffer 52. In the case of English letters, numbers, and symbol keys that cannot be converted, they are read and written to the character string buffer 52 as they are.
Romaji-kana conversion rule rule 1: If the Romaji-character string is a character string registered in the Romaji-kana conversion table provided in the Romaji-kana conversion unit 48, the corresponding Romaji-character string is preferentially converted to a Kana character. .
Rule 2: When English consonant characters are continuously input, the first English character is converted to “”, and then Rule 1 is repeated.
When the above-described Roman Kana conversion rule is applied to the character string shown in FIG. 5A, the character string is converted into a reading character string as shown in FIG. 5B and written into the reading character string buffer 52 (FIG. 4). Steps S2 and S4). Thereafter, when the space key is pressed to input a conversion instruction (step S6), the conversion candidate “DATE” is selected and confirmed, the unregistered word “DATE” is automatically registered in the dictionary 14a in the above-described kana input mode. This is exactly the same as the operation and operation description.

  Then, when the romaji input as shown in FIG. 8A is performed next, these roman characters are converted into kana and read into the character string buffer 52 as a kana character string mixed with English sound as shown in FIG. 8B. It is stored and displayed on the display means 6 (steps S2 and S4 in FIG. 4). At this point, when the space key is pressed for a conversion instruction (step S6 in FIG. 4), a kana document conversion command is output from the determination processing unit 40 to the conversion engine unit 70a, and the basic analysis unit 72 refers to the dictionary 14a. Phrase candidates are extracted, and the extracted phrase candidates are grammatically and semantically checked and narrowed down by the phrase delimiter processing unit 74, and converted into a notation character string as shown in FIG. 8C as the most probable Japanese sentence. And passed to the notation selection unit 80 (steps S8 and S10 in FIG. 4). That is, when a word registered in the dictionary 14a is detected, these word processes are preferentially performed. When the word is not registered in the dictionary 14a, a conversion candidate is first provided in the notation selection unit 80. The reverse roman character conversion unit 82 converts these kana character strings back to romaji character strings at the time of key input and converts them to upper case full-width, lower case half-width, upper case half-width, lower case full-width, etc. It is presented as one of Furthermore, when a character string displayed as the original kana character string or a character string obtained by converting hiragana into katakana is presented as one of the next candidates, the user's selection range can be expanded. In addition, if the next candidate is presented with priority given to a character string that has been subjected to reverse Roman alphabet conversion, the user can handle Japanese and foreign languages without further distinction. Furthermore, the user can select whether reverse Roman alphabet conversion is first or lower case, full-width notation first, half-width notation character string is displayed as one of the next candidates, etc. By making it possible to customize it, it becomes easier for the user to use reverse romaji conversion.

  In the example of FIG. 8C, a notation in English capital full-width size is displayed as the first next candidate. In this example, since this notation conversion result is the desired conversion result, the return key is pressed next. When another Romaji key is input, a confirmation instruction is input (step S12 in FIG. 4), and the conversion result is output to the document processing program execution unit 23 (step s14 in FIG. 4). Thereafter, an inquiry signal is output from the determination processing unit 40 to the notation selection unit 80 as to whether or not the next candidate character string converted by the reverse Romaji conversion unit 82 has been adopted as a confirmed word, and this time “COMPAQ” is stored in the dictionary 14a. If there is a response indicating that it has not been registered but has been adopted as a new word (step S16 in FIG. 4), the determination processing unit 40 further reads the word “COMPAQ” to the automatic dictionary registration unit 76 and reads “COM”. An automatic registration command is output so as to register with “PQ” part-of-speech “general noun”, and the word “COMPAQ” is automatically registered in the word information 92 and the like of the dictionary 14a (step S18 in FIG. 4). Thus, if only candidate character strings that have been converted to reverse Roman characters are adopted, it is possible to automatically register them sequentially in the dictionary 14a, and this function is a Japanese sentence that is a mixture of Japanese and foreign languages. This is very convenient because a new foreign language can be registered in the dictionary without requiring the user to perform any mode conversion key or dictionary registration operation.

  The document processing method described in this embodiment can be realized by executing a program prepared in advance on a computer such as a personal computer or a workstation. This program is recorded on a computer-readable recording medium such as a hard disk, a flexible disk, a CD-ROM, an MO, and a DVD, and is executed by being read from the recording medium by the computer. Further, this program may be a transmission medium that can be distributed via a network such as the Internet.

It is a block diagram which shows one Example of the hardware constitutions of this invention. It is a figure which shows one Example of the function structure of the software of this invention. It is a figure which shows an example of a display of the document edit screen used by this invention. It is a flowchart for demonstrating operation | movement of this invention. It is a figure which shows an example of the kana document conversion process of this invention. It is a figure which shows an example of the parameter structure of the word registered into an automatic dictionary. It is an example of a Kana romaji conversion table. It is a figure which shows an example of the kana document conversion process of the reading character string input into the Roman character.

Explanation of symbols

2 MPU
4 Keyboard 5 Mouse 6 Display means 10 ROM
12 storage means 14a, ..., 14x dictionary 20 RAM
22 Kana document conversion unit 30 Input / output control unit 40 Determination processing unit 44 Kana input processing unit 46 Roman character input processing unit 52 Reading character string buffer 54 Displayed character string buffer 62 Environment setting unit 70a, ..., 70x Conversion engine unit 76 Automatic dictionary registration Part 80 Notation selection part 82 Reverse Roman character conversion part

Claims (24)

  In a kana input type document processing apparatus comprising at least an input means capable of inputting kana characters and a kana document conversion means for converting a kana character string input from the input means into a document character string via a kana document conversion dictionary The Kana character string conversion means for converting the Kana character string into an English character string according to the reverse Roman character rule is provided, and the English character string generated according to the reverse Roman character rule is added to the word conversion candidate of the Kana document conversion dictionary. Kana input type document processing device that can be selected.   The kana input type document processing apparatus according to claim 1, wherein the kana character string includes English characters or English symbols. The kana according to claim 1 or 2, wherein when an English character string generated by the reverse Roman character rule is selected and confirmed as a conversion word, the new word is automatically registered in the kana document conversion dictionary under the following conditions. Input-type document processing device.
Registration conditions Reading of the word: Kana character string Notation of the word: English character string converted from the Kana character string using the reverse Roman alphabet rule   The kana input according to any one of claims 1 to 3, wherein when the English character string is presented to a user as a word candidate, an English character string of a plurality of sizes having different sizes can be presented to the user by switching a display character size. Formula document processing device.   5. The kana input-type document processing apparatus according to claim 1, wherein when the English character string is presented to a user as a word candidate, it can be presented to the user in preference to other kana document conversion candidates.   A kana character string input step for inputting a kana character string via an input means capable of inputting at least kana characters, and a kana document conversion step for converting the kana character string into a document character string via a kana document conversion dictionary. Furthermore, in this Kana document conversion process, the Kana character string to be converted is converted into an English character string by applying the reverse Roman alphabet rule as a word candidate for Kana document conversion, and the generated English character string is presented to the user. A kana input-type document processing method characterized by including a reverse romaji conversion step.   The kana input-type document processing method according to claim 6, wherein the kana character string includes English characters or English symbols. 8. The kana according to claim 6, wherein when the English character string generated in the reverse Roman alphabet conversion step is adopted and confirmed, the new word is automatically registered in the Kana document conversion dictionary under the following conditions. Input type document processing method.
Registration conditions Reading of the word: Kana character string Notation of the word: English character string converted from the Kana character string using the reverse Roman alphabet rule   The kana input according to any one of claims 6 to 8, wherein when the English character string is presented to a user as a word candidate, an English character string having a plurality of different sizes can be presented to the user by switching a display character size. Formula document processing method.   10. The kana input-type document processing method according to claim 6, wherein when the English character string is presented to the user as a word candidate, the English character string can be presented to the user with priority over other kana document conversion candidates.   At least an input means that can input English characters, an English character kana conversion means that converts an English character string input from this input means into a character string according to the Roman alphabet rules, and a kana mixed character converted by this English character kana conversion means In a Roman character input type document processing device comprising kana document conversion means for converting a string into a document character string via a kana document conversion dictionary, when the kana mixed character string is converted into a document character string, a kana document that has been temporarily determined A reverse Roman alphabet conversion unit capable of adding and presenting an unconverted English character string in which English character strings input from the input means are reversely converted and arranged without conversion to candidates for conversion. A Roman character input type document processing apparatus characterized by being provided.   When converting the kana-mixed character string into a document character string, the romaji rule is inversely converted to the kana document conversion word candidate for an unconfirmed kana character string that is not registered in the kana document conversion dictionary. 12. The Roman character input expression according to claim 11, further comprising a reverse Roman character conversion unit capable of presenting a non-converted English character string in which English character strings input from the input means are arranged without conversion. Document processing device.   If the English character string at the end of the unconverted English character string is kana-convertible and does not conflict with other Japanese document character strings that have been provisionally confirmed even if converted to Japanese particles, conjunctions, etc., The Roman character input type document processing apparatus according to claim 12, wherein only the English character string can be converted again and presented to the user. The Kana document conversion word candidate presents a non-converted English character string obtained by reverse-converting the Roman rule and arranging the English character strings input from the input means without conversion, and this non-converted English character string is adopted. The Roman character input type document processing according to any one of claims 11 to 13, wherein, when confirmed, the non-converted English character string is automatically registered as a new word in the kana document conversion dictionary under the following conditions. apparatus.
Registration condition Reading of the unconverted English character string: Kana mixed reading character string applying the above-mentioned Roman alphabet rules Output format of the unconverted English character string: Unconverted English character string of the selected display size   15. The Roman character input type document processing apparatus according to claim 11, wherein when the non-converted English character string is presented to the user as a word candidate, it can be presented to the user with priority over other kana document conversion candidates.   The Roman character input according to any one of claims 11 to 15, wherein when the non-converted English character string is presented to a user as a word candidate, a plurality of English character strings having different sizes can be presented to the user by switching a display character size. Formula document processing device.   The Roman character input type document processing device according to claim 11 or 16, wherein the kana document conversion dictionary includes a kana-English character conversion dictionary and / or a kana-kanji conversion dictionary.   An English character string input step of inputting an English character string through an input means capable of inputting at least English characters, and an English character Kana conversion step of converting the displayed English character string into a character string mixed according to Roman alphabet rules and displaying it A kana document conversion step of converting the kana mixed character string generated in the kana conversion step into a document character string via the kana document conversion dictionary, and the kana document conversion step A reverse romaji conversion step of adding a non-converted English character string obtained by reverse-converting the Roman rule to a word candidate and arranging the input English character strings of the word without conversion. Characteristic Roman character input type document processing method.   In addition to the kana document conversion step, for an unconfirmed kana character string that is not registered in the kana document conversion dictionary, the Roman alphabet rule is reverse-converted into a word candidate for the kana document conversion and the input English character string The Roman character input type document processing method according to claim 18, further comprising a reverse Roman character conversion step capable of presenting an unconverted English character string arranged in a non-converted manner.   When the English character string at the end of the non-converted English character string can be converted to Kana by the Romaji rules, and even if converted into Japanese particles, conjunctions, etc., it does not conflict with other Japanese document character strings that have been provisionally confirmed 20. The Roman character input type document processing method according to claim 19, wherein only the English character string at the end of the word can be kana converted again and presented to the user. In the kana document conversion step, a kana document conversion word candidate is presented as a non-converted English character string in which input English character strings are arranged without conversion, and when this non-converted English character string is adopted and confirmed, 21. The Roman character input type document processing method according to claim 18, wherein the non-converted English character string is automatically registered as a new word in the Kana document conversion dictionary under the following conditions.
Registration condition Reading of the unconverted English character string: Kana mixed reading character string applying the above-mentioned Roman alphabet rules Output format of the unconverted English character string: Unconverted English character string of the selected display size   The Roman character input according to any one of claims 18 to 21, wherein when the non-converted English character string is presented to the user as a word candidate, a plurality of English character strings having different sizes can be presented to the user by switching a display character size. Formula document processing method.   23. The Roman character input type document processing method according to claim 18, wherein when the non-converted English character string is presented to the user as a word candidate, it can be presented to the user with priority over other kana document conversion candidates. The Roman character input type document processing method according to any one of claims 18 to 23, wherein the kana document conversion dictionary includes a kana-English character conversion dictionary or a kana-kanji conversion dictionary.

Images