LING 696G Computational Linguistics Seminar Lecture 2 2/2/04.

Slides:



Advertisements
Similar presentations
Mini Presentations: How To
Advertisements

 Christel Kemke 2007/08 COMP 4060 Natural Language Processing Feature Structures and Unification.
Chapter 4 Syntax.
Movement Markonah : Honey buns, there’s something I wanted to ask you
GPSG, HPSG, LFG Jack Hoeksema. Syntax in the 1970’s Rapid growth of transformations: Movement: Wh-movement, relativisation, topicalization, V2, Subject-Aux.
Grammar Development Platform Miriam Butt October 2002.
Course: Natural Language Syntax (CS 6998) Spring 2005 Martin JanscheMartin Jansche and Owen RambowOwen Rambow.
Overview of the Hindi-Urdu Treebank Fei Xia University of Washington 7/23/2011.
LING 696G Computational Linguistics Seminar Lecture 3 2/15/04.
Section 4: Language and Intelligence Overview Instructor: Sandiway Fong Department of Linguistics Department of Computer Science.
Modeling Linguistic Theory on a Computer: From GB to Minimalism Sandiway Fong Dept. of Linguistics Dept. of Computer Science.
Kakia Chatsiou Modern Greek Grammar fragment Implementation using XLE FLATLANDS GreekGram Reporting on the progress of the implementation.
LING NLP 1 Introduction to Computational Linguistics Martha Palmer April 19, 2006.
Linguistic Theory Lecture 8 Meaning and Grammar. A brief history In classical and traditional grammar not much distinction was made between grammar and.
NLP and Speech Course Review. Morphological Analyzer Lexicon Part-of-Speech (POS) Tagging Grammar Rules Parser thethe – determiner Det NP → Det.
LING 388: Language and Computers Sandiway Fong Lecture 28: 12/6.
DS-to-PS conversion Fei Xia University of Washington July 29,
Cpeg421-08S/final-review1 Course Review Tom St. John.
Computational Intelligence 696i Language Lecture 3 Sandiway Fong.
LING 388 Language and Computers Take-Home Final Examination 12/9/03 Sandiway FONG.
1 Kakia Chatsiou Department of Language and Linguistics University of Essex XLE Tutorial & Demo LG517. Introduction to LFG Introduction.
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:
Computational Intelligence 696i Language Lecture 1 Sandiway Fong.
Computational Grammars Azadeh Maghsoodi. History Before First 20s 20s World War II Last 1950s Nowadays.
Syntax Lecture 3: The Subject. The Basic Structure of the Clause Recall that our theory of structure says that all structures follow this pattern: It.
Syntax and Semantics Dr. Walid Amer, Associate Professor of linguistics The Islamic university of Gaza February, 2009.
Linguistic Theory Lecture 2 Phrase Structure. What was there before structure? Classical studies: Classical studies: –Languages such as Latin Rich morphology.
March 1, 2009 Dr. Muhammed Al-Mulhem 1 ICS 482 Natural Language Processing INTRODUCTION Muhammed Al-Mulhem March 1, 2009.
1 A Chart Parser for Analyzing Modern Standard Arabic Sentence Eman Othman Computer Science Dept., Institute of Statistical Studies and Research (ISSR),
Emergence of Syntax. Introduction  One of the most important concerns of theoretical linguistics today represents the study of the acquisition of language.
Lecture 1, 7/21/2005Natural Language Processing1 CS60057 Speech &Natural Language Processing Autumn 2005 Lecture 1 21 July 2005.
Elements of Computing Systems, Nisan & Schocken, MIT Press, 2005, Chapter 10: Compiler I: Syntax Analysis slide 1www.idc.ac.il/tecs.
Tree-adjoining grammar (TAG) is a grammar formalism defined by Aravind Joshi and introduced in Tree-adjoining grammars are somewhat similar to context-free.
LING 388: Language and Computers Sandiway Fong Lecture 30 12/8.
Kakia Chatsiou A brief introduction to XLE LG617 - XLE Lab1 LG617 A brief introduction to XLE Kakia Chatsiou Dept of Language.
Natural Language Processing Rogelio Dávila Pérez Profesor – Investigador
THE BIG PICTURE Basic Assumptions Linguistics is the empirical science that studies language (or linguistic behavior) Linguistics proposes theories (models)
1 Natural Language Processing Lecture Notes 11 Chapter 15 (part 1)
Chapter 4: Syntax Part V.
An ICALL writing support system tunable to varying levels of learner initiative Karin Harbusch 1 & Gerard Kempen 2,3 1 University of Koblenz-Landau, Koblenz,
1 Introduction to Computational Linguistics Eleni Miltsakaki AUTH Fall 2005-Lecture 4.
1 Acqusisition of Syntax Guasti Chapter 6; Thornton (1995)
CSA2050 Introduction to Computational Linguistics Lecture 1 Overview.
What you have learned and how you can use it : Grammars and Lexicons Parts I-III.
Rules, Movement, Ambiguity
1 Principles & Parameters Approach in Linguistics - IV Bibhuti Bhusan Mahapatra.
The Minimalist Program
Linguistic Theory Lecture 5 Filters. The Structure of the Grammar 1960s (Standard Theory) LexiconPhrase Structure Rules Deep Structure Transformations.
Compiler Construction (CS-636)
1 Syntax 1. 2 In your free time Look at the diagram again, and try to understand it. Phonetics Phonology Sounds of language Linguistics Grammar MorphologySyntax.
◦ Process of describing the structure of phrases and sentences Chapter 8 - Phrases and sentences: grammar1.
 2003 CSLI Publications Ling 566 Oct 17, 2011 How the Grammar Works.
