The Research on Syntactic Features in Semantic Role Labeling

Size: px
Start display at page:

Download "The Research on Syntactic Features in Semantic Role Labeling"

Transcription

1 J OU RNAL OF CH IN ESE IN FORMA TION PROCESSIN G Vol. 23, No. 6 Nov., 2009 : (2009) ,,,, (, ) :,,,( NULL ),,,; CoNLL22005 Shared Task WSJ % %F1, : ;;;; ; : TP391 : A The Research on Syntactic Features in Semantic Role Labeling L I J unhui, WAN G Hongling, ZHOU Guodong, ZHU Qiaoming, QIAN Peide ( School of Computer Science & Technology, Soochow University, Suzhou, Jiangsu , China) Abstract : A feature2based semantic role labeling system operated on signal syntactic parse is constructed. The sys2 tem is divided into three sequential tasks : (1) filtering out constituent s that represent no semantic argument s with high probabilities, (2) classifying constituent s of candidate semantic argument s into the specific categories (inclu2 ding NULL class), and (3) dealing with overlap argument s and constituent s all labeled as core2argument s in the post2processing step. Besides combining and optimizing the existing features presented in other work, the paper ex2 tract s new features according to knowledge of grammar, pattern and collocation. The experiment s show the effec2 tiveness and robustness of the new extracted features, with which the finally SRL system achieves F1 value % and % on the development and WSJ test set respectively. As far as we know, it is the best result based on sin2 gle syntactic parsers on the CoNLL22005 Shared Task. Key words : artificial intelligence ; natural language processing ; semantic role labeling ; grammar2driven feature ; pat2 tern feature ; collocation feature 1,,, ( Argent ) ( Patient ) ( In2 (Semantic Role Labeling, SRL),, CoNLL 2004 [1 ] 2005 [ 2 ] SRL,SRL, strument),,(locative) : : : 863 (2006AA01Z147) ; ( ) ; (08 KJD520010) : (1983 ),,, ; (1975 ),,, ; (1967 ),,,,

2 ( Temporal) (Manner) ( Cause) 1 PropBank,, Arg0 ; Arg1 ;ArgM2LOC, 1 YaoMing plays basketball in NBA plays CoNLL,,SRL, ;, ( Argument Identification), (Argument Classification),, ( ) (),,, ;,,,;, CoN2 LL2005,, WSJ F % %, : ; Baseline ;, ;;,, [ 3 ], 7,( Constit uent Type) ( Subcategorization) ( Parse Tree Pat h) ( Constit uent Posi2 tion) ( Predicate Voice ) (Constituent Head Word) ( Predicate) 7 SRL [4 ],7,, ( Head POS) PP ( First Word in Constit2 uent) [ 5 ]7, 5,, [ 6 ] PA K ( Predicate/ Argument Structure Kernel) [ 7 ] PA K, ( Pat h Kernel) (Constituent Struct ure Kernel), [8 ],, buy a car buy a red car high degree higher de2 gree,,,,, ;,,,,,, 3 Baseline ,: 1)

3 6 : 13, (NULL vs. NON2NULL),( Null ) ( = 0. 9), ;2), NULL ;3),,,, P (NULL ) >, ; (NULL ),, ;,, SVMLight,one vs. ot hers ( NULL ) (4 ) ( CBaseFeature) (15 ) 7 [4, ] [4, ] [4, ] 3. 2 [4, ], 0,, [12 ] N P S V P VB ( [14 ], ) N P,;N P, N P S V P VB N P, N P N P,,, SRL, 1 2,Baseline 1 ( IBaseFeature), [4, ] [425, 12214], Collins (6 ) V P, V P2 > VBZ_NP_PP,,, 1, N P ( Yaoming) play N P S V P VBD N P, SBAR [14 ] (12 ) ,, C1 C2 ( 1 N P (NBA) PP (in NBA) ),,,,, NULL The OpenNL P Maximum Entropy Package. http :/ / max2 ent. sourceforge. net/, PP PP +,PP + in ; + PP + NBA

4 ,, SRL,,, : C1 C2, C1 A B,C2 A C p (A C1) p (C C2) > p (B C1) p (A C2) C1 A, C2 C,,C1 B,C2 A S N P + V P, S A,B C,,SBAR (SBAR (t hat) SBAR ( since) ) ;c. A A CC A, (A, CC,and, or ), A ; d. S 2 S,2 (a), ;2 (b), 2 (c), S, S S, : S N P +,S ( TO + ) V P +,S 4 SRL Baseline, : 1) SRL,,,,;,, ;2),, ;,Baseline, 4. 1 VBN ;b. SBAR SBA R,, 2 S 2) V P, 1 N P (basketball), ( 1),, 3 (a), buying Big in2 vestment banks (ref used, step support) (by) N P (Big in2, vestment banks) buy, N P S V P S V P V P S V P V P PP, S V P VB G, 1) N P buy, : a. ref used step support buying,,, N P (Big, 1 YaoMing invest ment banks) ;, V P (buy2 played basket ball in NBA,play ing... ) V P (ref used to.. ) ( 3 (b), ),N P buy VB VBZ VBD VBP G VBN (,,ref use step have ), support,,

5 6 : 15,, 3 N P(Big investment banks) VB G(buying) 4. 2, ( Pattern), Sbody benefit Sbody St hing,sbody benefit St hing f rom Sbody/ St hing benefit,,, ( A0, A1 ) open N P1 open N P2 open N P3, open, N P1,the store finally opened ;N P2 N P3,I opened t he box, go come take,,,,,, 4, 4 (a) N P ( I) 2 = N P V (A) N P,,,, go t hrough come up with take place take over 4 ( b) N P ( The, 4,,( Collocation), (4 ), : ( ) 4 (a) 4 NP(I) 1 = NP V (A) NP, 1,(A),V event) 3 = N P V ( A ) place CoNLL2005

