1 Features and Augmented Grammars Allen ’ s Chapter 4 J&M ’ s Chapter 11.

Slides:



Advertisements
Similar presentations
 Christel Kemke 2007/08 COMP 4060 Natural Language Processing Feature Structures and Unification.
Advertisements

Feature Structures and Parsing Unification Grammars Algorithms for NLP 18 November 2014.
Lexical Functional Grammar : Grammar Formalisms Spring Term 2004.
1 Unification Grammars Allen ’ s Chapter 4 J&M ’ s Chapter 11.
BİL711 Natural Language Processing1 Problems with CFGs We know that CFGs cannot handle certain things which are available in natural languages. In particular,
1 Natural Language Processing Lecture 7 Unification Grammars Reading: James Allen NLU (Chapter 4)
Grammars, constituency and order A grammar describes the legal strings of a language in terms of constituency and order. For example, a grammar for a fragment.
1 Chapter Chapter 5 Grammars for Natural Language 5.1 Auxiliary Verbs and Verb Phrases 5.2 Movement Phenomena in Language 5.3 Handling Questions in Context-Free.
For Monday Read Chapter 23, sections 3-4 Homework –Chapter 23, exercises 1, 6, 14, 19 –Do them in order. Do NOT read ahead.
1 Auxiliary Verbs and Movement Phenomena Allen ’ s Chapter 5 J&M ’ s Chapter 11.
Natural Language Processing - Feature Structures - Feature Structures and Unification.
 Christel Kemke 2007/08 COMP 4060 Natural Language Processing Feature Structures and Unification.
NLP and Speech Course Review. Morphological Analyzer Lexicon Part-of-Speech (POS) Tagging Grammar Rules Parser thethe – determiner Det NP → Det.
COMP 4060 Natural Language Processing Using Features.
NLP and Speech 2004 Feature Structures Feature Structures and Unification.
Features & Unification Ling 571 Deep Processing Techniques for NLP January 26, 2011.
Features & Unification Ling 571 Deep Processing Techniques for NLP January 31, 2011.
Parsing: Features & ATN & Prolog By
Syllabus Text Books Classes Reading Material Assignments Grades Links Forum Text Books עיבוד שפות טבעיות - שיעור עשר Chart Parsing (cont) Features.
Amirkabir University of Technology Computer Engineering Faculty AILAB Efficient Parsing Ahmad Abdollahzadeh Barfouroush Aban 1381 Natural Language Processing.
Sag et al., Chapter 4 Complex Feature Values 10/7/04 Michael Mulyar.
Artificial Intelligence 2005/06 From Syntax to Semantics.
Matakuliah: G0922/Introduction to Linguistics Tahun: 2008 Session 11 Syntax 2.
Artificial Intelligence 2005/06 Features, Gaps, Movement Questions and Passives.
 Christel Kemke 2007/08 COMP 4060 Natural Language Processing Feature Structures and Unification.
Features and Unification
Natural Language Processing Features Passives Questions Gaps Movement.
Computational Grammars Azadeh Maghsoodi. History Before First 20s 20s World War II Last 1950s Nowadays.
Natural Language Processing
CS 4705 Lecture 11 Feature Structures and Unification Parsing.
Features and Unification Read J & M Chapter 11.. Solving the Agreement Problem Number agreement: S  NP VP * Mary walk. [NP NUMBER] [VP NUMBER] NP  det.
Syllabus Text Books Classes Reading Material Assignments Grades Links Forum Text Books עיבוד שפות טבעיות - שיעור תשע Bottom Up Parsing עידו דגן.
11 CS 388: Natural Language Processing: Syntactic Parsing Raymond J. Mooney University of Texas at Austin.
LING/C SC/PSYC 438/538 Lecture 19 Sandiway Fong 1.
1 Semantics Interpretation Allen ’ s Chapter 9 J&M ’ s Chapter 15.
1 Features and Unification Chapter 15 October 2012 Lecture #10.
1.Syntax: the rules of sentence formation; the component of the mental grammar that represent speakers’ knowledge of the structure of phrase and sentence.
1 CPE 480 Natural Language Processing Lecture 5: Parser Asst. Prof. Nuttanart Facundes, Ph.D.
CS 4705 Parsing More Efficiently and Accurately. Review Top-Down vs. Bottom-Up Parsers Left-corner table provides more efficient look- ahead Left recursion.
For Friday Finish chapter 23 Homework: –Chapter 22, exercise 9.
Chapter 16: Features and Unification Heshaam Faili University of Tehran.
1 Natural Language Processing Lecture 11 Efficient Parsing Reading: James Allen NLU (Chapter 6)
1 Natural Language Processing Lecture Notes 11 Chapter 15 (part 1)
May 2006CLINT-LN Parsing1 Computational Linguistics Introduction Parsing with Context Free Grammars.
Chapter 4: Syntax Part V.
Notes on Pinker ch.7 Grammar, parsing, meaning. What is a grammar? A grammar is a code or function that is a database specifying what kind of sounds correspond.
Lecture 1, 7/21/2005Natural Language Processing1 CS60057 Speech &Natural Language Processing Autumn 2007 Lecture August 2007.
For Wednesday Read chapter 23 Homework: –Chapter 22, exercises 1,4, 7, and 14.
1 Chart Parsing Allen ’ s Chapter 3 J & M ’ s Chapter 10.
The man bites the dog man bites the dog bites the dog the dog dog Parse Tree NP A N the man bites the dog V N NP S VP A 1. Sentence  noun-phrase verb-phrase.
Section 11.3 Features structures in the Grammar ─ Jin Wang.
Making it stick together…
Artificial Intelligence 2004
1 Recursive Transition Networks Allen ’ s Chapters 3 J&M ’ s Chapter 10.
1 Natural Language Processing Lectures 8-9 Auxiliary Verbs Movement Phenomena Reading: James Allen NLU (Chapter 5)
CPSC 422, Lecture 27Slide 1 Intelligent Systems (AI-2) Computer Science cpsc422, Lecture 27 Nov, 16, 2015.
1 Introduction to Computational Linguistics Eleni Miltsakaki AUTH Spring 2006-Lecture 2.
1 Natural Language Processing Lecture 6 Features and Augmented Grammars Reading: James Allen NLU (Chapter 4)
◦ Process of describing the structure of phrases and sentences Chapter 8 - Phrases and sentences: grammar1.
NLP. Introduction to NLP (U)nderstanding and (G)eneration Language Computer (U) Language (G)
3.3 A More Detailed Look At Transformations Inversion (revised): Move Infl to C. Do Insertion: Insert interrogative do into an empty.
The final chapter.  Constituents ◦ Natural groupings of a sentence  Morphemes ◦ Smallest meaningful units of a word  How to test whether a group of.
Chapter 11: Parsing with Unification Grammars Heshaam Faili University of Tehran.
10/31/00 1 Introduction to Cognitive Science Linguistics Component Topic: Formal Grammars: Generating and Parsing Lecturer: Dr Bodomo.
Natural Language Processing Vasile Rus
Syntax Word order, constituency
CKY Parser 0Book 1 the 2 flight 3 through 4 Houston5 11/16/2018
Natural Language - General
CSCI 5832 Natural Language Processing
CPSC 503 Computational Linguistics
Presentation transcript:

