Inductive inference of monotonic formal systems from positive data
New Generation Computing - Selected papers from the international workshop on algorithmic learning theory,1990
Learning elementary formal systems
Theoretical Computer Science
Short note: procedural semantics and negative information of elementary formal system
Journal of Logic Programming
Rich classes inferable from positive data
Information and Computation
Journal of the ACM (JACM)
Inference of Reversible Languages
Journal of the ACM (JACM)
A syntax directed compiler for ALGOL 60
Communications of the ACM
A Class of Prolog Programs Inferable from Positive Data
ALT '96 Proceedings of the 7th International Workshop on Algorithmic Learning Theory
Constructive Learning of Translations Based on Dictionaries
ALT '96 Proceedings of the 7th International Workshop on Algorithmic Learning Theory
Syntax directed translations and the pushdown assembler
Journal of Computer and System Sciences
Properties of syntax directed translations
Journal of Computer and System Sciences
An Efficient Derivation for Elementary Formal Systems Based on Partial Unification
DS '01 Proceedings of the 4th International Conference on Discovery Science
| Hi-index | 0.00 |
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.