6 , PropBank Brown : PropBank [9 ] Section02221, ; Section24,1 346 ;Section23,2 416 ;, Brown 426,, CoNLL2005 [ ], % % [ 14 ] Char2 niak Collins, Charniak, srl2eva. pl, F1, 3, 100, SVMLight c = e = m = , 5. 2, 3,P ( NULL ) >(, 0. 9),; 3 CoNLL 2005 Shared Task TestWSJ (= 0. 9) Precision Recall F1 IBaseFeature IBaseFeature IBaseFeature IBaseFeature + Both ,, S SBAR,,;,,, 3,,, ( Precision % %), ( IBaseFeat ure + ) : 1), ;2) IBaseFeat ure, NULL,( IBaseFeature + ) 5. 3 SRL,, P (NULL) >, ; ( NULL ) 4 CoNLL 2005 Shared Task Test WSJ, 4 CoNLL 2005 Shared Task TestWSJ SRL,= 0. 9, IBaseFeature Precision Recall F1 CBaseFeature CBaseFeature CBaseFeature CBaseFeature CBaseFeature CBaseFeature CoNLL 2005 Shared Task Test WSJ, Baseline,, 5 : 1), S SBAR,, ( F %), ( F %) Bot h +,

7 6 : 17 5 CoNLL 2005 Shared Task TestWSJ SRL (= 0. 9) IBaseFeature IBaseFeature + CBaseFeature CBaseFeature CBaseFeature + CBaseFeature + CBaseFeature + Both Precision Recall F ),,F % 3), SRL, Baseline % % 5. 4 SRL Punyakanoc [ 12 ] CoNLL 2005 Shared Task,,, (Charniak),Surdeanu [13 ] [14 ] Pradhan,,,, ( Charniak), 6 Baseline Baseline + Bot h 6 : 1) Baseline [425,14 ],, [13214 ] 2) SRL, ( WSJ + Brown) F ) Brown SRL WSJ, F %, :, SRL ;, SRL, 4) CoNLL 2005 Shared Task, Brown,, 6, ;, ; Overlap, Baseline ;, CoNLL 2005 Shared Task,, 6 SRL Development Test WSJ Test Brown Test WSJ + Brown P R F1 P R F1 P R F1 P R F1 Punyakanoc et al., Surdeanu et al., , Baseline Baseline + Both

8 ,, The store opened last week, open N P open N P, The store A0,,,, (), : 1),CoNLL 2005 Shared Task ,3 101, % ; 1 795, 26 % ;2),, ;,, anes2 t hetic () antibiotic (),,, : [1 ] Carreras X. and M rquez L. Introduction to the CoN2 LL22004 Shared Task : Semantic Role Labeling [ C ]/ / Proceedings of CoNLL 2004 Shared Task [2 ] Carreras X. and M rquez L. (2005). Introduction to the CoNLL22005 Shared Task : Semantic Role Labeling [ C]/ / Proceedings of CoNLL 2005 Shared Task [3 ] Gildea D. and J uraf sky D. (2002). Automatic Labe2 ling of Semantic Roles [J ]. Computational Linguistics, 2002, 28 (3) : [4 ] Pradhan S., Hacioglu K., Krugler V. et al. (2005). Support Vector Learning for Semantic Argument Clas2 sification [ J ]. Machine Learning Journal, 2005, 60 (3) : [5 ] Xue N. and Palmer M. (2004). Calibrating Features for Semantic Role Labeling [ C ]/ / Proceedings of EMNL P, [6 ] Moschitti A. (2004). A Study on Convolution Kernels for Shallow Statistic Parsing [ C ]/ / Proceedings of ACL22004,2004 : [7 ] Che W., Zhang M., Liu T. and Li S. (2006). A Hy2 brid Convolution Tree Kernel for Semantic Role Labe2 ling [ C ]/ / Proceedings of the COL IN G/ ACL 2006 Main Conference Poster Sessions, 2006 : [8 ] Zhang M., Che W., AW A. T. et al. (2007). A Grammar2driven Convolution Tree Kernel for Semantic Role Classification [ C ]/ / Proceedings of ACL22007, 2007 : [9 ] Palmer M., Gildea D. and Kingsbury P. The Proposi2 tion Bank : An Annotated Corpus of Semantic Roles [J ]. Computational Linguistics, 2005, 31 (1). [10 ] Charniak E. A Maximum2entropy Inspired Parser [ C]/ / Proceedings of NAACL22000,2000. [11 ] Collins M. ( 1999). Head2driven Statistical Models for Natural Language Parsing [ D ]. Ph. D. thesis, University of Pennsylvania. [12 ] Punyakanoc V., Koomen P., Roth Dan, and Yih W. (2005). Generalized Inference With Multiple Seman2 tic Role Labeling Systems [ C]/ / Proceedings of CoN2 LL22005,2005. [13 ] Surdeanu M. and Turmo J. Semantic Role Labeling Using Complete Syntactic Analysis [ R]/ / Proceedings of CoNLL22005,2005. [14 ],,. (2007). [J ]., 2007,18 (3) :

Semantic Role Labeling via Tree Kernel Joint Inference

Semantic Role Labeling via Tree Kernel Joint Inference Semantic Role Labeling via Tree Kernel Joint Inference Alessandro Moschitti, Daniele Pighin and Roberto Basili Department of Computer Science University of Rome Tor Vergata 00133 Rome, Italy {moschitti,basili}@info.uniroma2.it

More information

Fast Computing Grammar-driven Convolution Tree Kernel for Semantic Role Labeling

Fast Computing Grammar-driven Convolution Tree Kernel for Semantic Role Labeling Fast Computing Grammar-driven Convolution Tree Kernel for Semantic Role Labeling Wanxiang Che 1, Min Zhang 2, Ai Ti Aw 2, Chew Lim Tan 3, Ting Liu 1, Sheng Li 1 1 School of Computer Science and Technology

More information

