CSE6339 3.0 Introduction to Computational Linguistics Tuesdays, Thursdays 14:30-16:00 – South Ross 101 Fall Semester, 2011 Instructor: Nick Cercone - 3050.

Slides:



Advertisements
Similar presentations
The Structure of Sentences Asian 401
Advertisements

 Christel Kemke 2007/08 COMP 4060 Natural Language Processing Feature Structures and Unification.
07/05/2005CSA2050: DCG31 CSA2050 Introduction to Computational Linguistics Lecture DCG3 Handling Subcategorisation Handling Relative Clauses.
CSE Introduction to Computational Linguistics Tuesdays, Thursdays 14:30-16:00 – South Ross 101 Fall Semester, 2011 Instructor: Nick Cercone
Anders Holmberg CRiLLS.  The grammar of a language L: The set of categories, rules, and principles which relate sound to meaning in L  Speech sound.
Dr. Abdullah S. Al-Dobaian1 Ch. 2: Phrase Structure Syntactic Structure (basic concepts) Syntactic Structure (basic concepts)  A tree diagram marks constituents.
Statistical NLP: Lecture 3
MORPHOLOGY - morphemes are the building blocks that make up words.
Syllabus Text Books Classes Reading Material Assignments Grades Links Forum Text Books עיבוד שפות טבעיות - שיעור עשר Chart Parsing (cont) Features.
Analyzing Features of Grammatical Categories Show my head to the people; it is worth seeing. --Feature structure, to Ivan Sag in a dream.
Sag et al., Chapter 4 Complex Feature Values 10/7/04 Michael Mulyar.
 Christel Kemke 2007/08 COMP 4060 Natural Language Processing Feature Structures and Unification.
Features and Unification
1 Introduction to Computational Linguistics Eleni Miltsakaki AUTH Fall 2005-Lecture 2.
 2003 CSLI Publications Ling 566 Oct 16, 2007 How the Grammar Works.
CS 4705 Lecture 11 Feature Structures and Unification Parsing.
Stochastic POS tagging Stochastic taggers choose tags that result in the highest probability: P(word | tag) * P(tag | previous n tags) Stochastic taggers.
Relative clauses Chapter 11.
For Friday Finish chapter 23 Homework: –Chapter 22, exercise 9.
Tree-adjoining grammar (TAG) is a grammar formalism defined by Aravind Joshi and introduced in Tree-adjoining grammars are somewhat similar to context-free.
IV. SYNTAX. 1.1 What is syntax? Syntax is the study of how sentences are structured, or in other words, it tries to state what words can be combined with.
Click to edit Master title style Instructor: Nick Cercone CSEB - CSE Introduction to Computational Linguistics Tuesdays,
THE BIG PICTURE Basic Assumptions Linguistics is the empirical science that studies language (or linguistic behavior) Linguistics proposes theories (models)
1 LIN 1310B Introduction to Linguistics Prof: Nikolay Slavkov TA: Qinghua Tang CLASS 13, Feb 16, 2007.
12/06/1999 JHU CS /Jan Hajic 1 Introduction to Natural Language Processing ( ) Statistical Parsing Dr. Jan Hajič CS Dept., Johns Hopkins Univ.
May 2006CLINT-LN Parsing1 Computational Linguistics Introduction Parsing with Context Free Grammars.
October 2005csa3180: Parsing Algorithms 11 CSA350: NLP Algorithms Sentence Parsing I The Parsing Problem Parsing as Search Top Down/Bottom Up Parsing Strategies.
LOGIC AND ONTOLOGY Both logic and ontology are important areas of philosophy covering large, diverse, and active research projects. These two areas overlap.
2007CLINT-LIN-FEATSTR1 Computational Linguistics for Linguists Feature Structures.
1 LIN 1310B Introduction to Linguistics Prof: Nikolay Slavkov TA: Qinghua Tang CLASS 12, Feb 13, 2007.
1 Introduction to Computational Linguistics Eleni Miltsakaki AUTH Fall 2005-Lecture 4.
Head-driven Phrase Structure Grammar (HPSG)
Semantic Construction lecture 2. Semantic Construction Is there a systematic way of constructing semantic representation from a sentence of English? This.
Albert Gatt LIN3021 Formal Semantics Lecture 4. In this lecture Compositionality in Natural Langauge revisited: The role of types The typed lambda calculus.
CPE 480 Natural Language Processing Lecture 4: Syntax Adapted from Owen Rambow’s slides for CSc Fall 2006.
Rules, Movement, Ambiguity
CSA2050 Introduction to Computational Linguistics Parsing I.
1 Context Free Grammars October Syntactic Grammaticality Doesn’t depend on Having heard the sentence before The sentence being true –I saw a unicorn.
Section 11.3 Features structures in the Grammar ─ Jin Wang.
The Minimalist Program
1 LIN 1310B Introduction to Linguistics Prof: Nikolay Slavkov TA: Qinghua Tang CLASS 16, March 6, 2007.
CSE Introduction to Computational Linguistics Tuesdays, Thursdays 14:30-16:00 – South Ross 101 Fall Semester, 2011 Instructor: Nick Cercone
 2003 CSLI Publications Ling 566 Oct 20, 2015 How the Grammar Works.
