<--- Back to Details
First PageDocument Content
Genetic programming / Grammar / Grammar induction / Inference / Natural language processing / Machine learning / Algorithm / Cognition / Cognitive science / Artificial intelligence
Date: 2017-05-18 12:57:06
Genetic programming
Grammar
Grammar induction
Inference
Natural language processing
Machine learning
Algorithm
Cognition
Cognitive science
Artificial intelligence

Jointly Learning Grounded Task Structures from Language Instruction and Visual Demonstration Changsong Liu1* , Shaohua Yang1* , Sari Saba-Sadiya1 , Nishant Shukla2 , Yunzhong He2 , Song-Chun Zhu2 , and Joyce Y. Chai1 1

Add to Reading List

Source URL: shukla.io

Download Document from Source Website

File Size: 1,30 MB

Share Document on Facebook

Similar Documents

Dialogue grammar induction MARK SNAITH Centre for Argument Technology, University of Dundee, UK  CHRIS REED Centre for Argument Technology, University of Dundee, UK

Dialogue grammar induction MARK SNAITH Centre for Argument Technology, University of Dundee, UK CHRIS REED Centre for Argument Technology, University of Dundee, UK

DocID: 1tOwy - View Document

Breaking Out of Local Optima with Count Transforms and Model Recombination: A Study in Grammar Induction Valentin I. Spitkovsky   Hiyan Alshawi

Breaking Out of Local Optima with Count Transforms and Model Recombination: A Study in Grammar Induction Valentin I. Spitkovsky Hiyan Alshawi

DocID: 1te9G - View Document

Grammatical Inference and Machine Learning Approaches to Post-Hoc LangSec Sheridan S. Curley Dr. Richard E. Harang

Grammatical Inference and Machine Learning Approaches to Post-Hoc LangSec Sheridan S. Curley Dr. Richard E. Harang

DocID: 1rbbS - View Document

UNCLASSIFIED  Grammatical Inference and Machine Learning Approaches to Post-Hoc LangSec Sheridan Curley and & Dr. Richard Harang (ARL)

UNCLASSIFIED Grammatical Inference and Machine Learning Approaches to Post-Hoc LangSec Sheridan Curley and & Dr. Richard Harang (ARL)

DocID: 1qu4H - View Document

CS 150 Lecture Slides  Motivation • Automata = abstract computing devices • Turing studied Turing Machines (= computers) before there were any real computers • We will also look at simpler devices than

CS 150 Lecture Slides Motivation • Automata = abstract computing devices • Turing studied Turing Machines (= computers) before there were any real computers • We will also look at simpler devices than

DocID: 1qnLQ - View Document