Grammar and Feature Unification

Similar documents
Unification. Two Routes to Deep Structure. Unification. Unification Grammar. Martin Kay. Stanford University University of the Saarland

Tree Adjoining Grammars

Parsing with CFGs L445 / L545 / B659. Dept. of Linguistics, Indiana University Spring Parsing with CFGs. Direction of processing

Parsing with CFGs. Direction of processing. Top-down. Bottom-up. Left-corner parsing. Chart parsing CYK. Earley 1 / 46.

1 Rules in a Feature Grammar

A DOP Model for LFG. Rens Bod and Ronald Kaplan. Kathrin Spreyer Data-Oriented Parsing, 14 June 2005

Parsing with Context-Free Grammars

HPSG: Binding Theory

Context-free grammars for natural languages

The Formal Architecture of. Lexical-Functional Grammar. Ronald M. Kaplan and Mary Dalrymple

Unification Grammars and Off-Line Parsability. Efrat Jaeger

Model-Theory of Property Grammars with Features

CS626: NLP, Speech and the Web. Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 14: Parsing Algorithms 30 th August, 2012

Artificial Intelligence

Ling 240 Lecture #15. Syntax 4

CAS LX 522 Syntax I Fall 2000 October 10, 2000 Week 5: Case Theory and θ Theory. θ-theory continued

Feature Constraint Logics. for Unication Grammars. Gert Smolka. German Research Center for Articial Intelligence and. Universitat des Saarlandes

Categorial Grammar. Larry Moss NASSLLI. Indiana University

Parsing Beyond Context-Free Grammars: Tree Adjoining Grammars

Remembering subresults (Part I): Well-formed substring tables

CS460/626 : Natural Language

Natural Language Processing : Probabilistic Context Free Grammars. Updated 5/09

Quantification: Quantifiers and the Rest of the Sentence

Semantics 2 Part 1: Relative Clauses and Variables

Ch. 2: Phrase Structure Syntactic Structure (basic concepts) A tree diagram marks constituents hierarchically

WORKSHEET. Área: ingles Periodo: 1 Fecha: 26 feb al 2 Mar. Competencia: writing and grammar comprehension. Uses of the past tenses Part I

Topics in Lexical-Functional Grammar. Ronald M. Kaplan and Mary Dalrymple. Xerox PARC. August 1995

Semantics and Generative Grammar. Quantificational DPs, Part 2: Quantificational DPs in Non-Subject Position and Pronominal Binding 1

Computational Linguistics

Compositionality and Syntactic Structure Marcus Kracht Department of Linguistics UCLA 3125 Campbell Hall 405 Hilgard Avenue Los Angeles, CA 90095

Bringing machine learning & compositional semantics together: central concepts

HPSG II: the plot thickens

Computational Linguistics. Acknowledgements. Phrase-Structure Trees. Dependency-based Parsing

Introduction to Computational Linguistics

Generalized Quantifiers Logical and Linguistic Aspects

Natural Language Processing CS Lecture 06. Razvan C. Bunescu School of Electrical Engineering and Computer Science

Unterspezifikation in der Semantik Scope Semantics in Lexicalized Tree Adjoining Grammars

CKY & Earley Parsing. Ling 571 Deep Processing Techniques for NLP January 13, 2016

Proseminar on Semantic Theory Fall 2010 Ling 720. Remko Scha (1981/1984): Distributive, Collective and Cumulative Quantification

Parsing with Context-Free Grammars

What is a natural syntactic model for frame-semantic composition?

SEMANTICS OF POSSESSIVE DETERMINERS STANLEY PETERS DAG WESTERSTÅHL

Computational Models - Lecture 4 1

Maschinelle Sprachverarbeitung

Maschinelle Sprachverarbeitung

Suppose h maps number and variables to ɛ, and opening parenthesis to 0 and closing parenthesis

Lecture III CONTEXT FREE LANGUAGES

Sharpening the empirical claims of generative syntax through formalization

S NP VP 0.9 S VP 0.1 VP V NP 0.5 VP V 0.1 VP V PP 0.1 NP NP NP 0.1 NP NP PP 0.2 NP N 0.7 PP P NP 1.0 VP NP PP 1.0. N people 0.

Introduction to Probablistic Natural Language Processing

Features of Statistical Parsers

Constituency. Doug Arnold

Ling 5801: Lecture Notes 7 From Programs to Context-Free Grammars

Alessandro Mazzei MASTER DI SCIENZE COGNITIVE GENOVA 2005

CMPT-825 Natural Language Processing. Why are parsing algorithms important?

