Some structural aspects of hypergraph languages generated by hyperedge replacement
4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
The complexity of graph languages generated by hyperedge replacement
Acta Informatica
Automated extraction of Tree-Adjoining Grammars from treebanks
Natural Language Engineering
Learning tree languages from positive examples and membership queries
Theoretical Computer Science
Polynomial Identification in the Limit of Substitutable Context-free Languages
The Journal of Machine Learning Research
On the Generative Power of Multiple Context-Free Grammars and Macro Grammars
IEICE - Transactions on Information and Systems
Learning a regular tree language from a teacher
DLT'03 Proceedings of the 7th international conference on Developments in language theory
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Efficient, correct, unsupervised learning of context-sensitive languages
CoNLL '10 Proceedings of the Fourteenth Conference on Computational Natural Language Learning
Distributional learning of some context-free languages with a minimally adequate teacher
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
Learning context free grammars with the syntactic concept lattice
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
Towards general algorithms for grammatical inference
ALT'10 Proceedings of the 21st international conference on Algorithmic learning theory
Using Contextual Representations to Efficiently Learn Context-Free Languages
The Journal of Machine Learning Research
Theoretical Computer Science
Distributional learning of abstract categorial grammars
LACL'11 Proceedings of the 6th international conference on Logical aspects of computational linguistics
Towards dual approaches for learning context-free grammars based on syntactic concept lattices
DLT'11 Proceedings of the 15th international conference on Developments in language theory
The copying power of well-nested multiple context-free grammars
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Inference of reversible tree languages
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Integration of the dual approaches in the distributional learning of context-free grammars
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Four one-shot learners for regular tree languages and their polynomial characterizability
Theoretical Computer Science
| Hi-index | 0.00 |
This paper demonstrates how existing distributional learning techniques for context-free grammars can be adapted to simple context-free tree grammars in a straightforward manner once the necessary notions and properties for string languages have been redefined for trees. Distributional learning is based on the decomposition of an object into a substructure and the remaining structure, and on their interrelations. A corresponding learning algorithm can emulate those relations in order to determine a correct grammar for the target language.