3.3 A More Detailed Look At Transformations Inversion (revised): Move Infl to C. Do Insertion: Insert interrogative do into an empty.
Principles and Parameters (II) Rajat Kumar Mohanty Department of Computer Science and Engineering Indian Institute of Technology Bombay.
ICS312 Introduction to Compilers Set 23. What is a Compiler? A compiler is software (a program) that translates a high-level programming language to machine.
Computational Intelligence 696i Language Homework 1 Answers Sandiway Fong.
Presented by : A best website designer company. Chapter 1 Introduction Prof Chung. 1.
Chapter 3 Language Acquisition: A Linguistic Treatment Jang, HaYoung Biointelligence Laborotary Seoul National University.
10/31/00 1 Introduction to Cognitive Science Linguistics Component Topic: Formal Grammars: Generating and Parsing Lecturer: Dr Bodomo.
Course Outline Advanced Syntax.
Chapter 1 Introduction.
Lecture – VIII Monojit Choudhury RS, CSE, IIT Kharagpur
Basic Parsing with Context Free Grammars Chapter 13
Chapter 1 Introduction.
Syntax Lecture 1: X-bar Theory.
An ICALL writing support system tunable to varying levels
LING 696G Computational Linguistics Seminar
Principles and Parameters (I)
Lecture 2 Krisztina Szécsényi
Presentation transcript:

LING 696G Computational Linguistics Seminar Lecture 2 2/2/04

Administrivia No meeting next Monday (2/09)

The PAPPI System PAPPI: –Principles-and-Parameters Parser Interface –(real demo this time…)

Outline General Introduction: –What is a Parser? –The Principles-and-Parameters Framework: Government-and-Binding Theory Introduction to the PAPPI System: –User Interface –Debugging –Project Scope

Outline Architecture Overview Components: –Simple Morphology –Recovery of Phrase Structure –Recovery of Movement: Determination of chain features –Free Indexation –Conditions on Trees and Domains

Outline General Introduction: –What is a Parser? –The Principles-and-Parameters Framework: Government-and- Binding Theory Introduction to the PAPPI System: –User Interface –Debugging –Project Scope

What is a Parser?

Immediate Issues Parser Knowledge: –Grammar Which linguistic theory? –How to produce LDs? Which parsing algorithm? Other Issues: –Language Parameterization? Software viewpoint: –How do we re-use subcomponents of grammar for other languages? Linguistic theory viewpoint: – Re-use for other language => supporting evidence for principle or module –Lexical representation?

Principles-and-Parameters Framework Government-and-Binding Theory: –Lectures on Government and Binding (LGB) (Chomsky, 1981) –A Course In GB Syntax (Lasnik & Uriagereka) MIT Press Good introduction

Levels of Representation D-structure: –Basic structure S-structure: –visible movement, e.g. passivization, wh- movement, raising LF: –Quantifier scope, covert wh-movement

Levels of Representation Parsing Issues: –Recovery of empty categories –Recovery of “hidden” levels of representation –Relation between levels: re-creation of movement –Computational complexity

Outline General Introduction: –What is a Parser? –The Principles-and-Parameters Framework: Government-and- Binding Theory Introduction to the PAPPI System: –User Interface –Debugging –Project Scope

Interface

Project Scope English –Classic GB: A Course in GB Syntax, Lasnik & Uriagereka –Plug-ins: VPS, Double Objects (Ch5) Zero Syntax Pesetsky Japanese –On the Nature of Proper Government, (Lasnik & Saito), Head- final, pro-Drop, LF Wh-movement –Scrambling: Some Asymmetries in Japanese... (Saito 85) –On Long-Distance Scrambling (Saito 92). WCO, A/A-bar distinction, Binding –Kanda Project: o/ni-causatives, Double-o constraint, Anti- superiority...

Project Scope Dutch V2 (also German), VR, Rightwards clausal extraposition. French –Verb Movement, UG, and the Structure of IP, Pollock. Clitics (also Spanish) Korean –Scrambling as Case-Driven Obligatory Movement, (Ch2) Lee, Reconstruction Turkish, Hungarian –Basic sentence structure, morphology, causatives. Arabic –VSO/SVO weak/strong verb agreement features

Outline Architecture Overview Components: –Simple Morphology –Recovery of Phrase Structure –Recovery of Movement: Determination of chain features –Free Indexation –Conditions on Trees and Domains

Architecture

Salient Points: –Avoid hardwiring –Logic-based inference engine: – Unification. Choice points: single thread, parallel –Abstraction: conditions on trees, features, domains –Direct interpretation: infeasible. Specialization permits re- targeting –Sicstus Prolog (native: fastcode) port: factor of 0.425

Architecture

Outline Architecture Overview Components: –Simple Morphology –Recovery of Phrase Structure –Recovery of Movement: Determination of chain features –Free Indexation –Conditions on Trees and Domains

Simple Morphology: Features and Markers

Recovery of Phrase Structure X-bar + X 0 -Movement Rules: –rule XP -> [XB|spec(XB)] ordered specFinal st max(XP), proj(XB,XP). –rule XB -> [X|compl(X)] ordered headInitial(X) st bar(XB), proj(X,XB), head(X). –rule v(V) moves_to i provided agr(strong), finite(V). –rule v(V) moves_to i provided agr(weak), V has_feature aux.

Recovery of Phrase Structure: Backtracking Canonical LR(1)-based Shift/Reduce Parser

Recovery of Phrase Structure: Other Constraints

Phrase Structure After Chain Formation

Recovery of Movement: Computation of Chain Features

Recovery of Movement: Complexity

Phrase Structure after Free Indexation