In this thesis, Grammar Writing Language GWL is designed and implemented for the efficient development of MATE-EK(MAchine Tranlsation Environment-English to Korean) in transfer approach. GWL-III is modeled after process of machine translation in transfer approach.
The grammar writing system defines seven tree representation operators for expansion of describable scope of tree, so it is possible to have variable root node, describe negative condition, select one node from possible nodes, and to specify any number of the repetitive node.
The information of tree structure and its feature values is needed for the selection of translation equivalents, and tree-to-tree transformations may occurr when transfer dictionary is refered to. By the way, the process of checking for the information and transforming trees can be described in the structure of rewriting rule RR. So, in this proposed system, the process of accessing transfer dictionary is written in RR.
In this thesis, a method using dummy nodes for structure and operation sharing is introduced for ambiguity resolution, so localize ambiguity, that is, the ambiguity of forest level is reduced to that of tree level. Grammar writer can only see logical tree structure.