CPSC 422, Lecture 27Slide 1 Intelligent Systems (AI-2) Computer Science cpsc422, Lecture 27 Nov, 16, 2015.
Levels of Linguistic Analysis
◦ Process of describing the structure of phrases and sentences Chapter 8 - Phrases and sentences: grammar1.
Click to edit Master title style Instructor: Nick Cercone CSEB - CSE Introduction to Computational Linguistics Tuesdays,
SIMS 296a-4 Text Data Mining Marti Hearst UC Berkeley SIMS.
 2003 CSLI Publications Ling 566 Oct 17, 2011 How the Grammar Works.
Instructor: Nick Cercone CSEB - 1 Parsing and Context Free Grammars Parsers, Top Down, Bottom Up, Left Corner, Earley.
Language and Cognition Colombo, June 2011 Day 2 Introduction to Linguistic Theory, Part 3.
3.3 A More Detailed Look At Transformations Inversion (revised): Move Infl to C. Do Insertion: Insert interrogative do into an empty.
LECT. 11 DR. AMAL ALSAIKHAN Government and Case Theories.
King Faisal University جامعة الملك فيصل Deanship of E-Learning and Distance Education عمادة التعلم الإلكتروني والتعليم عن بعد [ ] 1 King Faisal University.
Natural Language Processing Vasile Rus
Lecture 6: More On Wh-movement
An Introduction to the Government and Binding Theory
Instructor: Nick Cercone CSEB -
Statistical NLP: Lecture 3
Syntax Lecture 1: X-bar Theory.
Part I: Basics and Constituency
Structural relations Carnie 2013, chapter 4 Kofi K. Saah.
Instructor: Nick Cercone CSEB -
Probabilistic and Lexicalized Parsing
CSCI 5832 Natural Language Processing
Introduction to Computational Linguistics
Lecture 7: Introduction to Parsing (Syntax Analysis)
X-bar Schema Linguistics lecture series
Ling 566 Oct 14, 2008 How the Grammar Works.
CSA2050 Introduction to Computational Linguistics
Presentation transcript:

CSE Introduction to Computational Linguistics Tuesdays, Thursdays 14:30-16:00 – South Ross 101 Fall Semester, 2011 Instructor: Nick Cercone CSEB - HPSGs How its done, Examples, Examples, Examples

CSE Introduction to Computational Linguistics Tuesdays, Thursdays 14:30-16:00 – South Ross 101 Fall Semester, 2011 Instructor: Nick Cercone CSEB - HPSG Feature Structure Descriptions – recall for pizza’s

CSE Introduction to Computational Linguistics Tuesdays, Thursdays 14:30-16:00 – South Ross 101 Fall Semester, 2011 Instructor: Nick Cercone CSEB - Head Driven Phrase Structure Grammars (HPSGs)

CSE Introduction to Computational Linguistics Tuesdays, Thursdays 14:30-16:00 – South Ross 101 Fall Semester, 2011 Instructor: Nick Cercone CSEB - Head Driven Phrase Structure Grammars (HPSGs) A type hierarchy states what kinds of objects we claim exist (the types)... organizes the objects hierarchically into classes with shared properties (the type hierarchy)... states what general properties each kind of object has (the feature and feature value declarations).

CSE Introduction to Computational Linguistics Tuesdays, Thursdays 14:30-16:00 – South Ross 101 Fall Semester, 2011 Instructor: Nick Cercone CSEB - Head Driven Phrase Structure Grammars (HPSGs) Pizza Descriptions and Pizza Models How many pizza models (by definition, fully resolved) satisfy this description?