CS460/626 : Natural Language Processing/Speech, NLP and the Web

Sharpening the empirical claims of generative syntax through formalization

13A. Computational Linguistics. 13A. Log-Likelihood Dependency Parsing. CSC 2501 / 485 Fall 2017

Another look at PSRs: Intermediate Structure. Starting X-bar theory

What we have done so far

Topics in LFG: Issues in NP Coordination. Louisa 4.332

The Complexity of First-Order Extensible Dependency Grammar

Parsing. Probabilistic CFG (PCFG) Laura Kallmeyer. Winter 2017/18. Heinrich-Heine-Universität Düsseldorf 1 / 22

1. Background. Task: Determine whether a given string of words is a grammatical (well-formed) sentence of language L i or not.

2 A not-quite-argument for X-bar structure in noun phrases

Computationele grammatica

CS 712: Topics in NLP Linguistic Phrases and Statistical Phrases

Moreno Mitrović. The Saarland Lectures on Formal Semantics

Semantics and Generative Grammar. Pronouns and Variable Assignments 1. We ve seen that implicatures are crucially related to context.

Computational Models - Lecture 4 1

Andrew Carnie, Structural Relations. The mathematical properties of phrase structure trees

Sharpening the empirical claims of generative syntax through formalization

Natural Language Processing

A* Search. 1 Dijkstra Shortest Path

Parsing. Based on presentations from Chris Manning s course on Statistical Parsing (Stanford)

Probabilistic Context-Free Grammars. Michael Collins, Columbia University

phrase phrase phrase is added to (0; 1). On the basis of item 8 in (1; 2) and item 9 in (2; 3), the following edge is phrase head CASE : acc

CS 6120/CS4120: Natural Language Processing

STRUCTURAL NON-CORRESPONDENCE IN TRANSLATION

Dependency grammar. Recurrent neural networks. Transition-based neural parsing. Word representations. Informs Models

Two-phase Implementation of Morphological Analysis

Surface Reasoning Lecture 2: Logic and Grammar

DT2118 Speech and Speaker Recognition

Advanced Natural Language Processing Syntactic Parsing

LECTURER: BURCU CAN Spring

Baye s theorem. Baye s Theorem Let E and F be two possible events of an experiment, then P (F ) P (E F ) P (F ) P (E F ) + P (F ) P (E F ).

This lecture covers Chapter 5 of HMU: Context-free Grammars

Semantics and Generative Grammar. Quantificational DPs, Part 3: Covert Movement vs. Type Shifting 1

Probabilistic Context Free Grammars

Einführung in die Computerlinguistik

Ling 98a: The Meaning of Negation (Week 5)

3.8.1 Sum Individuals and Discourse Referents for Sum Individuals

Movement-Generalized Minimalist Grammars

Computational Models - Lecture 4

X-bar theory. X-bar :

Grundlagenmodul Semantik All Exercises

Uniformity of Theta- Assignment Hypothesis. Transit i ve s. Unaccusatives. Unergatives. Double object constructions. Previously... Bill lied.

(7) a. [ PP to John], Mary gave the book t [PP]. b. [ VP fix the car], I wonder whether she will t [VP].

A Computational Approach to Minimalism

CoTAGs and ACGs. Gregory M. Kobele 1 and Jens Michaelis 2

Transcription:

Grammar and Feature Unification

Problems with CF Phrase Structure Grammars Difficult to capture dependencies between constituents the boy runs the boys run * the boy run * the boys runs

Problems with CF Phrase Structure Grammars Difficult to capture dependencies between constituents the boy opens the door *?? the boy opens the boy hops *?? the boy hops the table

CF Solution exploding the number of rules is one way to provide a solution S NPsing VPsing S NPplural VPplural NP NPsing NP NPplural NPsing Detsing Nsing NPplural Detplural Nplural VPsing Vintsing VPplural Vintplural VPsing Vtrsing NP VPplural Vtrplural NP grammar Detsing {a, this, the} Detplural {some, these, the} Nsing {boy, girl, } Nplural {boys, girls, } Vintsing {hops, } Vintplural {hop, } Vtrsing {opens, } Vtrplural {open, } lexicon

A better solution What we really want to say is that some constituents share properties The boy runs the Subject and the Verb agree in number i.e., they share the same value for their number feature

Phrase structure rules with features S NP VP +singular +singular VP +singular V (NP) +singular

Phrase structure rules with features S NP VP +plural +plural VP +plural V (NP) +plural

grammar, phonology, Features Feature structures Attribute-value matrices (AVMs) +singular [number: singular] +ing-form [verb: ing-form] +masc +sing gender: masc number: sing Feature structures Unification Compatibility Information

