Ch.11 Features and Unification Ling 538, 2006 Fall Jiyoung Kim.

Slides:

Advertisements

Similar presentations

Feature-based Grammar Ling 571 Deep Techniques for NLP February 2, 2001.

Advertisements

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

Feature Structures and Parsing Unification Grammars Algorithms for NLP 18 November 2014.

Notes on TAG (LTAG) and Feature Structures September AKJ.

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)

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

Chapter 20: Natural Language Generation Presented by: Anastasia Gorbunova LING538: Computational Linguistics, Fall 2006 Speech and Language Processing.

Natural Language Processing - Feature Structures - Feature Structures and Unification.

1 Pertemuan 23 Syntatic Processing Matakuliah: T0264/Intelijensia Semu Tahun: 2005 Versi: 1/0.

NLP and Speech Course Review. Morphological Analyzer Lexicon Part-of-Speech (POS) Tagging Grammar Rules Parser thethe – determiner Det NP → Det.

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.

1 Pertemuan 22 Natural Language Processing Syntactic Processing Matakuliah: T0264/Intelijensia Semu Tahun: Juli 2006 Versi: 2/2.

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.

Unification algorithm We have seen examples of the use of unification. Now we will see, in detail, one way to implement a unification algorithm which implements.

Issues in Computational Linguistics: Parsing and Generation Dick Crouch and Tracy King.

CIS 630 Slides for March Schedule We missed two classes. I will try to make up in April Spring break– Week of March 8 Your presentations I would.

1 Graph Introduction Definitions. 2 Definitions I zDirected Graph (or Di-Graph) is an ordered pair G=(V,E) such that yV is a finite, non-empty set (of.

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

Features and Unification

I.1 ii.2 iii.3 iv.4 1+1=. i.1 ii.2 iii.3 iv.4 1+1=

2006 Fall MATH 100 Lecture 141 MATH 100Class 21 Line Integral independent of path.

 2003 CSLI Publications Ling 566 Oct 16, 2007 How the Grammar Works.

Unification-based algorithms We have seen that treating features, such as person-number agreement, as part of the category of a phrase results in a large.

I.1 ii.2 iii.3 iv.4 1+1=. i.1 ii.2 iii.3 iv.4 1+1=

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.

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.

Notes on TAG (LTAG) and Feature Structures Aravind K. Joshi April

Context-Free Parsing Part 2 Features and Unification.

Feature structures and unification Attributes and values.

1 Features and Unification Chapter 15 October 2012 Lecture #10.

Chapter 16: Features and Unification Heshaam Faili University of Tehran.

Fall 2004 Lecture Notes #4 EECS 595 / LING 541 / SI 661 Natural Language Processing.

PHRASE STRUCTURE GRAMMARS RTNs ATNs Augmented phrase structure rules / trees.

7. Parsing in functional unification grammar Han gi-deuc.

2007CLINT-LIN-FEATSTR1 Computational Linguistics for Linguists Feature Structures.

Head-driven Phrase Structure Grammar (HPSG)

Jan 2004CSA3050: NLG21 CSA3050: Natural Language Generation 2 Surface Realisation Systemic Grammar Functional Unification Grammar see J&M Chapter 20.3.

Section 11.3 Features structures in the Grammar ─ Jin Wang.

Math – Graphs of Functions 1. Graph of a function: the graph of all the function’s ordered pairs 2.

NLP. Introduction to NLP (U)nderstanding and (G)eneration Language Computer (U) Language (G)

Data Structures Lakshmish Ramaswamy. Tree Hierarchical data structure Several real-world systems have hierarchical concepts –Physical and biological systems.

Carnegie Mellon School of Computer Science Copyright © 2007, Carnegie Mellon. All Rights Reserved. 1 LTI Grammars and Lexicons Grammar Writing Lecture.

April 2010Semantic Grammar1 A short guide to Blackburn’s Grammar of English.

Chapter 11: Parsing with Unification Grammars Heshaam Faili University of Tehran.

II Международный творческий конкурс для педагогов "Занимательные головоломки" Ребусы для детей «Музыкальные инструменты» Составила: Овчарова О.Н. Музыкальный.

Natural Language Processing Vasile Rus

Implementing the TEI Feature System Declaration Gary F. Simons SIL International ___________________________ TEI Members Meeting 11 Oct 2002, Chicago.

Lecture – VIII Monojit Choudhury RS, CSE, IIT Kharagpur

Objective The student will be able to:

Modular HPSG Vlado Keselj presented by Lijun Hou

i. Only one word can occur at a given position

Dependency Parsing & Feature-based Parsing

OVERVIEW 1-st Midterm: 3 problems 2-nd Midterm 3 problems

Parts of Speech Mr. White English I.

Objective - To graph ordered pairs on the coordinate plane.

CPSC 503 Computational Linguistics

Ling 566 Oct 14, 2008 How the Grammar Works.

Writing Equations of Lines

Writing Equations of Lines

Example Make x the subject of the formula

Writing Equations of Lines

INTRODUCTION TO ALOGORITHM DESIGN STRATEGIES

Writing Equations of Lines Day 92

Presentation transcript:

Ch.11 Features and Unification Ling 538, 2006 Fall Jiyoung Kim

Content I. Feature Structures II. Unification of Feature Structures III. Discussion

I. Feature Structures - terms Feature Structure. Sets of feature-value pairs. Represented as - AVMs (Attribute-Value Matrix) - DAGs(Directed Acyclic Graphs) (  features can have feature structures as their values!) Feature path A list of features through a feature structure leading to a particular value Reentrant structures Shared feature structures

I. Feature Structures - ex CAT NP AGREEMENT NUMBER SG PERSON 3 AGREEMENT CAT NP NUMBER PERSON SG 3 Feature structure Feature path to SG:

I. Feature Structures - ex HEAD CAT S NUMBER PERSON SG 3 Shared Values AGREEMENT SUBJECT

II. Unification of Feature Structures - term Unification Merging the information content of two structures Rejecting the merger of structures that are incompatible - implemented as a binary operator

II. Unification of Feature Structures - ex U: Unification operator EX 1) [NUMBER SG] U [NUMBER SG] = [NUMBER SG] EX 2) [NUMBER SG] U [NUMBER PL] FAILS!

II. Unification of Feature Structures - ex EX 3) [NUMBER SG] U [PERSON 3] = NUMBER SG PERSON 3 EX 4) AGREEMENT  NUMBER SG PERSON 3 SUBJECT [AGREEMENT  ] U SUBJECT AGREEMENT PERSON 3 NUMBER SG = AGREEMENT  NUMBER SG PERSON 3 SUBJECT [AGREEMENT  ]

II. Unification of Feature Structures - ex EX 5) AGREEMENT  NUMBERSG PERSON3 SUBJECTAGREEMENT  UAGREEMENTNUMBERSG PERSON3 SUBJECTAGREEMENTNUMBERPL PERSON3 Fails!

III. Discussion [+N] Specific (Proper) HumanCount HumanWater MasAnim BoyGirlChickenSchool RoosterHen (Masc) MasLondon JohnJane Are features independent each other? (incomplete) classificatory tree - noun

III. Discussion What are the concepts? Why do we need those? –to express syntactic constraints that would be difficult to express using the mechanisms of context-free grammars only How are they implemented? –CopyDAG, Types and Inheritance,..

Thank you!