INSTITUTE OF COMPUTING TECHNOLOGY Forest-based Semantic Role Labeling Hao Xiong, Haitao Mi, Yang Liu and Qun Liu Institute of Computing Technology Academy.

Slides:



Advertisements
Similar presentations
Feature Forest Models for Syntactic Parsing Yusuke Miyao University of Tokyo.
Advertisements

School of something FACULTY OF OTHER School of Computing FACULTY OF ENGINEERING Chunking: Shallow Parsing Eric Atwell, Language Research Group.
Computational language: week 10 Lexical Knowledge Representation concluded Syntax-based computational language Sentence structure: syntax Context free.
SEMANTIC ROLE LABELING BY TAGGING SYNTACTIC CHUNKS
Levenshtein-distance-based post-processing shared task spotlight Antal van den Bosch ILK / CL and AI, Tilburg University Ninth Conference on Computational.
Albert Gatt Corpora and Statistical Methods Lecture 11.
Progress update Lin Ziheng. System overview 2 Components – Connective classifier Features from Pitler and Nenkova (2009): – Connective: because – Self.
Page 1 SRL via Generalized Inference Vasin Punyakanok, Dan Roth, Wen-tau Yih, Dav Zimak, Yuancheng Tu Department of Computer Science University of Illinois.
Proceedings of the Conference on Intelligent Text Processing and Computational Linguistics (CICLing-2007) Learning for Semantic Parsing Advisor: Hsin-His.
Layering Semantics (Putting meaning into trees) Treebank Workshop Martha Palmer April 26, 2007.
Max-Margin Matching for Semantic Role Labeling David Vickrey James Connor Daphne Koller Stanford University.
计算机科学与技术学院 Chinese Semantic Role Labeling with Dependency-driven Constituent Parse Tree Structure Hongling Wang, Bukang Wang Guodong Zhou NLP Lab, School.
Semantic Role Labeling Abdul-Lateef Yussiff
A Joint Model For Semantic Role Labeling Aria Haghighi, Kristina Toutanova, Christopher D. Manning Computer Science Department Stanford University.
Learning with Probabilistic Features for Improved Pipeline Models Razvan C. Bunescu Electrical Engineering and Computer Science Ohio University Athens,
Recognizing Implicit Discourse Relations in the Penn Discourse Treebank Ziheng Lin, Min-Yen Kan, and Hwee Tou Ng Department of Computer Science National.
Towards Parsing Unrestricted Text into PropBank Predicate- Argument Structures ACL4 Project NCLT Seminar Presentation, 7th June 2006 Conor Cafferkey.
Shallow Parsing CS 4705 Julia Hirschberg 1. Shallow or Partial Parsing Sometimes we don’t need a complete parse tree –Information extraction –Question.
Introduction to treebanks Session 1: 7/08/
PCFG Parsing, Evaluation, & Improvements Ling 571 Deep Processing Techniques for NLP January 24, 2011.
SRL using complete syntactic analysis Mihai Surdeanu and Jordi Turmo TALP Research Center Universitat Politècnica de Catalunya.
Two-Phase Semantic Role Labeling based on Support Vector Machines Kyung-Mi Park Young-Sook Hwang Hae-Chang Rim NLP Lab. Korea Univ.
Page 1 Generalized Inference with Multiple Semantic Role Labeling Systems Peter Koomen, Vasin Punyakanok, Dan Roth, (Scott) Wen-tau Yih Department of Computer.
A Memory-Based Approach to Semantic Role Labeling Beata Kouchnir Tübingen University 05/07/04.
Approximate Factoring for A* Search Aria Haghighi, John DeNero, and Dan Klein Computer Science Division University of California Berkeley.
Probabilistic Parsing Ling 571 Fei Xia Week 5: 10/25-10/27/05.
Czech-to-English Translation: MT Marathon 2009 Session Preview Jonathan Clark Greg Hanneman Language Technologies Institute Carnegie Mellon University.
11 CS 388: Natural Language Processing: Syntactic Parsing Raymond J. Mooney University of Texas at Austin.
Extracting Opinions, Opinion Holders, and Topics Expressed in Online News Media Text Soo-Min Kim and Eduard Hovy USC Information Sciences Institute 4676.
STRUCTURED PERCEPTRON Alice Lai and Shi Zhi. Presentation Outline Introduction to Structured Perceptron ILP-CRF Model Averaged Perceptron Latent Variable.
Semantic Role Labeling
1 CS546: Machine Learning and Natural Language Preparation to the Term Project: - Dependency Parsing - Dependency Representation for Semantic Role Labeling.
Empirical Methods in Information Extraction Claire Cardie Appeared in AI Magazine, 18:4, Summarized by Seong-Bae Park.
1 Data-Driven Dependency Parsing. 2 Background: Natural Language Parsing Syntactic analysis String to (tree) structure He likes fish S NP VP NP VNPrn.
Authors: Ting Wang, Yaoyong Li, Kalina Bontcheva, Hamish Cunningham, Ji Wang Presented by: Khalifeh Al-Jadda Automatic Extraction of Hierarchical Relations.
Extracting Semantic Constraint from Description Text for Semantic Web Service Discovery Dengping Wei, Ting Wang, Ji Wang, and Yaodong Chen Reporter: Ting.
Syntax The study of how words are ordered and grouped together Key concept: constituent = a sequence of words that acts as a unit he the man the short.
Ling 570 Day 17: Named Entity Recognition Chunking.
HW7 Extracting Arguments for % Ang Sun March 25, 2012.
Part-Of-Speech Tagging using Neural Networks Ankur Parikh LTRC IIIT Hyderabad
Semantic Role Labeling for Arabic using Kernel Methods Mona Diab Alessandro Moschitti Daniele Pighin.
1 CS546: Machine Learning and Natural Language Latent-Variable Models for Structured Prediction Problems: Syntactic Parsing Slides / Figures from Slav.
The ICT Statistical Machine Translation Systems for IWSLT 2007 Zhongjun He, Haitao Mi, Yang Liu, Devi Xiong, Weihua Luo, Yun Huang, Zhixiang Ren, Yajuan.
AQUAINT Workshop – June 2003 Improved Semantic Role Parsing Kadri Hacioglu, Sameer Pradhan, Valerie Krugler, Steven Bethard, Ashley Thornton, Wayne Ward,
A Cascaded Finite-State Parser for German Michael Schiehlen Institut für Maschinelle Sprachverarbeitung Universität Stuttgart
A Systematic Exploration of the Feature Space for Relation Extraction Jing Jiang & ChengXiang Zhai Department of Computer Science University of Illinois,
Coarse-to-Fine Efficient Viterbi Parsing Nathan Bodenstab OGI RPE Presentation May 8, 2006.
INSTITUTE OF COMPUTING TECHNOLOGY Forest-to-String Statistical Translation Rules Yang Liu, Qun Liu, and Shouxun Lin Institute of Computing Technology Chinese.
Supertagging CMSC Natural Language Processing January 31, 2006.
Support Vector Machines and Kernel Methods for Co-Reference Resolution 2007 Summer Workshop on Human Language Technology Center for Language and Speech.
11 Project, Part 3. Outline Basics of supervised learning using Naïve Bayes (using a simpler example) Features for the project 2.
FILTERED RANKING FOR BOOTSTRAPPING IN EVENT EXTRACTION Shasha Liao Ralph York University.
NLP. Introduction to NLP Last week, Min broke the window with a hammer. The window was broken with a hammer by Min last week With a hammer, Min broke.
A Fast Finite-state Relaxation Method for Enforcing Global Constraints on Sequence Decoding Roy Tromble & Jason Eisner Johns Hopkins University.
NLP. Parsing ( (S (NP-SBJ (NP (NNP Pierre) (NNP Vinken) ) (,,) (ADJP (NP (CD 61) (NNS years) ) (JJ old) ) (,,) ) (VP (MD will) (VP (VB join) (NP (DT.
Department of Computer Science The University of Texas at Austin USA Joint Entity and Relation Extraction using Card-Pyramid Parsing Rohit J. Kate Raymond.
Prototype-Driven Grammar Induction Aria Haghighi and Dan Klein Computer Science Division University of California Berkeley.
Dependency Parsing Niranjan Balasubramanian March 24 th 2016 Credits: Many slides from: Michael Collins, Mausam, Chris Manning, COLNG 2014 Dependency Parsing.
Dan Roth University of Illinois, Urbana-Champaign 7 Sequential Models Tutorial on Machine Learning in Natural.
Lec. 10.  In this section we explain which constituents of a sentence are minimally required, and why. We first provide an informal discussion and then.
Semantic Role Labelling Using Chunk Sequences Ulrike Baldewein Katrin Erk Sebastian Padó Saarland University Saarbrücken Detlef Prescher Amsterdam University.
Roadmap Probabilistic CFGs –Handling ambiguity – more likely analyses –Adding probabilities Grammar Parsing: probabilistic CYK Learning probabilities:
COSC 6336: Natural Language Processing
Statistical NLP Winter 2009
CSC 594 Topics in AI – Natural Language Processing
CIS 700 Advanced Machine Learning Structured Machine Learning:   Theory and Applications in Natural Language Processing Shyam Upadhyay Department of.
Lei Sha, Jing Liu, Chin-Yew Lin, Sujian Li, Baobao Chang, Zhifang Sui
Johns Hopkins 2003 Summer Workshop on Syntax and Statistical Machine Translation Chapters 5-8 Ethan Phelps-Goodman.
Progress report on Semantic Role Labeling
Rule Markov Models for Fast Tree-to-String Translation
Presentation transcript:

INSTITUTE OF COMPUTING TECHNOLOGY Forest-based Semantic Role Labeling Hao Xiong, Haitao Mi, Yang Liu and Qun Liu Institute of Computing Technology Academy of Chinese Sciences AAAI 2010, Atlanta7/15/101

INSTITUTE OF COMPUTING TECHNOLOGY Semantic Role Labeling Given a sentence and its verbs Identify the arguments of the verbs Assign semantic labels (the roles they play) This company last year1000 cars in the U.S. sold Agent Patient ArgMod -TeMPoral ArgMod -TeMPoral ArgMod -LOCation ArgMod -LOCation PropBank (Kingsbury and Palmer 2002) 7/15/102

INSTITUTE OF COMPUTING TECHNOLOGY One Conventional Approach the roleof Celimeneisplayedby Kim Cattrall Patient Agent AAAI 2010, Atlanta7/15/103

INSTITUTE OF COMPUTING TECHNOLOGY One Conventional Approach the roleof Celimeneisplayedby Kim Cattrall PatientAgent S NP PP VP AUXVBNPP VP NP AAAI 2010, Atlanta7/15/104

INSTITUTE OF COMPUTING TECHNOLOGY One Conventional Approach the roleof Celimeneisplayedby Kim Cattrall PatientAgent S NP PP VP AUXVBNPP VP ? more than 15% AAAI 2010, Atlanta7/15/105

INSTITUTE OF COMPUTING TECHNOLOGY … 12 3 k … Solution k-best parses: limited scope: k too much redundancy 2 5 <50<2 6 S NP PP VP AUXVBNPP VP NP S PP VP AUXVBNPP VP … AAAI 2010, Atlanta7/15/106

INSTITUTE OF COMPUTING TECHNOLOGY Our Solution Forest A compact representation of many parses By sharing common sub-derivations Polynomial-space encoding of exponentially large set S NPPP VP AUXVBNPP NP VP S NP PP VP AUXVBNPP VP NP S PP VP AUXVBNPP VP … Unpack AAAI 2010, Atlanta7/15/107

INSTITUTE OF COMPUTING TECHNOLOGY Our Solution Forest A compact representation of many parses By sharing common sub-derivations Polynomial-space encoding of exponentially large set S NPPP VP AUXVBNPP NP VP AAAI 2010, Atlanta7/15/108

INSTITUTE OF COMPUTING TECHNOLOGY Outline Tree-based Semantic Role Labeling Parsing Selecting candidates Extracting features Classifying Forest-based Semantic Role Labeling Experiments Conclusion AAAI 2010, Atlanta7/15/109

INSTITUTE OF COMPUTING TECHNOLOGY Parsing S NP VP DTNNJJNNVBDNPPP CDNNSINNP NNPDT Thiscompanylastyear sold 1000carsin theU.S. AAAI 2010, Atlanta7/15/1010

INSTITUTE OF COMPUTING TECHNOLOGY Selecting Candidates S NP VP DTNNJJNNVBDNPPP CD NNS INNP NNPDT sold Thiscompanylastyear 1000carsin theU.S. AAAI 2010, Atlanta7/15/1011

INSTITUTE OF COMPUTING TECHNOLOGY Extracting Features S NP VP DTNNJJNNVBDNPPP CDNNSINNP NNPDT Thiscompanylastyear sold 1000carsin theU.S. Path to the predicate Thiscompanylastyear 1000carsin theU.S. NNS NP  S  VP  VBN AAAI 2010, Atlanta7/15/1012

INSTITUTE OF COMPUTING TECHNOLOGY Extracting Features S NP VP DTNNJJNNVBDNPPP CDINNP NNPDT Thiscompanylastyear sold 1000carsin theU.S. Position: left Thiscompanylastyear 1000carsin theU.S. NNS NP  S  VP  VBN left AAAI 2010, Atlanta7/15/1013

INSTITUTE OF COMPUTING TECHNOLOGY Extracting Features S NP VP DTNNJJNNVBDNPPP CDINNP NNPDT Thiscompanylastyear sold 1000carsin theU.S. Head word: company Thiscompanylastyear 1000carsin theU.S. NNS NP  S  VP  VBN left company AAAI 2010, Atlanta7/15/1014

INSTITUTE OF COMPUTING TECHNOLOGY Extracting Features S NP VP DTNNJJNNVBDNPPP CDINNP NNPDT Thiscompanylastyear sold 1000carsin theU.S. Head POS tag: NN Thiscompanylastyear 1000carsin theU.S. NNS NP  S  VP  VBN left company NN … AAAI 2010, Atlanta7/15/1015

INSTITUTE OF COMPUTING TECHNOLOGY Classifying S NP VP DTNNJJNNVBDNPPP CDINNP NNPDT Thiscompanylastyear sold 1000carsin theU.S. S(Agent)=0.1 S(Patient)=0.1 S(None)=0.5 … S(AM-TMP)=0.9 S(Patient)=0.1 S(None)=0.1 … S(Agent)=0.2 S(Patient)=0.8 S(None)=0.1 … S(Agent)=0.8 S(Patient)=0.1 S(None)=0.1 … S(AM-LOC)=0.9 S(Agent)=0.1 S(None)=0.1 … Computing Score using a trained classifier Thiscompanylastyear 1000carsin theU.S. NNS 16

INSTITUTE OF COMPUTING TECHNOLOGY Classifying S NP VP DTNNJJNNVBDNPPP CDINNP NNPDT Thiscompanylastyear sold 1000carsin theU.S. S(Agent)=0.8 … S(AM-LOC)=0.9 … Thiscompanylastyear 1000carsin theU.S. NNS S(None)=0.5 … S(AM-TMP)=0.9 … S(Patient)=0.8 … Best score for each constituent Simply sort them Choose the best label sequence NP 17

INSTITUTE OF COMPUTING TECHNOLOGY Classifying S NP VP DTNNJJNNVBDNPPP CDINNP NNPDT Thiscompanylastyear sold 1000carsin theU.S. Agent AM-TMPV Patient AM-LOC Thiscompanylastyear 1000carsin theU.S. NNS 18

INSTITUTE OF COMPUTING TECHNOLOGY Outline Tree-based Semantic Role Labeling Forest-based Semantic Role Labeling Parsing into a forest Selecting candidates Extracting features on forest Classifying Experiments Conclusion AAAI 2010, Atlanta7/15/1019

INSTITUTE OF COMPUTING TECHNOLOGY Forest the roleof Celimene is played by Kim Cattrall S NPPP VP AUXVBNPP NP VP Hyper-graph Hyper-edge Node AAAI 2010, Atlanta7/15/1020

INSTITUTE OF COMPUTING TECHNOLOGY Selecting Candidates the roleof Celimene is played by Kim Cattrall S NPPP VP AUXVBNPP NP VP AAAI 2010, Atlanta7/15/1021

INSTITUTE OF COMPUTING TECHNOLOGY Exacting features Path to the predicate the roleof Celimene is played by Kim Cattrall S NPPP VP AUXVBNPP NP VP NP  NP  S  VP  VP  VBN AAAI 2010, Atlanta7/15/1022

INSTITUTE OF COMPUTING TECHNOLOGY Exacting features Path to the predicate the roleof Celimene is played by Kim Cattrall S NPPP VP AUXVBNPP NP VP NP  S  VP  VP  VBN NP  NP  S  VP  VP  VBN shortest AAAI 2010, Atlanta7/15/1023

INSTITUTE OF COMPUTING TECHNOLOGY Exacting features Parent Label NP  S  VP  VP  VBN the roleof Celimene is played by Kim Cattrall S NPPP VP AUXVBNPP NP VP AAAI 2010, Atlanta7/15/1024

INSTITUTE OF COMPUTING TECHNOLOGY Exacting features Parent Label the roleof Celimene is played by Kim Cattrall NPPP VP AUXVBNPP VP NP  S  VP  VP  VBN in the shortest path AAAI 2010, Atlanta7/15/1025

INSTITUTE OF COMPUTING TECHNOLOGY New Features Parsing score (Fractional value (Mi et al., 2008)) Inside-outside Marginal prob. the roleof Celimene is played by Kim Cattrall S NPPP VP AUXVBNPP NP VP NP  S  VP  VP  VBN f(NP 3 ) AAAI 2010, Atlanta7/15/1026

INSTITUTE OF COMPUTING TECHNOLOGY Classifying S(Patient)=0.8 S(Agent)=0.1 S(None)=0.2 … S(Patient)=0.5 S(Agent)=0.1 S(None)=0.3 … the roleof Celimene is played by Kim Cattrall S NPPP VP AUXVBNPP NP VP S(Agent)=0.8 S(Patient)=0.1 S(None)=0.2 … AAAI 2010, Atlanta7/15/1027

INSTITUTE OF COMPUTING TECHNOLOGY Classifying S(Patient)=0.8 … the roleof Celimene is played by Kim Cattrall S NP PP VP AUXVBNPP NP VP S(Agent)=0.8 … PatientAgent AAAI 2010, Atlanta7/15/1028

INSTITUTE OF COMPUTING TECHNOLOGY Outline Tree-based Semantic Role Labeling Forest-based Semantic Role Labeling Experiments Conclusion AAAI 2010, Atlanta7/15/1029

INSTITUTE OF COMPUTING TECHNOLOGY Experiments Corpus: CoNLL-2005 shared task Sections of PropBank for training Section 24 for development set Section 23 for test set Total 43,594 sentences 262,281 arguments AAAI 2010, Atlanta7/15/1030

INSTITUTE OF COMPUTING TECHNOLOGY Experiments Training sentences Parse into 1-best and forest Prune forest using inside-outside algorithm Train classifiers Decoding sentences Parse into 1-best and forest Prune forest using inside-outside algorithm Use classifiers AAAI 2010, Atlanta7/15/1031

INSTITUTE OF COMPUTING TECHNOLOGY Features Predicate lemma Path to predicate Path length Partial path Position Voice Head word/POS tag … AAAI 2010, Atlanta7/15/1032

INSTITUTE OF COMPUTING TECHNOLOGY Results on Dev Set precision recall F 1-best 50-best forest(p3) 9.63×10 5 forest(p5) 5.78×

INSTITUTE OF COMPUTING TECHNOLOGY Results on Tst Set AAAI 2010, Atlanta7/15/1034

INSTITUTE OF COMPUTING TECHNOLOGY Outline Tree-based Semantic Role Labeling Forest-based Semantic Role Labeling Experiments Conclusion AAAI 2010, Atlanta7/15/1035

INSTITUTE OF COMPUTING TECHNOLOGY Conclusion Forest Exponentially encode many parses Enlarge the candidate space Explore more rich features Improve the quality significantly Not necessary using very large forest Can NOT use k-best to simulate Future works Features on forest AAAI 2010, Atlanta7/15/1036

INSTITUTE OF COMPUTING TECHNOLOGY Thank you! Patient AAAI 2010, Atlanta7/15/1037