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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
A. V. Aho and J. D. Ullman. Properties of syntax directed translations. Journal of Computer and System Sciences 3:319–334, 1969.
A. V. Aho and J. D. Ullman. Syntax directed translation and the pushdown assembler. Journal of Computer and System Sciences 3:37–56, 1969.
D. Angluin. Inductive inference of formal languages from positive data. Information and Control 45:117–135, 1980.
D. Angluin. Inference of reversible languages. Journal of the ACM 29:741–765, July 1982.
S. Arikawa, T. Shinohara, and A. Yamamoto. Learning elementary formal systems. Theoretical Computer Science 95:97–113, 1992.
H. Arimura and T. Shinohara. Inductive inference of prolog programs with linear data dependency from positive data. Proc. Information Modelling and Knowledge Bases V, 1994.
E. Gold. Language identification in the limit. Information and Control 10:447–474, 1967.
E. Irons. A syntax directed compiler for ALGOL-60. Communications of the ACM 4:51–55, 1961.
P. M. Lewis and R. E. Stearns. Syntax-directed transduction. Journal of the ACM 15:465–488, 1968.
M. K. Rao. A class of prolog programs inferable from positive data. Lecture Notes in Artificial Intelligence 1160, 272–284, 1996.
T. Shinohara. Inductive inference of monotonic formal systems from positive data. New Generation Computing, 8:371–384, 1991.
T. Shinohara. Rich classes inferable from positive data: length-bounded elementary formal system. Information and Computation 108:175–186, 1994.
R. Smullyan. Theory of formal systems. Princeton Univ. Press, 1961.
N. Sugimoto, K. Hirata and H. Ishizaka. Constructive learning of translations based on dictionaries. Lecture Notes in Artificial Intelligence 1160, 177–184, 1996.
A. Yamamoto. Procedural semantics and negative information of elementary formal system. Journal of Logic Programming 13:89–97, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
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. https://doi.org/10.1007/3-540-49730-7_13
Download citation
DOI: https://doi.org/10.1007/3-540-49730-7_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65013-3
Online ISBN: 978-3-540-49730-1
eBook Packages: Springer Book Archive