Introduction to the CoNLL-2004 Shared Task: Semantic Role Labeling

Introduction to the CoNLL-2004 Shared Task: Semantic Role Labeling Introduction to the CoNLL-2004 Shared Task: Semantic Role Labeling Xavier Carreras and Lluís Màrquez TALP Research Center Technical University of Catalonia Boston, May 7th, 2004 Outline Outline of the

More information

The SUBTLE NL Parsing Pipeline: A Complete Parser for English Mitch Marcus University of Pennsylvania

The SUBTLE NL Parsing Pipeline: A Complete Parser for English Mitch Marcus University of Pennsylvania The SUBTLE NL Parsing Pipeline: A Complete Parser for English Mitch Marcus University of Pennsylvania 1 PICTURE OF ANALYSIS PIPELINE Tokenize Maximum Entropy POS tagger MXPOST Ratnaparkhi Core Parser Collins

More information

Penn Treebank Parsing. Advanced Topics in Language Processing Stephen Clark

Penn Treebank Parsing. Advanced Topics in Language Processing Stephen Clark Penn Treebank Parsing Advanced Topics in Language Processing Stephen Clark 1 The Penn Treebank 40,000 sentences of WSJ newspaper text annotated with phrasestructure trees The trees contain some predicate-argument

More information

Probabilistic Context-free Grammars

Probabilistic Context-free Grammars Probabilistic Context-free Grammars Computational Linguistics Alexander Koller 24 November 2017 The CKY Recognizer S NP VP NP Det N VP V NP V ate NP John Det a N sandwich i = 1 2 3 4 k = 2 3 4 5 S NP John

More information

Driving Semantic Parsing from the World s Response

Driving Semantic Parsing from the World s Response Driving Semantic Parsing from the World s Response James Clarke, Dan Goldwasser, Ming-Wei Chang, Dan Roth Cognitive Computation Group University of Illinois at Urbana-Champaign CoNLL 2010 Clarke, Goldwasser,

More information

Capturing Argument Relationships for Chinese Semantic Role Labeling

Capturing Argument Relationships for Chinese Semantic Role Labeling Capturing Argument Relationships for Chinese Semantic Role abeling ei Sha, Tingsong Jiang, Sujian i, Baobao Chang, Zhifang Sui Key aboratory of Computational inguistics, Ministry of Education School of

More information

Bringing machine learning & compositional semantics together: central concepts

Bringing machine learning & compositional semantics together: central concepts Bringing machine learning & compositional semantics together: central concepts https://githubcom/cgpotts/annualreview-complearning Chris Potts Stanford Linguistics CS 244U: Natural language understanding

More information

Learning and Inference over Constrained Output

Learning and Inference over Constrained Output Learning and Inference over Constrained Output Vasin Punyakanok Dan Roth Wen-tau Yih Dav Zimak Department of Computer Science University of Illinois at Urbana-Champaign {punyakan, danr, yih, davzimak}@uiuc.edu

More information

A Supertag-Context Model for Weakly-Supervised CCG Parser Learning

A Supertag-Context Model for Weakly-Supervised CCG Parser Learning A Supertag-Context Model for Weakly-Supervised CCG Parser Learning Dan Garrette Chris Dyer Jason Baldridge Noah A. Smith U. Washington CMU UT-Austin CMU Contributions 1. A new generative model for learning

More information

Probabilistic Context Free Grammars. Many slides from Michael Collins

Probabilistic Context Free Grammars. Many slides from Michael Collins Probabilistic Context Free Grammars Many slides from Michael Collins Overview I Probabilistic Context-Free Grammars (PCFGs) I The CKY Algorithm for parsing with PCFGs A Probabilistic Context-Free Grammar

More information

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

Parsing. Based on presentations from Chris Manning s course on Statistical Parsing (Stanford) Parsing Based on presentations from Chris Manning s course on Statistical Parsing (Stanford) S N VP V NP D N John hit the ball Levels of analysis Level Morphology/Lexical POS (morpho-synactic), WSD Elements

More information

arxiv: v2 [cs.cl] 20 Apr 2017

arxiv: v2 [cs.cl] 20 Apr 2017 Syntax Aware LSM Model for Chinese Semantic Role Labeling Feng Qian 2, Lei Sha 1, Baobao Chang 1, Lu-chen Liu 2, Ming Zhang 2 1 Key Laboratory of Computational Linguistics, Ministry of Education, Peking

More information

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.

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. /6/7 CS 6/CS: Natural Language Processing Instructor: Prof. Lu Wang College of Computer and Information Science Northeastern University Webpage: www.ccs.neu.edu/home/luwang The grammar: Binary, no epsilons,.9..5

More information

Margin-based Decomposed Amortized Inference

Margin-based Decomposed Amortized Inference Margin-based Decomposed Amortized Inference Gourab Kundu and Vivek Srikumar and Dan Roth University of Illinois, Urbana-Champaign Urbana, IL. 61801 {kundu2, vsrikum2, danr}@illinois.edu Abstract Given

More information

Terry Gaasterland Scripps Institution of Oceanography University of California San Diego, La Jolla, CA,

Terry Gaasterland Scripps Institution of Oceanography University of California San Diego, La Jolla, CA, LAMP-TR-138 CS-TR-4844 UMIACS-TR-2006-58 DECEMBER 2006 SUMMARIZATION-INSPIRED TEMPORAL-RELATION EXTRACTION: TENSE-PAIR TEMPLATES AND TREEBANK-3 ANALYSIS Bonnie Dorr Department of Computer Science University

More information

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

Natural Language Processing CS Lecture 06. Razvan C. Bunescu School of Electrical Engineering and Computer Science Natural Language Processing CS 6840 Lecture 06 Razvan C. Bunescu School of Electrical Engineering and Computer Science bunescu@ohio.edu Statistical Parsing Define a probabilistic model of syntax P(T S):

More information

10/17/04. Today s Main Points

