Comprehension grammars generated from machine learning of natural languages
From MaRDI portal
Publication:1900979
zbMATH Open0831.68092MaRDI QIDQ1900979FDOQ1900979
Authors: P. Suppes, Michael Böttner, Lin Liang 
Publication date: 13 February 1996
Published in: Machine Learning (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 1101396
- Grammatical Inference: Algorithms and Applications
- Grammatical inference of PCFGs applied to language modelling and unsupervised parsing
- Probabilistic Generalization of Simple Grammars and Its Application to Reinforcement Learning
- Inference of Finite-State Probabilistic Grammars
Learning and adaptive systems in artificial intelligence (68T05) Natural language processing (68T50)
Cited In (9)
- Language comprehension as a multi‐label classification problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Learning perceptually grounded word meanings from unaligned parallel data
- Learning from natural instructions
- Title not available (Why is that?)
- The emergence of compositional grammars in artificial codes
This page was built for publication: Comprehension grammars generated from machine learning of natural languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1900979)