CSE Introduction to Computational Linguistics Tuesdays, Thursdays 14:30-16:00 – South Ross 101 Fall Semester, 2011 Instructor: Nick Cercone CSEB - Head Driven Phrase Structure Grammars (HPSGs) Answer: 2 {, <TOPPINGS, { <OLIVES, + >,, }>} {, <TOPPINGS, { <OLIVES, + >,, }>}

CSE Introduction to Computational Linguistics Tuesdays, Thursdays 14:30-16:00 – South Ross 101 Fall Semester, 2011 Instructor: Nick Cercone CSEB - Head Driven Phrase Structure Grammars (HPSGs) Pizza Descriptions and Pizza Models How many pizzas-in-the-world do the pizza models correspond to? Answer: A large, constantly-changing number.

CSE Introduction to Computational Linguistics Tuesdays, Thursdays 14:30-16:00 – South Ross 101 Fall Semester, 2011 Instructor: Nick Cercone CSEB - Head Driven Phrase Structure Grammars (HPSGs) ‘type’/‘token’ distinction applies to sentences as well

CSE Introduction to Computational Linguistics Tuesdays, Thursdays 14:30-16:00 – South Ross 101 Fall Semester, 2011 Instructor: Nick Cercone CSEB - Head Driven Phrase Structure Grammars (HPSGs) Combining Constraints

CSE Introduction to Computational Linguistics Tuesdays, Thursdays 14:30-16:00 – South Ross 101 Fall Semester, 2011 Instructor: Nick Cercone CSEB - Head Driven Phrase Structure Grammars (HPSGs) Combining Constraints

CSE Introduction to Computational Linguistics Tuesdays, Thursdays 14:30-16:00 – South Ross 101 Fall Semester, 2011 Instructor: Nick Cercone CSEB - Head Driven Phrase Structure Grammars (HPSGs) Combining Constraints

CSE Introduction to Computational Linguistics Tuesdays, Thursdays 14:30-16:00 – South Ross 101 Fall Semester, 2011 Instructor: Nick Cercone CSEB - Head Driven Phrase Structure Grammars (HPSGs) Combining Constraints

CSE Introduction to Computational Linguistics Tuesdays, Thursdays 14:30-16:00 – South Ross 101 Fall Semester, 2011 Instructor: Nick Cercone CSEB - Head Driven Phrase Structure Grammars (HPSGs) Combining Constraints

CSE Introduction to Computational Linguistics Tuesdays, Thursdays 14:30-16:00 – South Ross 101 Fall Semester, 2011 Instructor: Nick Cercone CSEB - Head Driven Phrase Structure Grammars (HPSGs) A new theory of pizzas

CSE Introduction to Computational Linguistics Tuesdays, Thursdays 14:30-16:00 – South Ross 101 Fall Semester, 2011 Instructor: Nick Cercone CSEB - Head Driven Phrase Structure Grammars (HPSGs) Combining Constraints

CSE Introduction to Computational Linguistics Tuesdays, Thursdays 14:30-16:00 – South Ross 101 Fall Semester, 2011 Instructor: Nick Cercone CSEB - Head Driven Phrase Structure Grammars (HPSGs) Identity Constraints (tags)

CSE Introduction to Computational Linguistics Tuesdays, Thursdays 14:30-16:00 – South Ross 101 Fall Semester, 2011 Instructor: Nick Cercone CSEB - Head Driven Phrase Structure Grammars (HPSGs) Combining Constraints

CSE Introduction to Computational Linguistics Tuesdays, Thursdays 14:30-16:00 – South Ross 101 Fall Semester, 2011 Instructor: Nick Cercone CSEB - Head Driven Phrase Structure Grammars (HPSGs) Note

CSE Introduction to Computational Linguistics Tuesdays, Thursdays 14:30-16:00 – South Ross 101 Fall Semester, 2011 Instructor: Nick Cercone CSEB - Head Driven Phrase Structure Grammars (HPSGs) Combining Constraints

CSE Introduction to Computational Linguistics Tuesdays, Thursdays 14:30-16:00 – South Ross 101 Fall Semester, 2011 Instructor: Nick Cercone CSEB - Head Driven Phrase Structure Grammars (HPSGs) Why combine constraints? The pizza example illustrates how unification can be used to combine information from different sources. In our grammar, information will come from lexical entries, grammar rules, and general principles.

