A Kana-Kanji translation system for non-segmented input sentences based on syntactic and semantic analysis

Authors:
Masahiro Abe;Yoshimitsu Ooshima;Katsuhiko Yuura;Nobuyuki Takeichi
Affiliations:
Central Research Laboratory Hitachi Ltd., Tokyo, Japan;Central Research Laboratory Hitachi Ltd., Tokyo, Japan;Central Research Laboratory Hitachi Ltd., Tokyo, Japan;Central Research Laboratory Hitachi Ltd., Tokyo, Japan
Venue:
COLING '86 Proceedings of the 11th coference on Computational linguistics
Year:
1986

Citing 1
Cited 5

An automatic translation system of non-segmented Kana sentences into Kanji-Kana sentences

COLING '80 Proceedings of the 8th conference on Computational linguistics

A Method of Pre-computing Connectivity Relations for Japanese/Korean POS Tagging

CICLing '01 Proceedings of the Second International Conference on Computational Linguistics and Intelligent Text Processing
A hardware algorithm for high speed morpheme extraction and its implementation

ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
Lattice-based word identification in CLARE

ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics
Collocational analysis in Japanese text input

COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
Syllable-based model for the Korean morphology

COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a disambiguation approach for translating non-segmented-Kana into Kanji. The method consists of two steps. In the first step, an input sentence is analyzed morphologically and ambiguous morphemes are stored in a network form. In the second step, the best path, which is a string of morphemes, is selected by syntactic and semantic analysis based on case grammar. In order to avoid the combinatorial explosion of possible paths, the following heuristic search method is adopted. First, a path that contains the smallest number of weighted-morphemes is chosen as the quasi-best path by a best-first-search technique. Next, the restricted range of morphemes near the quasi-best path is extracted from the morpheme network to construct preferential paths.An experimental system incorporating large dictionaries has been developed and evaluated. A translation accracy of 90.5% was obtained. This can be improved to about 95% by optimizing the dictionaries.