Martin kay stanford university l.jpg
Sponsored Links
This presentation is the property of its rightful owner.
1 / 13

Martin Kay Stanford University PowerPoint PPT Presentation


  • 114 Views
  • Uploaded on
  • Presentation posted in: General

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

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.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -

Presentation Transcript


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

A linguist

Each member must be able to answer questions about any aspect of its work.

Teams


Proposals


Presentations

Presentations


Office Hours

  • TuTh 2-3p.m and by appointment

  • 460-124 (Margaret Jacks Hall)

  • [email protected]


Questions

Name

email

freshman … graduate, auditing, visitor

Experience

Algorithms

Complexity

Programming languages

Natural langauge

Send to [email protected]


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


  • Login