Learnability of Translations from Positive Examples

  • Noriko Sugimoto
Conference paper

DOI: 10.1007/3-540-49730-7_13

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1501)
Cite this paper as:
Sugimoto N. (1998) Learnability of Translations from Positive Examples. In: Richter M.M., Smith C.H., Wiehagen R., Zeugmann T. (eds) Algorithmic Learning Theory. ALT 1998. Lecture Notes in Computer Science, vol 1501. Springer, Berlin, Heidelberg

Abstract

One of the most important issues in machine translations is deducing unknown rules from pairs of input-output sentences. Since the translations are expressed by elementary formal systems (EFS’s, for short), we formalize learning translations as the process of guessing an unknown EFS from pairs of input-output sentences. In this paper, we propose a class of EFS’s called linearly-moded EFS’s by introducing local variables and linear predicate inequalities based on mode information, which can express translations of context-sensitive languages. We show that, for a given input sentence, the set of all output sentences is finite and computable in a translation defined by a linearly-moded EFS. Finally, we show that the class of translations defined by linearly-moded EFS’s is learnable under the condition that the number of clauses in an EFS and the length of the clause are bounded by some constant.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Noriko Sugimoto
    • 1
  1. 1.Department of Artificial IntelligenceKyushu Institute of TechnologyIizukaJAPAN

Personalised recommendations