Chapter 4: Sections : Valence. ª 2003 CSLI Publications

Similar documents
Chapter 4: Valence & Agreement CSLI Publications

Proof Theory for Syntacticians

Introduction to HPSG. Introduction. Historical Overview. The HPSG architecture. Signature. Linguistic Objects. Descriptions.

Syntax Parsing 1. Grammars and parsing 2. Top-down and bottom-up parsing 3. Chart parsers 4. Bottom-up chart parsing 5. The Earley Algorithm

"f TOPIC =T COMP COMP... OBJ

1/20 idea. We ll spend an extra hour on 1/21. based on assigned readings. so you ll be ready to discuss them in class

Basic Parsing with Context-Free Grammars. Some slides adapted from Julia Hirschberg and Dan Jurafsky 1

The building blocks of HPSG grammars. Head-Driven Phrase Structure Grammar (HPSG) HPSG grammars from a linguistic perspective

ENGBG1 ENGBL1 Campus Linguistics. Meeting 2. Chapter 7 (Morphology) and chapter 9 (Syntax) Pia Sundqvist

Grammars & Parsing, Part 1:

Informatics 2A: Language Complexity and the. Inf2A: Chomsky Hierarchy

A Minimalist Approach to Code-Switching. In the field of linguistics, the topic of bilingualism is a broad one. There are many

CS 598 Natural Language Processing

Feature-Based Grammar

Enhancing Unlexicalized Parsing Performance using a Wide Coverage Lexicon, Fuzzy Tag-set Mapping, and EM-HMM-based Lexical Probabilities

The Interface between Phrasal and Functional Constraints

Basic Syntax. Doug Arnold We review some basic grammatical ideas and terminology, and look at some common constructions in English.

Heads and history NIGEL VINCENT & KERSTI BÖRJARS The University of Manchester

Natural Language Processing. George Konidaris

An Introduction to the Minimalist Program

Case government vs Case agreement: modelling Modern Greek case attraction phenomena in LFG

Implementing the Syntax of Japanese Numeral Classifiers

Control and Boundedness

Analysis of Probabilistic Parsing in NLP

Parsing of part-of-speech tagged Assamese Texts

11/29/2010. Statistical Parsing. Statistical Parsing. Simple PCFG for ATIS English. Syntactic Disambiguation

Construction Grammar. University of Jena.

A Usage-Based Approach to Recursion in Sentence Processing

On the Notion Determiner

Developing a TT-MCTAG for German with an RCG-based Parser

BULATS A2 WORDLIST 2

Language acquisition: acquiring some aspects of syntax.

Interfacing Phonology with LFG

Inleiding Taalkunde. Docent: Paola Monachesi. Blok 4, 2001/ Syntax 2. 2 Phrases and constituent structure 2. 3 A minigrammar of Italian 3

Dependency, licensing and the nature of grammatical relations *

Structure-Preserving Extraction without Traces

Advanced Grammar in Use

Machine Learning from Garden Path Sentences: The Application of Computational Linguistics

Modeling Attachment Decisions with a Probabilistic Parser: The Case of Head Final Structures

Approaches to control phenomena handout Obligatory control and morphological case: Icelandic and Basque

Switched Control and other 'uncontrolled' cases of obligatory control

Constraining X-Bar: Theta Theory

Construction Grammar. Laura A. Michaelis.

Language and Computers. Writers Aids. Introduction. Non-word error detection. Dictionaries. N-gram analysis. Isolated-word error correction

Accurate Unlexicalized Parsing for Modern Hebrew

An Interactive Intelligent Language Tutor Over The Internet

Theoretical Syntax Winter Answers to practice problems

Context Free Grammars. Many slides from Michael Collins

cambridge occasional papers in linguistics Volume 8, Article 3: 41 55, 2015 ISSN

Using dialogue context to improve parsing performance in dialogue systems

Formulaic Language and Fluency: ESL Teaching Applications

Advanced Topics in HPSG

Constructions with Lexical Integrity *

Lexical Categories and the Projection of Argument Structure

Arabic language and its specification in TDL

EAGLE: an Error-Annotated Corpus of Beginning Learner German

MODELING DEPENDENCY GRAMMAR WITH RESTRICTED CONSTRAINTS. Ingo Schröder Wolfgang Menzel Kilian Foth Michael Schulz * Résumé - Abstract

A relational approach to translation

ELD CELDT 5 EDGE Level C Curriculum Guide LANGUAGE DEVELOPMENT VOCABULARY COMMON WRITING PROJECT. ToolKit

COMPUTATIONAL COMPLEXITY OF LEFT-ASSOCIATIVE GRAMMAR