10/17/04. Today s Main Points Part-of-speech Tagging & Hidden Markov Model Intro Lecture #10 Introduction to Natural Language Processing CMPSCI 585, Fall 2004 University of Massachusetts Amherst Andrew McCallum Today s Main Points

More information

TALP at GeoQuery 2007: Linguistic and Geographical Analysis for Query Parsing

TALP at GeoQuery 2007: Linguistic and Geographical Analysis for Query Parsing TALP at GeoQuery 2007: Linguistic and Geographical Analysis for Query Parsing Daniel Ferrés and Horacio Rodríguez TALP Research Center Software Department Universitat Politècnica de Catalunya {dferres,horacio}@lsi.upc.edu

More information

A Context-Free Grammar

A Context-Free Grammar Statistical Parsing A Context-Free Grammar S VP VP Vi VP Vt VP VP PP DT NN PP PP P Vi sleeps Vt saw NN man NN dog NN telescope DT the IN with IN in Ambiguity A sentence of reasonable length can easily

More information

Probabilistic Context-Free Grammars. Michael Collins, Columbia University

Probabilistic Context-Free Grammars. Michael Collins, Columbia University Probabilistic Context-Free Grammars Michael Collins, Columbia University Overview Probabilistic Context-Free Grammars (PCFGs) The CKY Algorithm for parsing with PCFGs A Probabilistic Context-Free Grammar

More information

Semantic Role Labeling and Constrained Conditional Models

Semantic Role Labeling and Constrained Conditional Models Semantic Role Labeling and Constrained Conditional Models Mausam Slides by Ming-Wei Chang, Nick Rizzolo, Dan Roth, Dan Jurafsky Page 1 Nice to Meet You 0: 2 ILP & Constraints Conditional Models (CCMs)

More information

Probabilistic Context Free Grammars. Many slides from Michael Collins and Chris Manning

Probabilistic Context Free Grammars. Many slides from Michael Collins and Chris Manning Probabilistic Context Free Grammars Many slides from Michael Collins and Chris Manning Overview I Probabilistic Context-Free Grammars (PCFGs) I The CKY Algorithm for parsing with PCFGs A Probabilistic

More information

Natural Language Processing

Natural Language Processing SFU NatLangLab Natural Language Processing Anoop Sarkar anoopsarkar.github.io/nlp-class Simon Fraser University September 27, 2018 0 Natural Language Processing Anoop Sarkar anoopsarkar.github.io/nlp-class

More information

Features of Statistical Parsers

Features of Statistical Parsers Features of tatistical Parsers Preliminary results Mark Johnson Brown University TTI, October 2003 Joint work with Michael Collins (MIT) upported by NF grants LI 9720368 and II0095940 1 Talk outline tatistical

More information

A Deterministic Word Dependency Analyzer Enhanced With Preference Learning

A Deterministic Word Dependency Analyzer Enhanced With Preference Learning A Deterministic Word Dependency Analyzer Enhanced With Preference Learning Hideki Isozaki and Hideto Kazawa and Tsutomu Hirao NTT Communication Science Laboratories NTT Corporation 2-4 Hikaridai, Seikacho,

More information

Natural Language Processing 1. lecture 7: constituent parsing. Ivan Titov. Institute for Logic, Language and Computation

Natural Language Processing 1. lecture 7: constituent parsing. Ivan Titov. Institute for Logic, Language and Computation atural Language Processing 1 lecture 7: constituent parsing Ivan Titov Institute for Logic, Language and Computation Outline Syntax: intro, CFGs, PCFGs PCFGs: Estimation CFGs: Parsing PCFGs: Parsing Parsing

More information

LECTURER: BURCU CAN Spring

LECTURER: BURCU CAN Spring LECTURER: BURCU CAN 2017-2018 Spring Regular Language Hidden Markov Model (HMM) Context Free Language Context Sensitive Language Probabilistic Context Free Grammar (PCFG) Unrestricted Language PCFGs can

More information

Machine Learning for natural language processing

Machine Learning for natural language processing Machine Learning for natural language processing Classification: Maximum Entropy Models Laura Kallmeyer Heinrich-Heine-Universität Düsseldorf Summer 2016 1 / 24 Introduction Classification = supervised

More information

Chunking with Support Vector Machines

Chunking with Support Vector Machines NAACL2001 Chunking with Support Vector Machines Graduate School of Information Science, Nara Institute of Science and Technology, JAPAN Taku Kudo, Yuji Matsumoto {taku-ku,matsu}@is.aist-nara.ac.jp Chunking

More information

From Language towards. Formal Spatial Calculi

From Language towards. Formal Spatial Calculi From Language towards Formal Spatial Calculi Parisa Kordjamshidi Martijn Van Otterlo Marie-Francine Moens Katholieke Universiteit Leuven Computer Science Department CoSLI August 2010 1 Introduction Goal:

More information

Multiword Expression Identification with Tree Substitution Grammars

Multiword Expression Identification with Tree Substitution Grammars Multiword Expression Identification with Tree Substitution Grammars Spence Green, Marie-Catherine de Marneffe, John Bauer, and Christopher D. Manning Stanford University EMNLP 2011 Main Idea Use syntactic

More information

Deep Learning for NLP

Deep Learning for NLP Deep Learning for NLP CS224N Christopher Manning (Many slides borrowed from ACL 2012/NAACL 2013 Tutorials by me, Richard Socher and Yoshua Bengio) Machine Learning and NLP NER WordNet Usually machine learning

More information

11/3/15. Deep Learning for NLP. Deep Learning and its Architectures. What is Deep Learning? Advantages of Deep Learning (Part 1)

11/3/15. Deep Learning for NLP. Deep Learning and its Architectures. What is Deep Learning? Advantages of Deep Learning (Part 1) 11/3/15 Machine Learning and NLP Deep Learning for NLP Usually machine learning works well because of human-designed representations and input features CS224N WordNet SRL Parser Machine learning becomes

