Sciweavers

66
Voted
ALT
2010
Springer

Towards General Algorithms for Grammatical Inference

14 years 10 months ago
Towards General Algorithms for Grammatical Inference
Many algorithms for grammatical inference can be viewed as instances of a more general algorithm which maintains a set of primitive elements, which distributionally define sets of strings, and a set of features or tests that constrain various inference rules. Using this general framework, which we cast as a process of logical inference, we re-analyse Angluin's famous lstar algorithm and several recent algorithms for the inference of context-free grammars and multiple context-free grammars. Finally, to illustrate the advantages of this approach, we extend it to the inference of functional transductions from positive data only, and we present a new algorithm for the inference of finite state transducers.
Alexander Clark
Added 26 Oct 2010
Updated 26 Oct 2010
Type Conference
Year 2010
Where ALT
Authors Alexander Clark
Comments (0)