Titlebook: ;

NEG

https://doi.org/10.1057/9781137331809that some of the classes based on these procedures are learnable. The complexity of learning them was still left open..In this paper it is shown that learning some of these classes is NP-hard under certain restrictions.

要控制

耐寒

確認

Inference of Finite-State Transducers by Using Regular Grammars and Morphisms,rs and regular grammars. The technique consists of: 1) building a corpus of training strings from the corpus of training pairs; 2) inferring a regular grammar and 3) transforming the grammar into a finite-state transducer..The proposed method was assessed through a series of experiments within the framework of the EUTRANS project.