CSE Introduction to Computational Linguistics Tuesdays, Thursdays 14:30-16:00 – South Ross 101 Fall Semester, 2011 Instructor: Nick Cercone CSEB - Head Driven Phrase Structure Grammars (HPSGs) Linguistic Application of Feature Structures: Making the Mnemonic Meaningful What do these CFG categories have in common? NP & VP: are both phrases N & V: are both words NP & N: are both ‘nouny’ VP & V: are both ‘verby’

CSE Introduction to Computational Linguistics Tuesdays, Thursdays 14:30-16:00 – South Ross 101 Fall Semester, 2011 Instructor: Nick Cercone CSEB - Head Driven Phrase Structure Grammars (HPSGs) The Beginnings of our type hierarchy

CSE Introduction to Computational Linguistics Tuesdays, Thursdays 14:30-16:00 – South Ross 101 Fall Semester, 2011 Instructor: Nick Cercone CSEB - Head Driven Phrase Structure Grammars (HPSGs) A Feature for Part of Speech

CSE Introduction to Computational Linguistics Tuesdays, Thursdays 14:30-16:00 – South Ross 101 Fall Semester, 2011 Instructor: Nick Cercone CSEB - Head Driven Phrase Structure Grammars (HPSGs) Type Hierarchy for Parts of Speech I

CSE Introduction to Computational Linguistics Tuesdays, Thursdays 14:30-16:00 – South Ross 101 Fall Semester, 2011 Instructor: Nick Cercone CSEB - Head Driven Phrase Structure Grammars (HPSGs) Type Hierarchy for Parts of Speech II

CSE Introduction to Computational Linguistics Tuesdays, Thursdays 14:30-16:00 – South Ross 101 Fall Semester, 2011 Instructor: Nick Cercone CSEB - Head Driven Phrase Structure Grammars (HPSGs) A Feature for Valence

CSE Introduction to Computational Linguistics Tuesdays, Thursdays 14:30-16:00 – South Ross 101 Fall Semester, 2011 Instructor: Nick Cercone CSEB - Head Driven Phrase Structure Grammars (HPSGs) Underspecification

CSE Introduction to Computational Linguistics Tuesdays, Thursdays 14:30-16:00 – South Ross 101 Fall Semester, 2011 Instructor: Nick Cercone CSEB - Head Driven Phrase Structure Grammars (HPSGs) Another Valence Feature

CSE Introduction to Computational Linguistics Tuesdays, Thursdays 14:30-16:00 – South Ross 101 Fall Semester, 2011 Instructor: Nick Cercone CSEB - Head Driven Phrase Structure Grammars (HPSGs) SPR and Verbs

CSE Introduction to Computational Linguistics Tuesdays, Thursdays 14:30-16:00 – South Ross 101 Fall Semester, 2011 Instructor: Nick Cercone CSEB - Head Driven Phrase Structure Grammars (HPSGs) S and NP We created a monster our creation of a monster

CSE Introduction to Computational Linguistics Tuesdays, Thursdays 14:30-16:00 – South Ross 101 Fall Semester, 2011 Instructor: Nick Cercone CSEB - Head Driven Phrase Structure Grammars (HPSGs) Type Hierarchy So Far

CSE Introduction to Computational Linguistics Tuesdays, Thursdays 14:30-16:00 – South Ross 101 Fall Semester, 2011 Instructor: Nick Cercone CSEB - Head Driven Phrase Structure Grammars (HPSGs) Reformulating Grammar Rules 1 Which rules do these correspond to?

CSE Introduction to Computational Linguistics Tuesdays, Thursdays 14:30-16:00 – South Ross 101 Fall Semester, 2011 Instructor: Nick Cercone CSEB - Head Driven Phrase Structure Grammars (HPSGs) Reformulating Grammar Rules 2

CSE Introduction to Computational Linguistics Tuesdays, Thursdays 14:30-16:00 – South Ross 101 Fall Semester, 2011 Instructor: Nick Cercone CSEB - Head Driven Phrase Structure Grammars (HPSGs) Reformulating the Grammar Rules 3

CSE Introduction to Computational Linguistics Tuesdays, Thursdays 14:30-16:00 – South Ross 101 Fall Semester, 2011 Instructor: Nick Cercone CSEB - Head Driven Phrase Structure Grammars (HPSGs) Advantages of the New Formulation Subject-verb agreement is stipulated only once (where?) Common properties of verbs with different valences are expressed by common features Parallelisms across phrase types are captured

