𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Learning deterministic context free grammars: The Omphalos competition

✍ Scribed by Alexander Clark

Publisher
Springer
Year
2006
Tongue
English
Weight
458 KB
Volume
66
Category
Article
ISSN
0885-6125

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Learning context-free grammars using tab
Learning context-free grammars using tabular representations
✍ Yasubumi Sakakibara πŸ“‚ Article πŸ“… 2005 πŸ› Elsevier Science 🌐 English βš– 301 KB

We present a novel algorithm using new hypothesis representations for learning context-free grammars from a finite set of positive and negative examples. We propose an efficient hypothesis representation method which consists of a table-like data structure similar to the parse table used in efficien

The equivalence of Nonassociative Lambek
The equivalence of Nonassociative Lambek Categorial Grammars and Context-Free Grammars
✍ Maciej Kandulski πŸ“‚ Article πŸ“… 1988 πŸ› John Wiley and Sons 🌐 English βš– 699 KB

Besides this introduction the paper contains four sections. I n section 1 we describe three equivalent axiomatizations of NLP. the third one playing important role in what follows. I n section 2 we deal with a system AC: (the Ajdukiewicz calculus with product) and prove the equivalence of AC-grammar