LING 388: Language and Computers Sandiway Fong Lecture 1: 8/22.

Slides:



Advertisements
Similar presentations
LING 388: Language and Computers Sandiway Fong Lecture 2.
Advertisements

LING 388: Language and Computers Sandiway Fong Lecture 2: 8/24.
LING 388: Language and Computers Sandiway Fong Lecture 2: 8/25.
Welcome to Physics 1809! General Physics Lab Spring 2013.
C SC 620 Advanced Topics in Natural Language Processing Sandiway Fong.
LING 388: Language and Computers Sandiway Fong Lecture 28: 12/6.
LING/C SC/PSYC 438/538 Computational Linguistics Sandiway Fong Lecture 1: 8/21.
CS 232 Geometric Algorithms: Lecture 1 Shang-Hua Teng Department of Computer Science, Boston University.
CS 331 / CMPE 334 – Intro to AI CS 531 / CMPE AI Course Outline.
My Policies and Some Advice for Doing Well in this Course.
LING 364: Introduction to Formal Semantics Lecture 1 January 12th.
LING 388 Language and Computers Take-Home Final Examination 12/9/03 Sandiway FONG.
CS 232 Geometric Algorithms: Lecture 1 Shang-Hua Teng Department of Computer Science, Boston University.
438/538 Computational Linguistics Sandiway Fong Lecture 1: 8/22.
Computational Intelligence 696i Language Lecture 1 Sandiway Fong.
LING 388: Language and Computers Sandiway Fong Lecture 1: 8/23.
SE 350 – Programming Games Lecture 1: Introduction Lecturer: Gazihan Alankuş Please look at the last two slides for assignments (marked with TODO) 2/10/20121.
Section 12: Call No Tuesday 9:00-10:15Eureka-106 MIS 1a Thursday 9:00-10:15Eureka-106 Meets the First week (9/3 and 9/5):
ECS15: Introduction to Computers Fall 2013 Patrice Koehl
Computer Science 102 Data Structures and Algorithms V Fall 2009 Lecture 1: administrative details Professor: Evan Korth New York University 1.
LING/C SC/PSYC 438/538 Lecture 2 Sandiway Fong. Today’s Topics Did you read Chapter 1 of JM? – Short Homework 1 (submit by midnight Saturday) Some slides.
Welcome to CS 115! Introduction to Programming Fall 2015.
Welcome to CS 115! Introduction to Programming. Class URL Please write this down!
CSCI 347 – Data Mining Lecture 01 – Course Overview.
COMP 111 Programming Languages 1 First Day. Course COMP111 Dr. Abdul-Hameed Assawadi Office: Room AS15 – No. 2 Tel: Ext. ??
COMP Introduction to Programming Yi Hong May 13, 2015.
LING 388: Language and Computers Sandiway Fong Lecture 5.
LING 388: Language and Computers Sandiway Fong Lecture 4.
Chapter Eight Academic Survival Skills. Study Skills  For most students time is the greatest issue.  The first rule to follow is to allow two or three.
James Tam CPSC 203: Introduction To Computers (Independent Study) James Tam.
Artificial Intelligence Introductory Lecture Jennifer J. Burg Department of Mathematics and Computer Science.
CST 229 Introduction to Grammars Dr. Sherry Yang Room 213 (503)
Welcome to IIT and cs115!.
LING 388: Language and Computers Sandiway Fong Lecture 3.
LING 388: Language and Computers Sandiway Fong Lecture 30 12/8.
Computer Science 10: Introduction to Computer Science Dr. Natalie Linnell with credit to Cay Horstmann and Marty Stepp.
Welcome to CS 115! Introduction to Programming. Class URL
Catie Welsh January 10, 2011 MWF 1-1:50 pm Sitterson 014.
Welcome to CS 115! Introduction to Programming. Class URL Write this down!
Artificial Intelligence Programming in Prolog Lecture 1: An Introduction 23/09/04.
COP3502: Introduction to Computer Science Yashas Shankar.
CS 6961: Structured Prediction Fall 2014 Course Information.
LING 388: Language and Computers Sandiway Fong Lecture 1: 8/23.
INTRODUCTION TO PROGRAMMING ISMAIL ABUMUHFOUZ | CS 146.
IST 210: Organization of Data
CIS 842: Specification and Verification of Reactive Systems Lecture ADM: Course Administration Copyright , Matt Dwyer, John Hatcliff, Robby. The.
1 CS 101 Today’s class will begin about 5 minutes late We will discuss the lab scheduling problems once class starts.
CS Introduction to Computer Science Spring 2011 Dr. Angela Guercio (
Welcome to Astronomy 113 “ It would seem that you have no useful skill or talent whatsoever, he said.
Syllabus Highlights CSE 1310 – Introduction to Computers and Programming Vassilis Athitsos University of Texas at Arlington 1.
Data Structures and Algorithms in Java AlaaEddin 2012.
CSE 1340 Introduction to Computing Concepts Class 1 ~ Intro.
IST 210: ORGANIZATION OF DATA Introduction IST210 1.
PROBLEM SOLVING AND PROGRAMMING ISMAIL ABUMUHFOUZ | CS 170.
Biotechniques – BIOL 410 T/R 9:30 AM - 12:15 PM Prof. Justin Golub THIS COULD BE YOU!!!!
WELCOME TO MICRO ECONOMICS AB 224 Discussion of Syllabus and Expectations in the Class.
Computer Science I ISMAIL ABUMUHFOUZ | CS 180. CS 180 Description BRIEF SUMMARY: This course covers a study of the algorithmic approach and the object.
Welcome to CS 115! Introduction to Programming Spring 2016.
Welcome to Introduction to Psychology! Let’s share a bit about where we are all from…
Basics Attendance & Progress RulesResources Class Syllabus
Syllabus Highlights CSE 1310 – Introduction to Computers and Programming Alexandra Stefan University of Texas at Arlington 1.
Introduction to Programming
Introduction to Programming Spring 2016
Welcome to CS 1010! Algorithmic Problem Solving.
Welcome to CS 1340! Computing for scientists.
Welcome to CS 1010! Algorithmic Problem Solving.
Welcome to CS 1301! Principles of Programming I.
Accelerated Introduction to Computer Science
LING 388: Computers and Language
Syllabus Highlights CSE 1310 – Introduction to Computers and Programming Alexandra Stefan University of Texas at Arlington.
Presentation transcript:

LING 388: Language and Computers Sandiway Fong Lecture 1: 8/22

Administrivia Where –Harvill 313 When –TR 3:30-4:45PM No Class –Thursday September 14th –Thursday September 28th –Thursday November 23rd (Thanksgiving) Office Hours –catch me after class, or –by appointment –Location: Douglass 311

Administrivia Map –Classroom (Harvill) –Office (Douglass) –Lab –(SS 224)

Administrivia Class mailing list Homepage – Lecture slides: –available on homepage after each class –in both PowerPoint (.ppt) and Adobe PDF formats.ppt slides may contain animation –slides from previous years are available online caution: there will be changes from last year

Administrivia Tips on how to take this class –No required textbook save time –Lecture slides contain everything you need to know in order to do the homeworks To understand the slides, you need to attend classes to “grok” the concepts –Unclear on something? You are encouraged to ask questions in or after class Ask while the question is still fresh in your mind –Have an idea, want to go over some of the material again, or have more in-depth questions? Make an appointment

Administrivia Course Objectives –Theoretical Introduction to natural language processing techniques –Practical Be able to write a natural language grammar that runs on a computer Get an idea of what’s hard and what’s easy to do on a computer Goal: by the end of the course, you will have built a small machine translation engine

Administrivia Class demographics:

Administrivia Laboratory Exercises –Some lectures will be laboratory sessions (typically Thursdays) –We will do exercises on the computer in class –Homework questions will be handed out in these sessions –Homework questions are designed to extend the exercises done in the lab –You may do the homework exercises on your own computer or at the computer laboratory

Administrivia Grading –6~7 homeworks –Mandatory and Extra Credit Questions: extra credit questions may be applied to the current homework they may also bump you up a grade if you are borderline at the end of the semester –Homeworks are due 1 week after they are handed out –Homeworks must be submitted by (by midnight) –Example: a homework given out on Thursday will be due next Thursday at midnight Ethics –You may discuss the homeworks with your classmates –However, you must do the work and write them up independently –Sources must be acknowledged (students, webpage) –Cheaters will be sanctioned

Administrivia Homework tips –Homeworks are based on lab exercises make sure you show up for the lab lectures –Possible time-saving strategy: stay on after the lecture and do the homework questions right there exercises are fresh in your mind may even be possible to complete the homework in an hour right there … –Nightmare strategy: wait until the evening homework is due, scratch your head over the lecture notes, have tons of questions and start panicking your computer crashes, the net goes down …

Administrivia Late Policy –All homeworks are mandatory –deduction if handed in late –If you know you’re going to be late or have an upcoming emergency, let me know ahead of time

Administrivia Homework Disaster Repair Policy –You “tank” on a homework do badly or way worse than you expected don’t panic –Strategies always attempt any extra credit questions get help and explanations from me –plus an extra question or two to demonstrate your understanding –Philosophy You are not penalized for learning or making an unfortunate mistake

Administrivia There is a laptop being passed around Fill out Excel spreadsheet entries: –Name – –Year –Major –Relevant background

Natural Language Processing (NLP) Human Language Technology (HLT) Computational Linguistics Question: –How to process natural languages on a computer Intersects with: –Computer science (CS) –Mathematics/Statistics –Artificial intelligence (AI) –Linguistic Theory –Psychology: Psycholinguistics e.g. the human sentence processor

Applications Information retrieval –information is stored and accessed using language (keywords etc.) –document classification ( , news) Machine translation –babelfish –Google Language Comprehension –document summarization Speech –automated 800 toll-free directory ( ) –cellphones (handsfree dialing) –car navigation (voice-synthesized directions)

Applications –technology is still in development computers can’t really understand language (yet) –see babelfish or google webpage translation –well, it’s free! even if we are willing to pay... –machine translation has been worked on since after World War II (1950s) –still not perfected today –why? –what are the properties of human languages that make it hard?

Natural Language Properties Which ones are going to be difficult for computers to deal with? Grammar (Rules for putting words together into sentences) –How many rules are there? 100, 1000, 10000, more … –Portions learnt or innate –Do we have all the rules written down somewhere? Lexicon (Dictionary) –How many words do we need to know? 1000, 10000, …

Computers vs. Humans Knowledge of language –Computers are way faster than humans They kill us at arithmetic and chess –But human beings are so good at language, we often take our ability for granted Processed without conscious thought Do pretty complex things

Examples Knowledge –Which report did you file without reading? –(Parasitic gap sentence)

Examples Changes in interpretation John is too stubborn to talk to John is too stubborn to talk to Bill

Examples Ambiguity –Where can I see the bus stop? –stop: verb or part of the noun-noun compound bus stop –Context (Discourse or situation)

Examples Ungrammaticality –*Which book did you file the report without reading? –* = ungrammatical relative –ungrammatical vs. incomprehensible

Example The human parser has quirks Ian told the man that he hired a story Ian told the man that he hired a secretary Garden-pathing Temporary ambiguity tell: someone something vs. …

Examples More subtle differences The reporter who the senator attacked admitted the error The reporter who attacked the senator admitted the error –Processing time –Subject vs. object relative clauses –Q: Do we want to mimic the human parser completely?

Next time … this Thursday –Class meets in the SBS RI Lab (Social Sciences 224) We begin our gentle introduction (from scratch) to a logic-based computer language –Series of six lectures –Name: PROLOG –Variant: SWI-PROLOG (free software) –Download: –Based on logic –“Natural” and easy to learn but powerful –Contains lots of nifty built-in features for writing grammars language was originally designed for this purpose

Your Homework for Today Install SWI-Prolog on your PC

Prolog Resources Some background in logic or programming? Useful Online Tutorials –An introduction to Prolog (Michel Loiseleur & Nicolas Vigier) attacks.org/~boklm/prolog/ attacks.org/~boklm/prolog/ –Learn Prolog Now! (Patrick Blackburn, Johan Bos & Kristina Striegnitz) saarland.de/~kris/learn-prolog- now/lpnpage.php?pageid=onlinehttp:// saarland.de/~kris/learn-prolog- now/lpnpage.php?pageid=online