CSE Introduction to Computational Linguistics Tuesdays, Thursdays 14:30-16:00 – South Ross 101 Fall Semester, 2011 Instructor: Nick Cercone CSEB - Head Driven Phrase Structure Grammars (HPSGs) Disadvantages of the New Formulation We still have three head complement rules We still have two head specifier rules We only deal with three verb valences (which ones? what are some others?) The non-branching rule does not really account for any empirical work Others?

CSE Introduction to Computational Linguistics Tuesdays, Thursdays 14:30-16:00 – South Ross 101 Fall Semester, 2011 Instructor: Nick Cercone CSEB - Head Driven Phrase Structure Grammars (HPSGs) Heads Intuitive idea: A phrase typically contains a word that determines its most essential properties, including – where it occurs in larger phrases, and – what is its internal structure This is called the head The term “head” is used both for the head word in a phrase and for all the intermediate phrases containing that word NB: Not all phrases have heads

CSE Introduction to Computational Linguistics Tuesdays, Thursdays 14:30-16:00 – South Ross 101 Fall Semester, 2011 Instructor: Nick Cercone CSEB - Head Driven Phrase Structure Grammars (HPSGs) Formalizing the Notion of Head Expressions have a feature HEAD HEAD’s values are of type pos For HEAD values of type agr-cat, HEAD’s value also includes the feature AGR Well-formed trees are subject to the Head Feature Principle

CSE Introduction to Computational Linguistics Tuesdays, Thursdays 14:30-16:00 – South Ross 101 Fall Semester, 2011 Instructor: Nick Cercone CSEB - Head Driven Phrase Structure Grammars (HPSGs) The Head Feature Principle Intuitive idea: Key properties of phrases are shared with their heads The HFP: In any headed phrase, the HEAD value of the mother and the head daughter must be identical. Sometimes described in terms of properties “percolating up” or “filtering down”, but this is just metaphorical talk

CSE Introduction to Computational Linguistics Tuesdays, Thursdays 14:30-16:00 – South Ross 101 Fall Semester, 2011 Instructor: Nick Cercone CSEB - Head Driven Phrase Structure Grammars (HPSGs) A Tree is Well-Formed if … It and each subtree are licensed by a grammar rule or lexical entry All general principles (like the HFP) are satisfied. NB: Trees are part of our model of the language, so all their features have values (even though we will often be lazy and leave out the values irrelevant to our current point).

CSE Introduction to Computational Linguistics Tuesdays, Thursdays 14:30-16:00 – South Ross 101 Fall Semester, 2011 Instructor: Nick Cercone CSEB - Head Driven Phrase Structure Grammars (HPSGs) Question: Do phrases that are not headed have HEAD features?

CSE Introduction to Computational Linguistics Tuesdays, Thursdays 14:30-16:00 – South Ross 101 Fall Semester, 2011 Instructor: Nick Cercone CSEB - Head Driven Phrase Structure Grammars (HPSGs)

CSE Introduction to Computational Linguistics Tuesdays, Thursdays 14:30-16:00 – South Ross 101 Fall Semester, 2011 Instructor: Nick Cercone CSEB - Head Driven Phrase Structure Grammars (HPSGs)

CSE Introduction to Computational Linguistics Tuesdays, Thursdays 14:30-16:00 – South Ross 101 Fall Semester, 2011 Instructor: Nick Cercone CSEB - Head Driven Phrase Structure Grammars (HPSGs) Reminder: Where We Are Attempting to model English with CFG led to problems with the granularity of categories, e.g. – Need to distinguish various subtypes of verbs – Need to identify properties common to all verbs So we broke categories down into feature structures and began constructing a hierarchy of types of feature structures. This allows us to schematize rules and state crosscategorial generalizations, while still making fine distinctions.

CSE Introduction to Computational Linguistics Tuesdays, Thursdays 14:30-16:00 – South Ross 101 Fall Semester, 2011 Instructor: Nick Cercone CSEB - Head Driven Phrase Structure Grammars (HPSGs) But it’s still not quite right… There’s still too much redundancy in the rules. The rules and features encode the same information in different ways.

CSE Introduction to Computational Linguistics Tuesdays, Thursdays 14:30-16:00 – South Ross 101 Fall Semester, 2011 Instructor: Nick Cercone CSEB - Head Driven Phrase Structure Grammars (HPSGs) Solution: More Elaborate Valence Feature Values The rules just say that heads combine with whatever their lexical entries say they can (or must) combine with. The information about what a word can or must combine with is encoded in list-valued valence features. – The elements of the lists are themselves feature structures – The elements are “cancelled” off the lists once heads combine with their complements and specifiers.