More information

MACHINE LEARNING. Kernel Methods. Alessandro Moschitti

MACHINE LEARNING. Kernel Methods. Alessandro Moschitti MACHINE LEARNING Kernel Methods Alessandro Moschitti Department of information and communication technology University of Trento Email: moschitti@dit.unitn.it Outline (1) PART I: Theory Motivations Kernel

More information

Maschinelle Sprachverarbeitung

Maschinelle Sprachverarbeitung Maschinelle Sprachverarbeitung Parsing with Probabilistic Context-Free Grammar Ulf Leser Content of this Lecture Phrase-Structure Parse Trees Probabilistic Context-Free Grammars Parsing with PCFG Other

More information

Maschinelle Sprachverarbeitung

Maschinelle Sprachverarbeitung Maschinelle Sprachverarbeitung Parsing with Probabilistic Context-Free Grammar Ulf Leser Content of this Lecture Phrase-Structure Parse Trees Probabilistic Context-Free Grammars Parsing with PCFG Other

More information

Representing structured relational data in Euclidean vector spaces. Tony Plate

Representing structured relational data in Euclidean vector spaces. Tony Plate Representing structured relational data in Euclidean vector spaces Tony Plate tplate@acm.org http://www.d-reps.org October 2004 AAAI Symposium 2004 1 Overview A general method for representing structured

More information

Multilevel Coarse-to-Fine PCFG Parsing

Multilevel Coarse-to-Fine PCFG Parsing Multilevel Coarse-to-Fine PCFG Parsing Eugene Charniak, Mark Johnson, Micha Elsner, Joseph Austerweil, David Ellis, Isaac Haxton, Catherine Hill, Shrivaths Iyengar, Jeremy Moore, Michael Pozar, and Theresa

More information

Lecture 5: UDOP, Dependency Grammars

Lecture 5: UDOP, Dependency Grammars Lecture 5: UDOP, Dependency Grammars Jelle Zuidema ILLC, Universiteit van Amsterdam Unsupervised Language Learning, 2014 Generative Model objective PCFG PTSG CCM DMV heuristic Wolff (1984) UDOP ML IO K&M

More information

Statistical Methods for NLP

Statistical Methods for NLP Statistical Methods for NLP Stochastic Grammars Joakim Nivre Uppsala University Department of Linguistics and Philology joakim.nivre@lingfil.uu.se Statistical Methods for NLP 1(22) Structured Classification

More information

Recap: Lexicalized PCFGs (Fall 2007): Lecture 5 Parsing and Syntax III. Recap: Charniak s Model. Recap: Adding Head Words/Tags to Trees

Recap: Lexicalized PCFGs (Fall 2007): Lecture 5 Parsing and Syntax III. Recap: Charniak s Model. Recap: Adding Head Words/Tags to Trees Recap: Lexicalized PCFGs We now need to estimate rule probabilities such as P rob(s(questioned,vt) NP(lawyer,NN) VP(questioned,Vt) S(questioned,Vt)) 6.864 (Fall 2007): Lecture 5 Parsing and Syntax III

More information

Advanced Natural Language Processing Syntactic Parsing

Advanced Natural Language Processing Syntactic Parsing Advanced Natural Language Processing Syntactic Parsing Alicia Ageno ageno@cs.upc.edu Universitat Politècnica de Catalunya NLP statistical parsing 1 Parsing Review Statistical Parsing SCFG Inside Algorithm

More information

Random Generation of Nondeterministic Tree Automata

Random Generation of Nondeterministic Tree Automata Random Generation of Nondeterministic Tree Automata Thomas Hanneforth 1 and Andreas Maletti 2 and Daniel Quernheim 2 1 Department of Linguistics University of Potsdam, Germany 2 Institute for Natural Language

More information

Prenominal Modifier Ordering via MSA. Alignment

Prenominal Modifier Ordering via MSA. Alignment Introduction Prenominal Modifier Ordering via Multiple Sequence Alignment Aaron Dunlop Margaret Mitchell 2 Brian Roark Oregon Health & Science University Portland, OR 2 University of Aberdeen Aberdeen,

More information

Latent Variable Models in NLP

Latent Variable Models in NLP Latent Variable Models in NLP Aria Haghighi with Slav Petrov, John DeNero, and Dan Klein UC Berkeley, CS Division Latent Variable Models Latent Variable Models Latent Variable Models Observed Latent Variable

More information

Lecture 13: Structured Prediction

Lecture 13: Structured Prediction Lecture 13: Structured Prediction Kai-Wei Chang CS @ University of Virginia kw@kwchang.net Couse webpage: http://kwchang.net/teaching/nlp16 CS6501: NLP 1 Quiz 2 v Lectures 9-13 v Lecture 12: before page

More information

Spatial Role Labeling CS365 Course Project

Spatial Role Labeling CS365 Course Project Spatial Role Labeling CS365 Course Project Amit Kumar, akkumar@iitk.ac.in Chandra Sekhar, gchandra@iitk.ac.in Supervisor : Dr.Amitabha Mukerjee ABSTRACT In natural language processing one of the important

More information

Introduction to Semantic Parsing with CCG

Introduction to Semantic Parsing with CCG Introduction to Semantic Parsing with CCG Kilian Evang Heinrich-Heine-Universität Düsseldorf 2018-04-24 Table of contents 1 Introduction to CCG Categorial Grammar (CG) Combinatory Categorial Grammar (CCG)

More information

Quasi-Second-Order Parsing for 1-Endpoint-Crossing, Pagenumber-2 Graphs

Quasi-Second-Order Parsing for 1-Endpoint-Crossing, Pagenumber-2 Graphs Quasi-Second-Order Parsing for 1-Endpoint-Crossing, Pagenumber-2 Graphs Junjie Cao, Sheng Huang, Weiwei Sun, Xiaojun Wan Institute of Computer Science and Technology Peking University September 5, 2017

More information

Computational Linguistics