Phrase structure rules with features S NP VP +singular +singular VP +singular V (NP) +singular

Phrase structure rules with features S NP VP [ number: sing ] [ number: sing] VP [ number: sing] V (NP) [ number: sing ]

Phrase structure rules with features S NP VP [ number: pl ] [ number: pl] VP [ number: pl] V (NP) [ number: pl ]

Phrase structure rules with features S NP VP [ number: sing ] [ number: sing] VP [ number: sing] V (NP) [ number: sing ]

Phrase structure rules with features S NP VP [ number: pl ] [ number: pl] VP [ number: pl] V (NP) [ number: pl ]

Generalised Rules S NP VP [ number: x ] [ number: x] VP [ number: x] V (NP) [ number: x ]

Example Grammar Parameter start symbol is S Rule {Satz} S -> NP VP. Rule Rule {NP-Name} NP -> Name. {NP} NP -> Det N. PATR-formalism Rule Rule Rule Rule Rule Rule {VP intransitiv} VP -> Vi. {VP transitiv} VP -> Vt NP. {VP transitiv mit PP} VP -> Vt NP PP. {VP ditransitiv} VP -> Vt2 NP NP. {VP mit PP-Objekt} VP -> Vpo PP. {einfache PP} PP -> P NP.

Example Lexicon \w cried \c Vi \w saw \c Vt \w gave \c Vt2 \w girl \w student \w book \w w the \c c Det \w w a \c c Det \w w in \c c P \w w on \c c P PATR-formalism f03b.grm f02.lex

Example Lexicon (with features) \w cried \c Vi \w saw \c Vt \w gave \c Vt2 \w sings \c Vi \f 3sg \w girl \f sg \w student \f sg \w book \f sg \w girls \f pl \w students \f pl \w w the \c c Det \w w a \c c Det \w w in \c c P \w w on \c c P

Example Lexicon (with features) \w cried \c Vi \w saw \c Vt \w gave \c Vt2 \w sings \c Vi \f 3sg \w girl \f sg \w student \f sg \w book \f sg \w girls \f pl \w w the \c c Det \w w a \c c Det \w w in \c c P \w w on \c c P [num: sg]. Let sg be [num: sg pers: : 3]. [num: sg]. Let 3sg be sg [pers:: 3]. \w students \f pl

Example Lexicon (with features) \w cried \c Vi \w saw \c Vt \w gave \c Vt2 \w sings \c Vi \f 3sg \w girl \f sg \w student \f sg \w book \f sg \w girls \f pl \w w the \c c Det \w w a \c c Det \w w in \c c P \w w on \c c P [lex:: student] [cat: N ]. [lex:: sings] [cat: V ]. \w students \f pl

Generalised Rules S NP VP [ number: x ] [ number: x] VP [ number: x] V (NP) [ number: x ]

Feature Representation Syntactic tree becomes a more complex structure Each node in the tree is in fact a bundle of features Particular rules (specified in the grammar) specify what conditions hold on the feature structures Usually: local i.e., conditions hold over a dominating node and its children

Generalised Rules (PATR formalism) S NP VP <NP number> = <VP number> VP V (NP) <VP number> = <V number> Grammar = {PS-rules + path equations}

Feature Geometries Much of modern linguistics is now to do with bundles of features and how these are distributed around syntactic structures Some special kinds of features flow along the `backbone provided by the tree structures: head features

Head features are usually passed up to the dominating node S NP VP <NP head num> = <VP head num> <NP head pers> > = <VP head pers>

Head features are usually passed up to the dominating node Rule {VP intransitiv} VP V: <VP head> = <V> <V subcat> > = i. \w sings \c Vi \f 3sg [lex:: sings] [cat: V ]. Let V be [cat: V]. Let Vi be V [subcat[ subcat: : i]. [cat: V subcat: : i]

exercise with the example grammar what structure (both tree structure and feature structure) does the grammar produce for: the boys sing and what would it do for the boy sing

Feature-based Parsing: the boys sing 1: S NP VP Det N V the boys sing S: [ cat: : S subj: : [ cat: : NP spec: : [ cat: Det lex: the num: pl ] head: : [ cat: : N lex: boys num: pl pers: : 3 ] ] pred: : [ cat: : VP head: : [ : V subcat:i lex: : sing num: pl pers: : 3 ] ] ] 1 parse found

Final move All information is moved into the feature structure even the tree structure HPSG (Head-driven Phrase Structure Grammar) Head: X Daughters: <Y Z > Cat: C Y X Z