CSE Introduction to Computational Linguistics Tuesdays, Thursdays 14:30-16:00 – South Ross 101 Fall Semester, 2011 Instructor: Nick Cercone CSEB - Head Driven Phrase Structure Grammars (HPSGs) Complements This allows for arbitrary numbers of complements, but only applies when there is at least one. – Heads in English probably never have more than 3 or 4 complements – This doesn’t apply where Head-Complement Rule 1 would. This covers lots of cases not covered by the old Head- Complement Rules 1-3.

CSE Introduction to Computational Linguistics Tuesdays, Thursdays 14:30-16:00 – South Ross 101 Fall Semester, 2011 Instructor: Nick Cercone CSEB - Head Driven Phrase Structure Grammars (HPSGs) Question: What would the grammar change if English had postpositions instead of prepositions?

CSE Introduction to Computational Linguistics Tuesdays, Thursdays 14:30-16:00 – South Ross 101 Fall Semester, 2011 Instructor: Nick Cercone CSEB - Head Driven Phrase Structure Grammars (HPSGs) Specifiers - Head Specifier Rule (version 1) Combines the rules expanding S and NP. In principle also generalizes to other categories. Question: Why is SPR list-valued?

CSE Introduction to Computational Linguistics Tuesdays, Thursdays 14:30-16:00 – South Ross 101 Fall Semester, 2011 Instructor: Nick Cercone CSEB - Head Driven Phrase Structure Grammars (HPSGs) QUESTION: Why are these rightbranching? That is, what formal property of our grammar forces the COMPS to be lower inthe tree than the SPR?

CSE Introduction to Computational Linguistics Tuesdays, Thursdays 14:30-16:00 – South Ross 101 Fall Semester, 2011 Instructor: Nick Cercone CSEB - Head Driven Phrase Structure Grammars (HPSGs) Another Question… What determines the VAL value of phrasal nodes? ANSWER: The Valence Principle Unless the rule says otherwise, the mother’s values for the VAL features (SPR and COMPS) are identical to those of the head daughter.

CSE Introduction to Computational Linguistics Tuesdays, Thursdays 14:30-16:00 – South Ross 101 Fall Semester, 2011 Instructor: Nick Cercone CSEB - Head Driven Phrase Structure Grammars (HPSGs) More on the Valence Principle Intuitively, the VAL features list the contextual requirements that haven’t yet been found. This way of thinking about it (like talk of “cancellation”) is bottom-up and procedural. But formally, the Valence Principle (like the rest of our grammar) is just a well-formedness constraint on trees, without inherent directionality

CSE Introduction to Computational Linguistics Tuesdays, Thursdays 14:30-16:00 – South Ross 101 Fall Semester, 2011 Instructor: Nick Cercone CSEB - Head Driven Phrase Structure Grammars (HPSGs) So far, we have: Replaced atomic-valued VAL features with list- valued ones. Generalized Head-Complement and Head- Specifier rules, to say that heads combine with whatever their lexical entries say they should combine with. Introduced the Valence Principle to “cancel” things off the COMPS and SPR lists.

CSE Introduction to Computational Linguistics Tuesdays, Thursdays 14:30-16:00 – South Ross 101 Fall Semester, 2011 Instructor: Nick Cercone CSEB - Head Driven Phrase Structure Grammars (HPSGs) The Parallelism between S and NP Motivation: – pairs like Chris lectured about syntax and Chris’s lecture about syntax. – both S and NP exhibit agreement The bird sings/*sing vs. The birds sing/*sings this/*these bird vs. these/*this birds So we treat NP as the saturated category of type noun and S as the saturated category of type verb.

CSE Introduction to Computational Linguistics Tuesdays, Thursdays 14:30-16:00 – South Ross 101 Fall Semester, 2011 Instructor: Nick Cercone CSEB - Head Driven Phrase Structure Grammars (HPSGs) Question: Is there any other reason to treat V as the head of S? In standard English, sentences must have verbs. (How about non-standard English or other languages?) Verbs taking S complements can influence the form of the verb in the complement: I insist/*recall (that) you be here on time. Making V the head of S helps us state such restrictions formally

CSE Introduction to Computational Linguistics Tuesdays, Thursdays 14:30-16:00 – South Ross 101 Fall Semester, 2011 Instructor: Nick Cercone CSEB - Concluding Remarks NAÏVE Naive you are if you believe life favours those who aren't naive.