1 / 13

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. Paticipation Homeworks Project. Requirements. Idealy: A logic programmer An OO programmer

paulos
Download Presentation

Martin Kay Stanford University

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

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

  2. Classical nonstatistical methods in computational linguistics and natural language processing.

  3. Paticipation Homeworks Project Requirements

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

  5. Proposals

  6. Presentations Presentations

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

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

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

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

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

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

More Related