! "! " #!!! # #! " #! " " $ # # $! #! $!!! #! " #! " " $ #! "! " #!!! #

Character Stream Parsing of Mixed-lingual Text

Compositional Semantics

Parsing with Treebank Grammars: Empirical Bounds, Theoretical Models, and the Structure of the Penn Treebank

LTAG-spinal and the Treebank

A Framework for Customizable Generation of Hypertext Presentations

LING 329 : MORPHOLOGY

Hindi Aspectual Verb Complexes

Words come in categories

Can Human Verb Associations help identify Salient Features for Semantic Verb Classification?

Dual Content Semantics, privative adjectives, and dynamic compositionality

Developing Grammar in Context

Procedia - Social and Behavioral Sciences 154 ( 2014 )

Some Principles of Automated Natural Language Information Extraction

Adapting Stochastic Output for Rule-Based Semantics

SAMPLE. Chapter 1: Background. A. Basic Introduction. B. Why It s Important to Teach/Learn Grammar in the First Place

An Interface between Prosodic Phonology and Syntax in Kurdish

Underlying and Surface Grammatical Relations in Greek consider

Disharmonic Word Order from a Processing Typology Perspective. John A. Hawkins, U of Cambridge RCEAL & UC Davis Linguistics

AN ANALYSIS OF GRAMMTICAL ERRORS MADE BY THE SECOND YEAR STUDENTS OF SMAN 5 PADANG IN WRITING PAST EXPERIENCES

Update on Soar-based language processing

Specifying a shallow grammatical for parsing purposes

Pseudo-Passives as Adjectival Passives

NATURAL LANGUAGE PARSING AND REPRESENTATION IN XML EUGENIO JAROSIEWICZ

Iraide Ibarretxe Antuñano Universidad de Zaragoza

A Computational Evaluation of Case-Assignment Algorithms

Lesson objective: Year: 5/6 Resources: 1a, 1b, 1c, 1d, 1e, 1f, Examples of newspaper orientations.

Type-driven semantic interpretation and feature dependencies in R-LFG

Multiple case assignment and the English pseudo-passive *

Intensive English Program Southwest College

Virtually Anywhere Episodes 1 and 2. Teacher s Notes

Argument structure and theta roles

A Version Space Approach to Learning Context-free Grammars

Pre-Processing MRSes

Exploration. CS : Deep Reinforcement Learning Sergey Levine

A corpus-based approach to the acquisition of collocational prepositional phrases

Refining the Design of a Contracting Finite-State Dependency Parser

Procedia - Social and Behavioral Sciences 141 ( 2014 ) WCLTA Using Corpus Linguistics in the Development of Writing

The presence of interpretable but ungrammatical sentences corresponds to mismatches between interpretive and productive parsing.

Development of the First LRs for Macedonian: Current Projects

Transcription:

Chapter 4: Sections 4.1-4.5: Valence

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

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. Head-Complement Rule 1: SPR word itr H SPR itr Head Complement Rule 2: SPR word itr H SPR str NP Head Complement Rule 3: SPR word itr H SPR dtr NP NP

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.

Complements Head-Complement Rule: VAL word H VAL 1,..., n 1,..., n 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. (Why?) This covers lots of cases not covered by the old Head- Complement Rules 1-3. (Examples?)

Question: How would the grammar change if English had postpositions, instead of prepositions? Head-Complement Rule VAL word HEAD H VAL verb adj noun 1,..., n 1,..., n PP Rule VAL word HEAD 1,..., n H VAL prep 1,..., n

Specifiers Head-Specifier Rule (Version I) 2 H SPR SPR 2 Combines the rules expanding S and NP. In principle also generalizes to other categories. Question: Why is SPR list-valued?

Question: S Why are these rightbranching? That is, NP VP what formal property of V NP NP our grammar forces the to be lower in the tree than the SPR? D NOM N P P

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 ) are identical to those of the head daughter.

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 most of the rest of our grammar) is just a well-formedness constraint on trees, without inherent directionality.

Mathematical Afterthoughts As noted earlier, some languages have constructions provably beyond the descriptive power of CFG Analyzing CFG categories into feature structures does not increase the mathematical power of the system, so long as there are still only finitely many categories.

Complex Feature Values and CFG Equivalence With feature structures in the values of other features, however, we now have the possibility of recursion in feature structures. E. g. < < > > This allows for infinite sets of categories, which allows for the description of languages that are not context-free.

Feature Structure Recursion is Limited Descriptive linguists using feature structure grammars have not used more than one level of recursion in feature structures. A formal restriction along these lines would bring us back to CFG equivalence. But the equivalent CFG would have a huge number of categories.