|Vol. 16 No. l
|Vol. 16 No. 2
|Vol. 16 No. 3
|Vol. 16 No. 4
|Vol. 16 No. 5
|Vol. 16 No. 6
|Vol. 16 No. 7
|Vol. 16 No. 8
In order to solve the first problem, a don't care symbol is allowed to specify an entry name. It enables us to access an entry in lexicographically reverse order. Furthermore, as an entry name entered is matched, to a dictionary entry using the longest match strategy, the nearest entry, which has similar name entered, will be displayed even though an exact match will fail. Secondly, since a dictionary entry is displayed with indentations that are automatically generated, it is very easy to read.
The automatic conversion system has two problems. One is about the
subject of conversion, and the other is about the styIe of sentences in
aim. There are two move targets for the former problem besides the
conversion of the end of sentences, which is reported in this paper.
These two are as follows:
(1) The conversion of predicates with limitation.
(2) The conversion of words to unify the word level used in a sentence.
As for the latter problem, it is necessary to consider the conversion of varied sentences to unified sentences, especially to Dearu-style.