Section 4: Language and Intelligence Overview Instructor: Sandiway Fong Department of Linguistics Department of Computer Science.

Slides:



Advertisements
Similar presentations
Standards Alignment A study of alignment between state standards and the ACM K-12 Curriculum.
Advertisements

Using Link Grammar and WordNet on Fact Extraction for the Travel Domain.
CMSC 104, Version 8/061L04Algorithms1.ppt Algorithms, Part 1 of 3 Topics Definition of an Algorithm Algorithm Examples Syntax versus Semantics Reading.
ConceptNet: A Wonderful Semantic World
Introductory Lecture. What is Discrete Mathematics? Discrete mathematics is the part of mathematics devoted to the study of discrete (as opposed to continuous)
1 i206: Distributed Computing Applications & Infrastructure 2012
CSE 571 (14362) Artificial Intelligence (TTh 3:15 – 4: 30 PM, BYAC 150) Instructor: Chitta Baral Office hours: TTh 4:40 to 5:30 PM.
Computer Software & Software Development H&K Chapter 1 Instructor – Gokcen Cilingir Cpt S 121 (June 20, 2011) Washington State University.
OV-1.1 CSE4100 CSE4100 Programming Language Translation Prof. Steven A. Demurjian, Sr. Computer Science & Engineering Department The University of Connecticut.
C SC 620 Advanced Topics in Natural Language Processing Sandiway Fong.
Computational Intelligence 696i Language Lecture 5 Sandiway Fong.
CSCI 3 Introduction to Computer Science. CSCI 3 Course Description: –An overview of the fundamentals of computer science. Topics covered include number.
LING 364: Introduction to Formal Semantics Lecture 1 January 12th.
© Anselm SpoerriInfo + Web Tech Course Information Technologies Info + Web Tech Course Anselm Spoerri PhD (MIT) Rutgers University
The Semantic Web Week 1 Module Content + Assessment Lee McCluskey, room 2/07 Department of Computing And Mathematical Sciences Module.
Computational Intelligence 696i Language Lecture 4 Sandiway Fong.
1 Introduction to Computational Natural Language Learning Linguistics (Under: Topics in Natural Language Processing ) Computer Science (Under:
LING 438/538 Computational Linguistics Sandiway Fong Lecture 25: 11/29.
Computational Intelligence 696i Language Lecture 1 Sandiway Fong.
C SC 620 Advanced Topics in Natural Language Processing Lecture Notes 3 1/22/04.
OV-1.1 CSE244 CSE244 Programming Language Translation Aggelos Kiayias Computer Science & Engineering Department The University of Connecticut 371 Fairfield.
Chapter 8: Digital Diagrams Section III: Using Visual Learning Tools to Enhance Learning.
Lecture 1 Introduction: Linguistic Theory and Theories
Generative Grammar(Part ii)
Language Acquisition GST 400 Bethany Gilliam 04/10/06.
1. Human – the end-user of a program – the others in the organization Computer – the machine the program runs on – often split between clients & servers.
Prof. dr Slobodanka Đorđević-Kajan Dr Dragan Stojanović
CSC1401: Introductory Programming Steve Cooper
LING 388: Language and Computers Sandiway Fong Lecture 24: 11/17.
LING 696G Computational Linguistics Seminar Lecture 2 2/2/04.
LING 438/538 Computational Linguistics Sandiway Fong Lecture 29.
LING 388: Language and Computers Sandiway Fong Lecture 3.
Jennie Ning Zheng Linda Melchor Ferhat Omur. Contents Introduction WordNet Application – WordNet Data Structure - WordNet FrameNet Application – FrameNet.
NLP And The Semantic Web Dainis Kiusals COMS E6125 Spring 2010.
The Perfect Vacation: Working at a Travel Agency Liza Moreno EDTC 6341.
EMT1111 Logic and Problem Solving Dr. José M. Reyes Álamo Lecture 1.
WORD SENSE DISAMBIGUATION STUDY ON WORD NET ONTOLOGY Akilan Velmurugan Computer Networks – CS 790G.
CSE 571 (11147) Artificial Intelligence (MW 3:15 – 4: 30 PM, ECA A219) Instructor: Chitta Baral Office hours: Tuesday 2 to 5 PM.
Discrete Structures for Computing
Algorithms, Part 1 of 3 Topics  Definition of an Algorithm  Algorithm Examples  Syntax versus Semantics Reading  Sections
1 CSI 5180: Topics in AI: Natural Language Processing, A Statistical Approach Instructor: Nathalie Japkowicz Objectives of.
October 2005CSA3180 NLP1 CSA3180 Natural Language Processing Introduction and Course Overview.
CMSC104 Problem Solving and Computer Programming Spring 2011 Section 04 John Park.
Wordnet - A lexical database for the English Language.
REVIEW OF ACTIVITIES OF THE WORK GROUP FOR INTERNET AND e -TECHNOLOGIES Prof. Dr Milena Stanković Faculty of Electronic Engineering TEMPUS Project CD-JEP.
The Develop ment of Thought and Languag e Chapter 11 Thought & Language Chapter 10.
◦ Process of describing the structure of phrases and sentences Chapter 8 - Phrases and sentences: grammar1.
Knowledge Structure Vijay Meena ( ) Gaurav Meena ( )
Miss. Mona AL-Kahtano. The proponent of this theory: Chomsky When: ( ) Basic assumption: Humans has a specific, innate capacity for languages.
1 UMBC CMSC 104, Section Fall 2002 Algorithms, Part 1 of 3 Topics Definition of an Algorithm Algorithm Examples Syntax versus Semantics Reading.
Introduction: What is AI? CMSC Introduction to Artificial Intelligence January 3, 2002.
Introduction: What is AI? CMSC Introduction to Artificial Intelligence January 7, 2003.
MENTAL GRAMMAR Language and mind. First half of 20 th cent. – What the main goal of linguistics should be? Behaviorism – Bloomfield: goal of linguistics.
Introductory Lecture. What is Discrete Mathematics? Discrete mathematics is the part of mathematics devoted to the study of discrete (as opposed to continuous)
CMSC 104, L041 Algorithms, Part 1 of 3 Topics Definition of an Algorithm Example: The Euclidean Algorithm Syntax versus Semantics Reading Sections 3.1.
Computer Science Standards Review
Algorithms, Part 1 of 3 The First step in the programming process
Algorithms, Part 1 of 3 Topics Definition of an Algorithm
Algorithms I: An Introduction to Algorithms
Artificial Intelligence (CS 461D)
Discrete Mathematics and Its Applications
2008/09/17: Lecture 4 CMSC 104, Section 0101 John Y. Park
WordNet: A Lexical Database for English
Algorithms, Part 1 of 3 Topics Definition of an Algorithm
Principles of Computing – UFCFA Week 1
Traditional Grammar VS. Generative Grammar
Standards learning goals - syllabus lecture notes – the current .ppt
Standards learning goals - syllabus lecture notes – the current .ppt
Discrete Mathematics and Its Applications
Algorithms, Part 1 of 3 Topics Definition of an Algorithm
Presentation transcript:

Section 4: Language and Intelligence Overview Instructor: Sandiway Fong Department of Linguistics Department of Computer Science

Course Contents Two Parts 1.Computing with Linguistic Theory –How can we analyze sentences on a computer on the basis of universal principles of grammar? –Introduction to systems of linguistic principles and language parameters 2.Computing Semantic Relations between Words and Concepts –What can we do with a computer and a semantic network of words? –Find connections between words, recover latent semantic relations and deduce commonalities between words

Course Contents Two Homework Exercises –one for each part of the course grading: 50/50 split –both involve use of specific computer tools developed by the instructor freely downloadable log in to computational linguistics lab machines –or use your own computer tools run on MacOS X and PCs –Linux directly –Windows via X-Windows client software little (to no) coding involved ability to read code is a plus –programming language is Prolog (logic)

Part 1 Computing with Linguistic Theory –Universal Grammar (UG) language is special –idea there is a “language faculty” in the human mind (Chomsky, Knowledge of Language, 1986) –general theory of a framework of principles and elements common to attainable human languages –language faculty is a language acquisition device, an innate component of the human mind, containing UG that yields a particular language through interaction with presented experience –Acquisition LouAnn Gerkin (guest lecture) –We will explore a computer implementation of a UG a common set of syntactic principles systematic variation across particular languages encoded by language parameters

Part 1 Computing with Linguistic Theory –PAPPI Demo language: Turkish principles: constraints principles: generators input: sentence output: syntactic logical form

Part 1 Computing with Linguistic Theory –Background Reading Motivation and Philosophy –Knowledge of Language, N. A. Chomsky. Praeger »Ch1: Knowledge of Language as a Focus of Inquiry (1–14) Introductory Technical Material –Chomsky's Universal Grammar: An Introduction. V.J. Cook. Blackwell –A Course in GB Syntax. H. Lasnik. MIT Press PAPPI –

Part 2 Computing Semantic Relations between Words and Concepts –We will use WordNet to compute linguistically-motivated relations between words –WordNet English WordNet (Princeton) is a hand-compiled network of 200,000 word senses (meanings) with 600,000 links –note: there are also WordNets for many other languages Princeton WordNet website: – –“WordNet is an on-line lexical reference system whose design is inspired by current psycholinguistic theories of human lexical memory. English nouns, verbs, adjectives and adverbs are organized into synonym sets, each representing one underlying lexical concept. Different relations link the synonym sets.”

Part 2 Computing Semantic Relations between Words and Concepts –Quick Example: What is the relationship between concepts mend and tear? Consider the sentence: –John mended the torn dress »example from Event-based Models of Change and Persistence in Language (Pustejovsky, 2000) Contrast with: –John mended the red dress Answer: –After the completion of the “mending” event, we would expect the dress to be no longer torn in John mended the torn dress i.e. there is semantic opposition between the concepts mend and tear –In John mended the red dress, we would not expect the dress to change color from red i.e. there is no semantic opposition between the concepts mend and red

Part 2 Computing Semantic Relations between Words and Concepts –Quick Example: What is the relationship between concepts mend and tear? –John mended the torn dress –We can figure this out by looking at the connections in WordNet

Part 2 Computing Semantic Relations between Words and Concepts –Software (Graphical): wnconnect relations connection graph concepts

Part 2 Computing Semantic Relations between Words and Concepts –More generally, we can also use the structure of WordNet to solve reasoning puzzles like: What have (specific senses) of the following nouns in common? –Umbrella –Saucepan –Baseball bat –Carpet beater but do not share with: –Giraffe –Pretzel –Homework

Part 2 Computing Semantic Relations between Words and Concepts –Background Reading: 5 Papers on WordNet by the Princeton WordNet team – WordNet: An Electronic Database, Ed. C. Fellbaum. MIT Press Princeton WordNet Website –