Fast learning from strings of 2-letter rigid grammars

DOI10.1007/3-540-45790-9_17MaRDI QIDQ4440400zbMATH OpenFDO

Authors Yoav Seginer

Publication date 17 December 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2484/24840213.htm

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Learning and adaptive systems in artificial intelligence (68T05) Natural language processing (68T50)

Recommendations

• Learning context-free grammars from structural data in polynomial time
• Learning trees from strings: a strong learning algorithm for some context-free grammars
• Learning deterministic regular grammars from stochastic samples in polynomial time
• Approximative learning of regular languages
• Learning deterministic finite automata from interleaved strings
• Learning regular languages using RFSA
• Learning Efficiency of Very Simple Grammars from Positive Data
• Learning efficiency of very simple grammars from positive data
• Canonical context-free grammars and strong learning: two approaches
• On the complexity of learning strings and sequences

Cited in

(1)

• Learning Deterministic DEC Grammars Is Learning Rational Numbers

This page was built for publication: Fast learning from strings of 2-letter rigid grammars

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4440400)