Martin Kay Stanford University

Slides:

Advertisements

Similar presentations

Formal Languages: main findings so far A problem can be formalised as a formal language A formal language can be defined in various ways, e.g.: the language.

Advertisements

CSE 202 – Formal Languages and Automata Theory 1 REGULAR LANGUAGE.

Natural Language and Speech Processing Creation of computational models of the understanding and the generation of natural language. Different fields coming.

NLP and Speech Course Review. Morphological Analyzer Lexicon Part-of-Speech (POS) Tagging Grammar Rules Parser thethe – determiner Det NP → Det.

CSE111: Great Ideas in Computer Science Dr. Carl Alphonce 219 Bell Hall Office hours: M-F 11:00-11:

CS 581: Introduction to the Theory of Computation Lecture 1 James Hook Portland State University

Shallow Processing: Summary Shallow Processing Techniques for NLP Ling570 December 7, 2011.

C SC 620 Advanced Topics in Natural Language Processing Sandiway Fong.

LING 388: Language and Computers Sandiway Fong Lecture 28: 12/6.

1/7 INFO60021 Natural Language Processing Harold Somers Professor of Language Engineering.

CS Master – Introduction to the Theory of Computation Jan Maluszynski - HT Lecture 1 Introduction Jan Maluszynski, IDA, 2007

LING 388 Language and Computers Take-Home Final Examination 12/9/03 Sandiway FONG.

LING 388: Language and Computers Sandiway Fong Lecture 28: 12/5.

Applying Software Model Checking to Automatic Text Summarization SSSEV2011 Irina Shoshmina, Nasrin Mostafazadeh, Omid Bakhshandeh, Alexey Belyaev, and.

تمرين شماره 1 درس NLP سيلابس درس NLP در دانشگاه هاي ديگر ___________________________ راحله مکي استاد درس: دکتر عبدالله زاده پاييز 85.

CS 581: Introduction to the Theory of Computation Lecture 1 James Hook Portland State University

Final Exam Review Cummulative Chapters 0, 1, 2, 3, 4, 5 and 7.

Irene Díaz 1, Camino R. Vela 1 1 Computer Science Department. University of Oviedo (SPAIN) s 1.

9/8/20151 Natural Language Processing Lecture Notes 1.

Introduction to Natural Language Processing Heshaam Faili University of Tehran.

Martin KayCL Introduction1 Martin Kay Stanford University Ling 138/238.

Computational Linguistics Yoad Winter *General overview *Examples: Transducers; Stanford Parser; Google Translate; Word-Sense Disambiguation * Finite State.

LING 388: Language and Computers Sandiway Fong Lecture 22: 11/10.

CST 229 Introduction to Grammars Dr. Sherry Yang Room 213 (503)

LING 388: Language and Computers Sandiway Fong Lecture 30 12/8.

CS355 – Theory of Computation Dr. Aidan Mooney, September 2006 National University of Ireland, Maynooth Department of Computer Science.

CS 390 Introduction to Theoretical Computer Science.

CSCI 2670 Introduction to Theory of Computing August 24, 2005.

© M. Winter COSC/MATH 4P61 - Theory of Computation COSC/MATH 4P61 Theory of Computation Michael Winter –office: J323 –office hours: Mon & Fri, 10:00am-noon.

Suléne Pilon & Danie Prinsloo Overview: Teaching and Training in South Africa 25 November 2008;

Membership problem CYK Algorithm Project presentation CS 5800 Spring 2013 Professor : Dr. Elise de Doncker Presented by : Savitha parur venkitachalam.

CSC3315 (Spring 2009)1 CSC 3315 Languages & Compilers Hamid Harroud School of Science and Engineering, Akhawayn University

October 2005CSA3180 NLP1 CSA3180 Natural Language Processing Introduction and Course Overview.

CSA2050 Introduction to Computational Linguistics Lecture 1 Overview.

ICS 482: Natural language Processing Pre-introduction

Saeid Pashzadeh Jan 2009 Theory of Computation 1.

Lecturer –John McKenna – –Room L2.47 –Phone (700)5507 Tutor –Mairéad McCarthy – CA261 Computational.

CSE467/567 Computational Linguistics Carl Alphonce Computer Science & Engineering University at Buffalo.

CS 4705 Lecture 2 Regular Expressions and Automata.

Models of Computing Regular Expressions 1. Formal models of computation What can be computed? What is a valid program? What is a valid name of a variable.

Chapter 5 Context-Free Languages Regular language are effective in describing certain simple patterns. But it is not enough to describe programming languages.

Grammar Set of variables Set of terminal symbols Start variable Set of Production rules.

C Sc 132 Computing Theory Professor Meiliu Lu Computer Science Department.

CSE 202 – Formal Languages and Automata Theory 1 REGULAR EXPRESSION.

King Faisal University جامعة الملك فيصل Deanship of E-Learning and Distance Education عمادة التعلم الإلكتروني والتعليم عن بعد [ ] 1 جامعة الملك فيصل عمادة.

Computation Theory Asia Mahdi. Textbooks Programs, Machines and Computation: An Introduction to the Theory of Computing - Authors: Keith Clark and Don.

Theory of Computation. Introduction to The Course Lectures: Room ( Sun. & Tue.: 8 am – 9:30 am) Instructor: Dr. Ayman Srour (Ph.D. in Computer Science).

Computational and Evolutionary Aspects of Language Written by: Martin Nowak, Natalia Komarova, and Partha Niyogi Presentation by: Amerika Adams, Isaac.

Why Study Automata Theory and Formal Languages?

Why Study Automata? What the Course is About Administrivia

Chapter 1 Introduction.

Formal Language & Automata Theory

CSCI 2670 Introduction to Theory of Computing

Chapter 1 Introduction.

Natural Language Processing (NLP)

LING/C SC/PSYC 438/538 Lecture 11 Sandiway Fong.

Formal Language Theory

CISC 7120X Programming Languages and Compilers

Compiler Lecture 1 CS510.

Context Free Languages

Closure Properties of Context-Free languages

Regular Expressions

Decidable Problems of Regular Languages

Homework #5 (Models of Computation, Spring, 2001) Due: Section 1; February 27 Section 2; February 28 ** Please put your homework in the collection.

Natural Language Processing (NLP)

Teori Bahasa dan Automata Lecture 6: Regular Expression

Natural Language Processing (NLP)

Computer Science 210 Computer Organization

Presentation transcript:

Martin Kay Stanford University Algorithms and Programming for Natural Language Processing Martin Kay Stanford University

Classical nonstatistical methods in computational linguistics and natural language processing.

Requirements Paticipation Homeworks Project

Teams Idealy: A logic programmer An OO programmer A linguist Each member must be able to answer questions about any aspect of its work.

Proposals

Presentations Presentations

Office Hours TuTh 2-3p.m and by appointment 460-124 (Margaret Jacks Hall) mjkay@stanford.edu

Questions Name email freshman … graduate, auditing, visitor Experience Algorithms Complexity Programming languages Natural langauge Send to mjkay@stanford.edu

Programming Languages Languages that reveal algorithms clearly. Special status: Prolog and Ruby Deprecated: C, C++, Java, Perl

CL and NLP String searching Dictionary lookup Morphology and morphographemics Tagging Parsing Generation Unification Translation

Programming Theory and Technique Complexity and efficiency Search and nondeterminism Agendas Memoization and dynamic programming Prolog and logic programming Object-oriented programming

Automata and Formal Languages Properties of strings Regular languages and finite-state automata Finite-state transducers Context-free languages Unification grammar