Computational Linguistics Computational Linguistics Dependency-based Parsing Clayton Greenberg Stefan Thater FR 4.7 Allgemeine Linguistik (Computerlinguistik) Universität des Saarlandes Summer 2016 Acknowledgements These slides

More information

Processing/Speech, NLP and the Web

Processing/Speech, NLP and the Web CS460/626 : Natural Language Processing/Speech, NLP and the Web (Lecture 25 Probabilistic Parsing) Pushpak Bhattacharyya CSE Dept., IIT Bombay 14 th March, 2011 Bracketed Structure: Treebank Corpus [ S1[

More information

CS 545 Lecture XVI: Parsing

CS 545 Lecture XVI: Parsing CS 545 Lecture XVI: Parsing brownies_choco81@yahoo.com brownies_choco81@yahoo.com Benjamin Snyder Parsing Given a grammar G and a sentence x = (x1, x2,..., xn), find the best parse tree. We re not going

More information

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

Computational Linguistics. Acknowledgements. Phrase-Structure Trees. Dependency-based Parsing Computational Linguistics Dependency-based Parsing Dietrich Klakow & Stefan Thater FR 4.7 Allgemeine Linguistik (Computerlinguistik) Universität des Saarlandes Summer 2013 Acknowledgements These slides

More information

INF4820: Algorithms for Artificial Intelligence and Natural Language Processing. Hidden Markov Models

INF4820: Algorithms for Artificial Intelligence and Natural Language Processing. Hidden Markov Models INF4820: Algorithms for Artificial Intelligence and Natural Language Processing Hidden Markov Models Murhaf Fares & Stephan Oepen Language Technology Group (LTG) October 27, 2016 Recap: Probabilistic Language

More information

a) b) (Natural Language Processing; NLP) (Deep Learning) Bag of words White House RGB [1] IBM

a) b) (Natural Language Processing; NLP) (Deep Learning) Bag of words White House RGB [1] IBM c 1. (Natural Language Processing; NLP) (Deep Learning) RGB IBM 135 8511 5 6 52 yutat@jp.ibm.com a) b) 2. 1 0 2 1 Bag of words White House 2 [1] 2015 4 Copyright c by ORSJ. Unauthorized reproduction of

More information

Improving Sequence-to-Sequence Constituency Parsing

Improving Sequence-to-Sequence Constituency Parsing Improving Sequence-to-Sequence Constituency Parsing Lemao Liu, Muhua Zhu and Shuming Shi Tencent AI Lab, Shenzhen, China {redmondliu,muhuazhu, shumingshi}@tencent.com Abstract Sequence-to-sequence constituency

More information

Alessandro Mazzei MASTER DI SCIENZE COGNITIVE GENOVA 2005

Alessandro Mazzei MASTER DI SCIENZE COGNITIVE GENOVA 2005 Alessandro Mazzei Dipartimento di Informatica Università di Torino MATER DI CIENZE COGNITIVE GENOVA 2005 04-11-05 Natural Language Grammars and Parsing Natural Language yntax Paolo ama Francesca yntactic

More information

Multi-dimensional Dependency Grammar as Multigraph Description

Multi-dimensional Dependency Grammar as Multigraph Description Multi-dimensional Dependency Grammar as Multigraph Description Ralph Debusmann and Gert Smolka Programming Systems Lab Universität des Saarlandes Postfach 0 0 Saarbrücken, Germany {rade,smolka}@ps.uni-sb.de

More information

Structured Prediction Models via the Matrix-Tree Theorem

Structured Prediction Models via the Matrix-Tree Theorem Structured Prediction Models via the Matrix-Tree Theorem Terry Koo Amir Globerson Xavier Carreras Michael Collins maestro@csail.mit.edu gamir@csail.mit.edu carreras@csail.mit.edu mcollins@csail.mit.edu

More information

c(a) = X c(a! Ø) (13.1) c(a! Ø) ˆP(A! Ø A) = c(a)

c(a) = X c(a! Ø) (13.1) c(a! Ø) ˆP(A! Ø A) = c(a) Chapter 13 Statistical Parsg Given a corpus of trees, it is easy to extract a CFG and estimate its parameters. Every tree can be thought of as a CFG derivation, and we just perform relative frequency estimation

More information

Statistical Methods for NLP

Statistical Methods for NLP Statistical Methods for NLP Sequence Models Joakim Nivre Uppsala University Department of Linguistics and Philology joakim.nivre@lingfil.uu.se Statistical Methods for NLP 1(21) Introduction Structured

More information

Bayes Risk Minimization in Natural Language Parsing

Bayes Risk Minimization in Natural Language Parsing UNIVERSITE DE GENEVE CENTRE UNIVERSITAIRE D INFORMATIQUE ARTIFICIAL INTELLIGENCE LABORATORY Date: June, 2006 TECHNICAL REPORT Baes Risk Minimization in Natural Language Parsing Ivan Titov Universit of

More information

Personal Project: Shift-Reduce Dependency Parsing

Personal Project: Shift-Reduce Dependency Parsing Personal Project: Shift-Reduce Dependency Parsing 1 Problem Statement The goal of this project is to implement a shift-reduce dependency parser. This entails two subgoals: Inference: We must have a shift-reduce

More information

Proposition Knowledge Graphs. Gabriel Stanovsky Omer Levy Ido Dagan Bar-Ilan University Israel

Proposition Knowledge Graphs. Gabriel Stanovsky Omer Levy Ido Dagan Bar-Ilan University Israel Proposition Knowledge Graphs Gabriel Stanovsky Omer Levy Ido Dagan Bar-Ilan University Israel 1 Problem End User 2 Case Study: Curiosity (Mars Rover) Curiosity is a fully equipped lab. Curiosity is a rover.

More information

Part of Speech Tagging: Viterbi, Forward, Backward, Forward- Backward, Baum-Welch. COMP-599 Oct 1, 2015

