Browse

Bi-directional Grammars for Machine Translation

Cited 0 time in Web of Science Cited 0 time in Scopus
Authors
Koichi, Takeda
Issue Date
1991
Publisher
서울대학교 언어교육원
Citation
어학연구, Vol.27 No.2, pp. 287-301
Abstract
In this paper we consider bi-directional grammars for natural languages. That is, a special class of grammars which can be used for both parsing and generation of sentences. We define the notion of "bi-directionality" and a class of general unification grammar and show that any instance of the grammar is bi-directional. We also discuss a subset of the grammar where more desirable property holds. We also consider an operational counterpart of the unification grammar, called pseudo-unification grammar, and show that similar results hold.
ISSN
0254-4474
Language
English
URI
https://hdl.handle.net/10371/85921
Files in This Item:
Appears in Collections:
Language Education Institute (언어교육원)Language Research (어학연구)Language Research (어학연구) Volume 27 Number 1/4 (1991)
  • mendeley

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

Browse