JPH06149790A - Document processor - Google Patents

Abstract

PURPOSE:To retrieve all other expressions only by specifying one word as a retrieval index word even if there are plural expressions of synonyms by providing a means which decides contracted sounds and long sounds and an expression candidate table for the cases, and constituting a character string only in KANA (Japanese syllabary) at the time of the execution of a retrieving means. CONSTITUTION:For example, when 'fuzzy' has three expressions in KANA, this contracted sound is a certainly present word since the intersection of a character 'a' which can be contracted with the character 'fu' right before the contracted sound candidate in the expression candidate table (1) is marked with a circle at the time of the specification of 'fuzzy' as a retrieval index word. For the purpose, there is 'a' present as a character which can substitute for 'a' in a table (2), so 'fuzzy' is also an object of retrieval. Further, there is 'i' present as a character which can substitute for '-', so 'fuzzy' is also an object of retrieval. Then there are three kinds of word as objects of retrieval regardless of which of two expressions is specified as a retrieval index word.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a sentence creating device such as a Japanese word processor or a computer.

[0002]

2. Description of the Related Art FIG. 4 is a block diagram of a conventional device. In this figure, reference numeral 41 denotes a control unit which includes a microprocessor, a program, a table, an external storage device and the like other than those specified below.

Reference numeral 42 is a display section composed of a CRT or LCD, and 43 is an input section composed of a keyboard or a tablet.

Reference numeral 44 is a dictionary unit such as an independent word / proper noun / affix / phonetic dictionary / user dictionary including a meaning code, 45
Is a co-occurrence relation dictionary with co-occurrence relations between clauses.

A buffer memory 46 includes a character buffer 46a, a learning buffer 46b, and a homophone word buffer 46.
c, the text buffer 46d.

The character buffer 46a is a buffer for storing the characters input from the input unit 43.

The learning buffer 46b is a buffer for performing a word learning process.

The homophone word buffer 46c is a buffer for storing homophone words at the time of kana-kanji conversion.

The text buffer 46d is a buffer for storing definite text data.

The kana string input from the input unit 43 is first stored in the character buffer 46a.

Next, when the user designates the conversion or when the conversion timing comes, the control unit 41 causes the dictionary unit 4 to operate.
4 and the co-occurrence relation dictionary 45, kana-kanji conversion processing is performed, and the conversion result is stored in the homophone word buffer 46c.

The first conversion candidate is displayed on the display section 42.

Candidates other than the first candidate are homophone words buffer 46.
It is stored in c and can be displayed on the display unit 42 and selected by operating the input unit 43.

When a homophone is selected by operating the input unit 43, the result is stored in the learning buffer 46b. The confirmed sentence is copied to the sentence buffer 46d. When creating characters on such devices, they are not always the same string. Actually, for example, in a character string of only katakana, the word "fuzzy" is used as one word such as "fuzzy" or "fuzzy", and various notations are used.

Therefore, when searching for those words, if the search headword is "fuzzy", then only "fuzzy", and if the search headword is "fuzzy", then only "fuzzy",
Furthermore, if the search term is "Fuzzy", only "Fuzzy" will be searched. Therefore, if multiple notations are mixed in the range to be searched, the number of mixed notations will be searched respectively. Substitute as and search.

[0016]

As described above, in the case of performing a search action in the conventional sentence creating device, the search headword and the searched word are composed of the same characters one by one. I couldn't find it.

Therefore, in the case of a phrase composed of a character string of only kana and having a plurality of notations in one word (for example, "fuzzy", "fuzzy", "fuzzy"), each of the plurality of notations is used. It was necessary to search by specifying it as a search headword. For this reason, it takes a lot of time to search, and sometimes the search is omitted.

[0018]

SUMMARY OF THE INVENTION The present invention has been made for the purpose of solving the above-mentioned problems, and in a sentence creating apparatus having a searching means for searching the same word in sentence data, it is possible to judge a long sound and a long sound. In the case of searching for a word composed only of kana, having a judgment means and a notation candidate table relating to the sound, and having an extraction means for extracting a plurality of notation candidates for one word composed only of kana A sentence creation device characterized in that search words and the same words having different notations are also targeted for search.

[0019]

With the above-described structure, when the sentence creating device of the present invention is used to search for a word that is composed of a character string of only kana and has a plurality of notations in one word when the search means is executed, All of the remaining notations can be searched by simply substituting one word in the plurality of notations as the search headword.

[0020]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT FIG. 1 shows a block diagram of the device of the present invention. In this figure, reference numeral 1 denotes a control unit which includes a microprocessor, a program, a table, an external storage device and the like other than those specified below.

Reference numeral 2 is a display unit composed of a CRT or LCD.

Reference numeral 3 is an input unit composed of a keyboard or a tablet.

Reference numeral 4 is a dictionary section including a self-supporting word, proper noun, affix, phonological dictionary, user dictionary, etc., including a meaning code.