Part of Speech Tagging: Viterbi, Forward, Backward, Forward- Backward, Baum-Welch. COMP-599 Oct 1, 2015 Part of Speech Tagging: Viterbi, Forward, Backward, Forward- Backward, Baum-Welch COMP-599 Oct 1, 2015 Announcements Research skills workshop today 3pm-4:30pm Schulich Library room 313 Start thinking about

More information

High-Order Low-Rank Tensors for Semantic Role Labeling

High-Order Low-Rank Tensors for Semantic Role Labeling High-Order Low-Rank Tensors for Semantic Role Labeling Tao Lei 1, Yuan Zhang 1, Lluís Màrquez 2, Alessandro Moschitti 2, and Regina Barzilay 1 1 Computer Science and Artificial Intelligence Laboratory,

More information

Spatial Role Labeling: Towards Extraction of Spatial Relations from Natural Language

Spatial Role Labeling: Towards Extraction of Spatial Relations from Natural Language Spatial Role Labeling: Towards Extraction of Spatial Relations from Natural Language PARISA KORDJAMSHIDI, MARTIJN VAN OTTERLO and MARIE-FRANCINE MOENS Katholieke Universiteit Leuven This article reports

More information

Extraction of Opposite Sentiments in Classified Free Format Text Reviews

Extraction of Opposite Sentiments in Classified Free Format Text Reviews Extraction of Opposite Sentiments in Classified Free Format Text Reviews Dong (Haoyuan) Li 1, Anne Laurent 2, Mathieu Roche 2, and Pascal Poncelet 1 1 LGI2P - École des Mines d Alès, Parc Scientifique

More information

Multi-Component Word Sense Disambiguation

Multi-Component Word Sense Disambiguation Multi-Component Word Sense Disambiguation Massimiliano Ciaramita and Mark Johnson Brown University BLLIP: http://www.cog.brown.edu/research/nlp Ciaramita and Johnson 1 Outline Pattern classification for

More information

Spectral Unsupervised Parsing with Additive Tree Metrics

Spectral Unsupervised Parsing with Additive Tree Metrics Spectral Unsupervised Parsing with Additive Tree Metrics Ankur Parikh, Shay Cohen, Eric P. Xing Carnegie Mellon, University of Edinburgh Ankur Parikh 2014 1 Overview Model: We present a novel approach

More information

Marrying Dynamic Programming with Recurrent Neural Networks

Marrying Dynamic Programming with Recurrent Neural Networks Marrying Dynamic Programming with Recurrent Neural Networks I eat sushi with tuna from Japan Liang Huang Oregon State University Structured Prediction Workshop, EMNLP 2017, Copenhagen, Denmark Marrying

More information

The Noisy Channel Model and Markov Models

The Noisy Channel Model and Markov Models 1/24 The Noisy Channel Model and Markov Models Mark Johnson September 3, 2014 2/24 The big ideas The story so far: machine learning classifiers learn a function that maps a data item X to a label Y handle

More information

Jointly Extracting Event Triggers and Arguments by Dependency-Bridge RNN and Tensor-Based Argument Interaction

Jointly Extracting Event Triggers and Arguments by Dependency-Bridge RNN and Tensor-Based Argument Interaction Jointly Extracting Event Triggers and Arguments by Dependency-Bridge RNN and Tensor-Based Argument Interaction Feng Qian,LeiSha, Baobao Chang, Zhifang Sui Institute of Computational Linguistics, Peking

More information

AN ABSTRACT OF THE DISSERTATION OF

AN ABSTRACT OF THE DISSERTATION OF AN ABSTRACT OF THE DISSERTATION OF Kai Zhao for the degree of Doctor of Philosophy in Computer Science presented on May 30, 2017. Title: Structured Learning with Latent Variables: Theory and Algorithms

More information

Support Vector Machines

Support Vector Machines Support Vector Machines Reading: Ben-Hur & Weston, A User s Guide to Support Vector Machines (linked from class web page) Notation Assume a binary classification problem. Instances are represented by vector

More information

Intelligent Systems (AI-2)

Intelligent Systems (AI-2) Intelligent Systems (AI-2) Computer Science cpsc422, Lecture 19 Oct, 23, 2015 Slide Sources Raymond J. Mooney University of Texas at Austin D. Koller, Stanford CS - Probabilistic Graphical Models D. Page,

More information

INF4820: Algorithms for Artificial Intelligence and Natural Language Processing. Hidden Markov Models

INF4820: Algorithms for Artificial Intelligence and Natural Language Processing. Hidden Markov Models INF4820: Algorithms for Artificial Intelligence and Natural Language Processing Hidden Markov Models Murhaf Fares & Stephan Oepen Language Technology Group (LTG) October 18, 2017 Recap: Probabilistic Language

More information

Classification & Information Theory Lecture #8

Classification & Information Theory Lecture #8 Classification & Information Theory Lecture #8 Introduction to Natural Language Processing CMPSCI 585, Fall 2007 University of Massachusetts Amherst Andrew McCallum Today s Main Points Automatically categorizing

More information

Intelligent Systems (AI-2)

Intelligent Systems (AI-2) Intelligent Systems (AI-2) Computer Science cpsc422, Lecture 19 Oct, 24, 2016 Slide Sources Raymond J. Mooney University of Texas at Austin D. Koller, Stanford CS - Probabilistic Graphical Models D. Page,

More information

Information Extraction from Text

Information Extraction from Text Information Extraction from Text Jing Jiang Chapter 2 from Mining Text Data (2012) Presented by Andrew Landgraf, September 13, 2013 1 What is Information Extraction? Goal is to discover structured information

More information

Parsing with Context-Free Grammars

Parsing with Context-Free Grammars Parsing with Context-Free Grammars CS 585, Fall 2017 Introduction to Natural Language Processing http://people.cs.umass.edu/~brenocon/inlp2017 Brendan O Connor College of Information and Computer Sciences

