FMZ Elaborazione del linguaggio naturale Fabio Massimo Zanzotto.

Slides:



Advertisements
Similar presentations
FMZ Elaborazione del linguaggio naturale Fabio Massimo Zanzotto.
Advertisements

 Christel Kemke 2007/08 COMP 4060 Natural Language Processing Feature Structures and Unification.
C O N T E X T - F R E E LANGUAGES ( use a grammar to describe a language) 1.
Translator Architecture Code Generator ParserTokenizer string of characters (source code) string of tokens abstract program string of integers (object.
Syntactic analysis using Context Free Grammars. Analysis of language Morphological analysis – Chairs, Part Of Speech (POS) tagging – The/DT man/NN left/VBD.
GRAMMAR & PARSING (Syntactic Analysis) NLP- WEEK 4.
Introduction and Jurafsky Model Resource: A Probabilistic Model of Lexical and Syntactic Access and Disambiguation, Jurafsky 1996.
March 1, 2009 Dr. Muhammed Al-Mulhem 1 ICS 482 Natural Language Processing Probabilistic Context Free Grammars (Chapter 14) Muhammed Al-Mulhem March 1,
For Monday Read Chapter 23, sections 3-4 Homework –Chapter 23, exercises 1, 6, 14, 19 –Do them in order. Do NOT read ahead.
LTAG Semantics on the Derivation Tree Presented by Maria I. Tchalakova.
Amirkabir University of Technology Computer Engineering Faculty AILAB Efficient Parsing Ahmad Abdollahzadeh Barfouroush Aban 1381 Natural Language Processing.
Amirkabir University of Technology Computer Engineering Faculty AILAB Parsing Ahmad Abdollahzadeh Barfouroush Aban 1381 Natural Language Processing Course,
1/13 Parsing III Probabilistic Parsing and Conclusions.
© Patrick Blackburn, Johan Bos & Kristina Striegnitz Lecture 7: Definite Clause Grammars Theory –Introduce context free grammars and some related concepts.
1 CONTEXT-FREE GRAMMARS. NLE 2 Syntactic analysis (Parsing) S NPVP ATNNSVBD NP AT NNthechildrenate thecake.
Context Free Grammar S -> NP VP NP -> det (adj) N
Stochastic POS tagging Stochastic taggers choose tags that result in the highest probability: P(word | tag) * P(tag | previous n tags) Stochastic taggers.
Probabilistic Parsing Ling 571 Fei Xia Week 4: 10/18-10/20/05.
Linguistics II Syntax. Rules of how words go together to form sentences What types of words go together How the presence of some words predetermines others.
Context-Free Grammar CSCI-GA.2590 – Lecture 3 Ralph Grishman NYU.
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.
11 CS 388: Natural Language Processing: Syntactic Parsing Raymond J. Mooney University of Texas at Austin.
Context Free Grammars Reading: Chap 12-13, Jurafsky & Martin This slide set was adapted from J. Martin, U. Colorado Instructor: Paul Tarau, based on Rada.
1 Features and Unification Chapter 15 October 2012 Lecture #10.
1 Introduction to Parsing Lecture 5. 2 Outline Regular languages revisited Parser overview Context-free grammars (CFG’s) Derivations.
TEORIE E TECNICHE DEL RICONOSCIMENTO Linguistica computazionale in Python: -Analisi sintattica (parsing)
BİL711 Natural Language Processing1 Statistical Parse Disambiguation Problem: –How do we disambiguate among a set of parses of a given sentence? –We want.
For Monday Read chapter 23, sections 1-2 FOIL exercise due.
For Friday Finish chapter 23 Homework: –Chapter 22, exercise 9.
Tree-adjoining grammar (TAG) is a grammar formalism defined by Aravind Joshi and introduced in Tree-adjoining grammars are somewhat similar to context-free.
1 Statistical Parsing Chapter 14 October 2012 Lecture #9.
GRAMMARS David Kauchak CS159 – Fall 2014 some slides adapted from Ray Mooney.
CS : Language Technology for the Web/Natural Language Processing Pushpak Bhattacharyya CSE Dept., IIT Bombay Constituent Parsing and Algorithms (with.
Context Free Grammars Reading: Chap 9, Jurafsky & Martin This slide set was adapted from J. Martin, U. Colorado Instructor: Rada Mihalcea.
11 Chapter 14 Part 1 Statistical Parsing Based on slides by Ray Mooney.
1 Introduction to Computational Linguistics Eleni Miltsakaki AUTH Fall 2005-Lecture 4.
For Wednesday Read chapter 23 Homework: –Chapter 22, exercises 1,4, 7, and 14.
Daisy Arias Math 382/Lab November 16, 2010 Fall 2010.
CSA2050 Introduction to Computational Linguistics Parsing I.
1 Context Free Grammars October Syntactic Grammaticality Doesn’t depend on Having heard the sentence before The sentence being true –I saw a unicorn.
Context Free Grammars CFGs –Add recursion to regular expressions Nested constructions –Notation expression  identifier | number | - expression | ( expression.
For Friday No reading Program 4 due. Program 4 Any questions?
CS460/IT632 Natural Language Processing/Language Technology for the Web Lecture 6 (14/02/06) Prof. Pushpak Bhattacharyya IIT Bombay Top-Down and Bottom-Up.
1Computer Sciences Department. Book: INTRODUCTION TO THE THEORY OF COMPUTATION, SECOND EDITION, by: MICHAEL SIPSER Reference 3Computer Sciences Department.
LING 6520: Comparative Topics in Linguistics (from a computational perspective) Martha Palmer Jan 15,
◦ 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.
CSC312 Automata Theory Lecture # 26 Chapter # 12 by Cohen Context Free Grammars.
NATURAL LANGUAGE PROCESSING
Welcome to the flashcards tool for ‘The Study of Language, 5 th edition’, Chapter 8 This is designed as a simple supplementary resource for this textbook,
Lecturer : Ms. Abrar Mujaddidi S YNTAX. I NTRODUCTION  In the previous chapter, we moved from the general categories and concepts of traditional grammar,
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.
Roadmap Probabilistic CFGs –Handling ambiguity – more likely analyses –Adding probabilities Grammar Parsing: probabilistic CYK Learning probabilities:
General Information on Context-free and Probabilistic Context-free Grammars İbrahim Hoça CENG784, Fall 2013.
Natural Language Processing Vasile Rus
An Introduction to the Government and Binding Theory
Lecture – VIII Monojit Choudhury RS, CSE, IIT Kharagpur
CS510 Compiler Lecture 4.
Basic Parsing with Context Free Grammars Chapter 13
Chapter Eight Syntax.
CS 388: Natural Language Processing: Syntactic Parsing
Chapter Eight Syntax.
Natural Language - General
David Kauchak CS159 – Spring 2019
Parsing I: CFGs & the Earley Parser
Lecture 7: Definite Clause Grammars
Artificial Intelligence 2004 Speech & Natural Language Processing
Prof. Pushpak Bhattacharyya, IIT Bombay
Presentation transcript:

FMZ Elaborazione del linguaggio naturale Fabio Massimo Zanzotto

FMZ Part six Tree Adjoining Grammars

FMZ Our Aim Lines of development Grammatical Representation Power: Build a formalism/model able to give the possibility of reducing the unnecessary interpretations Grammar Use: Build a formalism (and an associated algorithm) able to represent partial analysis

FMZ Our Aim Lines of development Grammatical Representation Power: CFG (context free grammars) DCG Feature Structures Grammar Use: CYK Chart and Early Algorithm

FMZ Lesson learnt Lexicon (i.e. words) is a very important piece of the Language and of the language model Words carry meaning and govern the syntactic structure of sentences

FMZ What we observed Toy Examples:... La vecchia porta la sbarra Il vecchio porta la sbarra Flying planes can be dangerous Flying planes is dangerous...

FMZ Continuing the observation of the languages Some more toy examples:... Il ragazzo mangia la mela con il coltello Luomo guarda il monitor con gli occhi stralunati Le azioni della acme inc aumentano in tre settimane da 2 euro a 3 euro... How many interpretations are possible for these sentences?

FMZ Subcategorisation frames Necessary subcategorisation frames:... Il ragazzo mangia la mela con il coltello... ((NP) mangiare (NP) (PP(con)))... Luomo opera il paziente di appendicite... ((NP) operare (NP) (PP(di)))... Le azioni della acme inc aumentano in tre settimane da 2 euri a 3 euro... ((NP) aumentare (PP(da)) (PP(a)))

FMZ Modelling Subcat Frames in CFGs Target Frame: ((NP) mangiare (NP) (PP(con))) S NP VP | NP VP(mangiare) NP NP SBAR VP VerbX NP | VerbX NP PP VerbX Verb | Modal Verb VP(mangiare) VerbX(mangiare) NP | VerbX (mangiare) NP PP(con) VerbX(mangiare) Verb(mangiare) | Modal Verb(mangiare) NP Art Noun | Art Adj Noun | Noun | Verb Noun | NP PP PP Prep NP

FMZ Observations Il ragazzo mangia la mela a mezzogiorno con il coltello How do we modify those(?): VP(mangiare) VerbX(mangiare) NP | VerbX (mangiare) NP PP(con) VerbX(mangiare) Verb(mangiare) | Modal Verb(mangiare)

FMZ Summing up We understood that subcategorisation can indicate preferred sentence readings We want to build lexicalised rules, that is, rules governed by lexical elements (words) We want to empower the grammar

FMZ Idea!!! Lexicalised rules may be partial tree! ((NP) aumentare (PP(da)) (PP(a))) aumentare V VP S NP PP IN daa NP

FMZ Defining better our aim We want a lexicalised grammar –each rule (partial tree) has to at least a lexical item We want a grammar equivalent to the a given grammar –weak equivalence: equivalence in the language recognised –strong equivalence: equivalence in generated trees with respect to input sentences... remember that the structure define the meaning

FMZ Operations in CFG in the derivation, no terminal symbols are substituted with rewriting rules headed by the same symbol may be understood as tree substitution no terminal symbols are substituted with trees headed by the same symbol is it sufficient to obtain the strong equivalence?

FMZ Investigating strong equivalence Given the grammar and the sequence aaaa, one of the interpretations is:

FMZ Lets build the lexicalised grammar Given the tree collection the interpretation cannot be obtained!

FMZ Another example Given the grammar it can be lexicalised as follows: strange rule!!!

FMZ Another example The same grammar may be lexicalised also however, what about this

FMZ Tree Adjoining Grammars

FMZ What do we need? A new operation!!! the Tree Adjoining operation

FMZ Tree Adjoining Example

FMZ Again the substitution The well know operation

FMZ Substitution example

FMZ Tree Adjoining again Does it solve the problem of obtaining the strong equivalence? This is the solution to the example problem!!!

FMZ Tree Adjoining again successive adjoining of ( 4 )

FMZ More examples may give the interpretation:

FMZ What is a grammar now? It is a collection of: initial trees, represent the lexicon, e.g., auxiliary trees, represent grammatical rules, e.g.,

FMZ Do you remember? copy-language structures: Pino, Gino e Rino sono rispettivamente fratello, zio e babbo di Nino may be read as: a 1 a 2 a 3 b 1 b 2 b 3 Exercise: Find a model in TAG for this problem

FMZ What we have done? we have worked on the representation power of the grammar we introduced: –lexicalised rules –the adjoining operation where do we pay? –on the parsing algorithm?

FMZ Question Have we resolved the problem of selecting between different readings (sentence interpretations)?