Learning Cover Context-Free Grammars from Structural Data
We consider the problem of learning an unknown context-free gram- mar from its structural descriptions with depth at most ℓ. The structural descriptions of the context-free grammar are its unlabelled derivation trees. The goal is to learn a cover context-free grammar (CCFG) with respect to ℓ, that i...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Alexandru Ioan Cuza University of Iasi
2014-12-01
|
| Series: | Scientific Annals of Computer Science |
| Online Access: | http://www.info.uaic.ro/bin/download/Annals/XXIV2/XXIV2_3.pdf |