Introduction to Computational Linguistics

Slides:



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

Syntax. Definition: a set of rules that govern how words are combined to form longer strings of meaning meaning like sentences.
Chapter 4 Syntax.
Grammars, Languages and Parse Trees. Language Let V be an alphabet or vocabulary V* is set of all strings over V A language L is a subset of V*, i.e.,
Grammatical Relations and Lexical Functional Grammar Grammar Formalisms Spring Term 2004.
1 Introduction to Linguistics II Ling 2-121C, group b Lecture 4 Eleni Miltsakaki AUTH Spring 2006.
Chapter Chapter Summary Languages and Grammars Finite-State Machines with Output Finite-State Machines with No Output Language Recognition Turing.
MORPHOLOGY - morphemes are the building blocks that make up words.
Natural Language Processing - Feature Structures - Feature Structures and Unification.
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.
Syntax Lecture 4.
1 Introduction to Computational Linguistics Eleni Miltsakaki AUTH Spring 2006-Lecture 4.
 Christel Kemke 2007/08 COMP 4060 Natural Language Processing Feature Structures 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.
Sanjukta Ghosh Department of Linguistics Banaras Hindu University.
Models of Generative Grammar Smriti Singh. Generative Grammar  A Generative Grammar is a set of formal rules that can generate an infinite set of sentences.
Syntax Nuha AlWadaani.
VP: [VP[Vhelp[ [PRNyou]]
Three Generative grammars
1 LIN 1310B Introduction to Linguistics Prof: Nikolay Slavkov TA: Qinghua Tang CLASS 14, Feb 27, 2007.
Tree-adjoining grammar (TAG) is a grammar formalism defined by Aravind Joshi and introduced in Tree-adjoining grammars are somewhat similar to context-free.
Natural Language Processing Lecture 6 : Revision.
SYNTAX Lecture -1 SMRITI SINGH.
1 LIN 1310B Introduction to Linguistics Prof: Nikolay Slavkov TA: Qinghua Tang CLASS 13, Feb 16, 2007.
CSE Introduction to Computational Linguistics Tuesdays, Thursdays 14:30-16:00 – South Ross 101 Fall Semester, 2011 Instructor: Nick Cercone
2007CLINT-LIN-FEATSTR1 Computational Linguistics for Linguists Feature Structures.
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.
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 Principles & Parameters Approach in Linguistics - IV Bibhuti Bhusan Mahapatra.
The Minimalist Program
Linguistic Theory Lecture 5 Filters. The Structure of the Grammar 1960s (Standard Theory) LexiconPhrase Structure Rules Deep Structure Transformations.
1 Introduction to Computational Linguistics Eleni Miltsakaki AUTH Spring 2006-Lecture 2.
SYNTAX.
◦ Process of describing the structure of phrases and sentences Chapter 8 - Phrases and sentences: grammar1.
1 Introduction to Computational Linguistics Eleni Miltsakaki AUTH Fall 2005-Lecture 3.
 2003 CSLI Publications Ling 566 Oct 17, 2011 How the Grammar Works.
1 LIN 1310B Introduction to Linguistics Prof: Nikolay Slavkov TA: Qinghua Tang CLASS 11, Feb 9, 2007.
Lecturer : Ms. Abrar Mujaddidi S YNTAX. I NTRODUCTION  In the previous chapter, we moved from the general categories and concepts of traditional grammar,
SYNTAX.
King Faisal University جامعة الملك فيصل Deanship of E-Learning and Distance Education عمادة التعلم الإلكتروني والتعليم عن بعد [ ] 1 King Faisal University.
10/31/00 1 Introduction to Cognitive Science Linguistics Component Topic: Formal Grammars: Generating and Parsing Lecturer: Dr Bodomo.
ece 720 intelligent web: ontology and beyond
SYNTAX.
Lecture 12: Summary and Exam
4.3 The Generative Approach
Chapter Eight Syntax.
Modular HPSG Vlado Keselj presented by Lijun Hou
Syntax Lecture 1: X-bar Theory.
Part I: Basics and Constituency
Formal Language.
TREE ADJOINING GRAMMAR
Instructor: Nick Cercone CSEB -
BBI 3212 ENGLISH SYNTAX AND MORPHOLOGY
Chapter Eight Syntax.
Language Variations: Japanese and English
CSE 311: Foundations of Computing
X-bar Schema Linguistics lecture series
Teori Bahasa dan Automata Lecture 9: Contex-Free Grammars
Ling 566 Oct 14, 2008 How the Grammar Works.
Sentences Ed McCorduck English 402--Grammar SUNY Cortland
Principles and Parameters (I)
Syntax.
Lecture 2 Krisztina Szécsényi
Presentation transcript:

Introduction to Computational Linguistics Eleni Miltsakaki AUTH Fall 2005-Lecture 5

What’s the plan for today? Brief review of Chomsky’s hierarchy of languages Tree Adjoining Grammar Lexical Functional Grammar Head-driven Phrase Structure Grammar

Main points from last lecture Chomsky hierarchy of languages Tree adjoining grammar Lexicalization Locality and recursion Substitution and adjunction Lexical Functional Grammar Constituent structure (c-structure) Functional structure (f-structure)

A little more background on syntax and phrase structure Language has a finite set of symbols but gives the possibility of producing infinitely many sentences Our brains have finite capacity  we need structure patterns Phrase structure is basic to all grammars Words, phrases, sentences We obtain the meaning of an utterance from the meaning of its parts Syntax defines the way the combination takes place, i.e., it provides structure

Tests for phrases/constituents Substitutability I met a man. I met the man. I met John. Permutability Εχω επισκεφτεί πολλές πόλεις της Ελλάδας Πολλές πόλεις της Ελλάδας έχω επισκεφτεί Pronominalizability I met John. I met him.

Features We need to specify that the subject and the verb need to agree in person and number If we put all this information in the rules, the rules become to complex Instead, we use features S NP(Per, Num) VP (Per, Num) S NP(Agr) VP (Agr)

Feature structure in HPSG A feature structure is a set of pairs of the form [ATTRIBUTE value] ATTRIBUTE: an element of the set of features named ATT in the grammar (e.g., case, person etc) ‘value’ can be atomic (a string) or another feature structure

Examples of feature structures

Feature types Feature structures are of a certain type, written in italics Features are organized in hierarchies

Identity in HPSG Identity of values is marked with boxes

Valence and grammar rules Complements are specified as complex categories in the lexical representation There are also specific rules for head complement combinations

Representation of valence in feature descriptions A lexical entry consists of:

Head feature principle In a headed structure, the head features of the mother are identical to the head features of the head daughter

Linguistic generalizations in the type hierarchy Types are arranged in a hierarchy The most general type is at the top Information about properties of an object of a certain type are specified in the definition of the type Subtypes inherit these properties Like an encyclopedic entry The upper part of the hierarchy is relevant to all languages (universal grammar) More specific types maybe specific for classes of languages or just one language

A non-linguistic example

Head complement schema Head complement schema + head feature principle

A simple example

General information about HPSG

Applications

Acknowledgements The introduction to HPSG is based on Stefan Muller’s introduction to HPSG at ESSLLI 2001. Many thanks to Stefan Muller for making the slides of his tutorial publicly available