More information

This kind of reordering is beyond the power of finite transducers, but a synchronous CFG can do this.

This kind of reordering is beyond the power of finite transducers, but a synchronous CFG can do this. Chapter 12 Synchronous CFGs Synchronous context-free grammars are a generalization of CFGs that generate pairs of related strings instead of single strings. They are useful in many situations where one

More information

Boosting Applied to Tagging and PP Attachment

Boosting Applied to Tagging and PP Attachment Boosting Applied to Tagging and PP Attachment Steven Abney Robert E. Schapire Yoram Singer AT&T Labs Research 180 Park Avenue Florham Park, NJ 07932 {abney, schapire, singer}@research.att.com Abstract

More information

NLP Programming Tutorial 11 - The Structured Perceptron

NLP Programming Tutorial 11 - The Structured Perceptron NLP Programming Tutorial 11 - The Structured Perceptron Graham Neubig Nara Institute of Science and Technology (NAIST) 1 Prediction Problems Given x, A book review Oh, man I love this book! This book is

More information

arxiv: v2 [cs.cl] 20 Aug 2016

arxiv: v2 [cs.cl] 20 Aug 2016 Solving General Arithmetic Word Problems Subhro Roy and Dan Roth University of Illinois, Urbana Champaign {sroy9, danr}@illinois.edu arxiv:1608.01413v2 [cs.cl] 20 Aug 2016 Abstract This paper presents

More information

CS460/626 : Natural Language

CS460/626 : Natural Language CS460/626 : Natural Language Processing/Speech, NLP and the Web (Lecture 27 SMT Assignment; HMM recap; Probabilistic Parsing cntd) Pushpak Bhattacharyya CSE Dept., IIT Bombay 17 th March, 2011 CMU Pronunciation

More information

INF4820: Algorithms for Artificial Intelligence and Natural Language Processing. Language Models & Hidden Markov Models

INF4820: Algorithms for Artificial Intelligence and Natural Language Processing. Language Models & Hidden Markov Models 1 University of Oslo : Department of Informatics INF4820: Algorithms for Artificial Intelligence and Natural Language Processing Language Models & Hidden Markov Models Stephan Oepen & Erik Velldal Language

More information

Tuning as Linear Regression

Tuning as Linear Regression Tuning as Linear Regression Marzieh Bazrafshan, Tagyoung Chung and Daniel Gildea Department of Computer Science University of Rochester Rochester, NY 14627 Abstract We propose a tuning method for statistical

More information

A proof theoretical account of polarity items and monotonic inference.

A proof theoretical account of polarity items and monotonic inference. A proof theoretical account of polarity items and monotonic inference. Raffaella Bernardi UiL OTS, University of Utrecht e-mail: Raffaella.Bernardi@let.uu.nl Url: http://www.let.uu.nl/ Raffaella.Bernardi/personal

More information

Latent Dirichlet Allocation Introduction/Overview

Latent Dirichlet Allocation Introduction/Overview Latent Dirichlet Allocation Introduction/Overview David Meyer 03.10.2016 David Meyer http://www.1-4-5.net/~dmm/ml/lda_intro.pdf 03.10.2016 Agenda What is Topic Modeling? Parametric vs. Non-Parametric Models

More information

Department of Computer Science and Engineering Indian Institute of Technology, Kanpur. Spatial Role Labeling

Department of Computer Science and Engineering Indian Institute of Technology, Kanpur. Spatial Role Labeling Department of Computer Science and Engineering Indian Institute of Technology, Kanpur CS 365 Artificial Intelligence Project Report Spatial Role Labeling Submitted by Satvik Gupta (12633) and Garvit Pahal

More information

Knowledge representation DATA INFORMATION KNOWLEDGE WISDOM. Figure Relation ship between data, information knowledge and wisdom.

Knowledge representation DATA INFORMATION KNOWLEDGE WISDOM. Figure Relation ship between data, information knowledge and wisdom. Knowledge representation Introduction Knowledge is the progression that starts with data which s limited utility. Data when processed become information, information when interpreted or evaluated becomes

More information

Deep Learning for NLP Part 2

Deep Learning for NLP Part 2 Deep Learning for NLP Part 2 CS224N Christopher Manning (Many slides borrowed from ACL 2012/NAACL 2013 Tutorials by me, Richard Socher and Yoshua Bengio) 2 Part 1.3: The Basics Word Representations The

More information

Quasi-Synchronous Phrase Dependency Grammars for Machine Translation. lti

Quasi-Synchronous Phrase Dependency Grammars for Machine Translation. lti Quasi-Synchronous Phrase Dependency Grammars for Machine Translation Kevin Gimpel Noah A. Smith 1 Introduction MT using dependency grammars on phrases Phrases capture local reordering and idiomatic translations

More information

Deep Learning for NLP

Deep Learning for NLP Deep Learning for NLP Instructor: Wei Xu Ohio State University CSE 5525 Many slides from Greg Durrett Outline Motivation for neural networks Feedforward neural networks Applying feedforward neural networks

More information

An Introduction to String Re-Writing Kernel

An Introduction to String Re-Writing Kernel An Introduction to String Re-Writing Kernel Fan Bu 1, Hang Li 2 and Xiaoyan Zhu 3 1,3 State Key Laboratory of Intelligent Technology and Systems 1,3 Tsinghua National Laboratory for Information Sci. and

More information

Lab 12: Structured Prediction

Lab 12: Structured Prediction December 4, 2014 Lecture plan structured perceptron application: confused messages application: dependency parsing structured SVM Class review: from modelization to classification What does learning mean?

More information

CS460/626 : Natural Language

CS460/626 : Natural Language CS460/626 : Natural Language Processing/Speech, NLP and the Web (Lecture 23, 24 Parsing Algorithms; Parsing in case of Ambiguity; Probabilistic Parsing) Pushpak Bhattacharyya CSE Dept., IIT Bombay 8 th,

More information