Reference numeral 5 is a co-occurrence relation dictionary having a co-occurrence relation between clauses.

A buffer memory 6 includes a character buffer 6a, a learning buffer 6b, a homophone word buffer 6c, and a sentence buffer 6d.

A table 7 (FIGS. 2 (1) and 2 (2)) used for ambiguous retrieval is stored.

The kana string input from the input unit 3 is first stored in the character buffer 6a.

Next, when the user designates the conversion or when the conversion timing comes, the control unit 1 refers to the dictionary unit 4, the co-occurrence relation dictionary 5, the other table 7, etc. to convert the Kana to Kanji. The processed result is stored in the homophone word buffer 6c. Further, the first conversion candidate is displayed on the display unit 2.

Candidates other than the first candidate are homophone words buffer 6c.
Can be displayed on the display unit 2 and selected by operating the input unit 3.

When a homophone is selected by operating the input unit 3, the result is stored in the learning buffer 6b.
The confirmed sentence is copied to the sentence buffer 6d. FIG. 2 is an explanatory diagram of the embodiment of the present invention, which is a table for fuzzy search. In FIG. 2 (1), all the Japanese syllables are presented by forming the characters immediately before the syllable candidate and the syllable characters in a matrix.

In FIG. 2 (2), the replaceable characters are presented in a matrix by forming the replaceable characters in a matrix.

FIG. 3 is a flow chart showing the operation of the present invention. The processing procedure of this fuzzy search will be described on the premise of the block configuration as shown in FIG.

At 201, the cursor is moved to the position where the fuzzy search is to be started.

At 202, the search function is entered.

Enter the search character at 203 and press the replace key at 204.

At 205, a replacement character is entered.

By pressing the function, "search direction", "search mode", and "fuzzy search" can be changed / designated.

By pressing the execute key at 206, the process of replacing the search character is started.

When the ambiguous search is designated at 205 in 207, candidate word character strings for ambiguous words are extracted from FIGS. 2 (1) and 2 (2).

At 208, it is confirmed whether the candidate word extracted at 207 exists in the dictionary portion, and if not, it is excluded from the candidates.

When the batch replacement is designated at 205 in 209, the cursor moves to the end of the sentence (beginning of the sentence) while replacing all the search characters with the replacement characters.

When the sequential replacement is designated at 205 in 210, the cursor moves to the search character.

At step 211, the execution key is replaced and the search is restarted.

At step 212, the skip character is not replaced, and the process proceeds to the next search character.

To supplement with a concrete example, in a sentence in which the above-mentioned three expressions of "fuzzy", "fuzzy" and "fuzzy" are mixed, "fuzzy" is used as the search headword.
If you specify, first, in Fig. 2 (1), the point that intersects with the character "F" immediately before the candidate for the Japanese sound candidate in the table of the soundable Japanese character "A" is marked with a circle, so this "fuzzy" certainly exists. Is a word. Therefore, as shown in Fig. 2 (2), "a" exists as a replaceable character of "a".
Will also be searched.

Further, as a replaceable character of "-", "i"
Is present, "fuzzy" is also a search target.

It goes without saying that the words to be searched are, of course, the three types described above, even if "Fuzzy" or "Fuzzy" is specified as the search term.

Although the embodiment is presented in katakana, it is of course possible to use hiragana.

In this way, even in a sentence in which a plurality of synonyms of synonyms are mixed, it is possible to retrieve all the rest of the synonyms by designating one word as a search headword. .

Others The present invention is not limited to the embodiments described above and shown in the drawings, and it is needless to say that the present invention can be appropriately modified and implemented without departing from the scope of the invention.

[0051]

According to the text creating apparatus of the present invention, when the searching means is executed, the text string is composed of only the kana characters.
When searching for a word having a plurality of notations in one word, all the remaining notations can be searched by simply designating one word in the plurality of notations as a search headword. Therefore, the labor of the user can be greatly saved. In addition, it is possible to prevent omission of retrieval of the same content word due to the difference in notation.

[Brief description of drawings]

FIG. 1 is a block diagram of an apparatus of the present invention.

FIG. 2 is an explanatory diagram of an example of the present invention.

FIG. 3 is a flowchart showing the operation of the present invention.

FIG. 4 is a configuration diagram of a conventional device.

[Explanation of symbols]

 1 control unit 2 display unit 3 input unit 4 dictionary unit 5 co-occurrence relation dictionary 6 buffer 6a character buffer 6b learning buffer 6c homophone word buffer 6d sentence buffer 7 table

Claims (1)

[Claims] 1. A sentence creating apparatus having a searching means for searching the same word in sentence data, comprising a judging means for judging a long sound and a long sound, a notation candidate table for the sound, and comprising only a kana. When searching for a word that is composed of only kana and has a means for extracting multiple notation candidates for a single word, the search term and the same word with different notations must also be included in the search target. A writing device characterized by.