A framework of a mechanical translation between Japanese and English by analogy principle
Proc. of the international NATO symposium on Artificial and human intelligence
The String-to-String Correction Problem
Journal of the ACM (JACM)
Pilot implementation of a Bilingual Knowledge Bank
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Representation trees and string-tree correspondences
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
Saussurian analogy: a theoretical account and its application
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2
Review Article: Example-based Machine Translation
Machine Translation
| Hi-index | 0.00 |
In this paper we sketch an approach for Natural Language parsing. Our approach is an example-based approach, which relies mainly on examples that already parsed to their representation structure, and on the knowledge that we can get from these examples the required information to parse a new input sentence. In our approach, examples are annotated with the Structured String Tree Correspondence (SSTC) annotation schema where each SSTC describes a sentence, a representation tree as well as the correspondence between substrings in the sentence and subtrees in the representation tree. In the process of parsing, we first try to build subtrees for phrases in the input sentence which have been successfully found in the example-base - a bottom up approach. These subtrees will then be combined together to form a single rooted representation tree based on an example with similar representation structure - a top down approach.