1 Features and Augmented Grammars Allen ’ s Chapter 4 J&M ’ s Chapter 11

2 Augmenting CFGs with Features Certain linguistic constraints are not naturally described via CFGs Example: Number Agreement between constituents - “a boys” Possible to describe using refined CF rules: NP-Sing --> ART-Sing N-Sing NP-Plural --> ART-Plural N-Plural Much more natural to describe via a single feature Number in an augmented CF rule: NP --> ART N (only when Number 1 = Number 2 )

3 Feature Structures Constituents can be viewed as feature structures that map values to features Features can be shared between constituents Some basic features for English: – Number, Gender and Person agreement – Verb form features and sub-categorizations Complex Feature Structures: Feature values can themselves be feature structures

4 An Example ART1: (CAT ART ROOT a NUMBER s) Represents a particular use of word a Often summarized as: ART1: (ART ROOT a NUMBER s)

5 Larger constituents: Representing an NP constituent for the phrase a fish NP1: (NP NUMBER s 1 (ART ROOT a NUMBER s) 2 (N ROOT fish NUMBER s))

6 Feature Structure

7 Augmented Rules (NP NUMBER ?n)  (ART NUMBER ?n) (N NUMBER ?n) *(NP 1 (ART NUMBER s) 2 (N NUMBER s)) *(NP NUMBER s 1 (ART NUMBER s) 2 (N NUMBER p))

8 Using Variables to Express ambiguities (N ROOT fish NUMBER ?n) (N ROOT fish NUMBER ?b {s, p}) (N ROOT fish NUMBER {s, p})

9 Basic Features in English: Number Agreement

10 Person and Number Features

11 PForm Feature

12 Verb Sub categorizations: SUBCAT Feature

13 SUBCAT Examples: (VP)  (V SUBCAT _np_vp:inf) (NP) (VP VFORM inf) (VP)  (V SUBCAT _np_pp:loc) (NP) (PP PFORM LOC)

14 Binary Features Whether the constituent does or does not have a feature INV feature has two values + and – Jack Laughed has an INV feature with value – = (-INV) Did Jack Laugh has an INV feature with value + = (+INV)

15 Morphological Analysis

16

17 Sample Grammar (Abbreviated Form)

18 Sample Grammar (Detailed Form)

19 Parsing with Features 1.(NP AGR ?a)   (ART AGR ?a) (N AGR ?a) 2.(ART ROOT A AGR 3s) 3.(NP AGR 3s)   (ART AGR 3s) (N AGR 3s) 4.(NP AGR 3s)  (ART AGR 3s)  (N AGR 3s) 5.(N ROOT DOG1 AGR 3s) 6.(NP AGR 3s)  (ART AGR 3s) (N AGR 3s) 

20 Parsing with Features Given an arc A, and NEXT as the constituent following , and a new constituent X, which is used to extend A 1.Find an instantiation of variables such that all features specified in NEXT are found in X. 2.Create a new arc A’, which is a copy of A except for the instantiations of the variables determined in step 1 3.Update A’ as usual in a Chart parser

21 Parse Trees with Features

22 Chart with Features