Presented by Rani Qumsiyeh & Andrew Zitzelberger.

Slides:



Advertisements
Similar presentations
Computational language: week 10 Lexical Knowledge Representation concluded Syntax-based computational language Sentence structure: syntax Context free.
Advertisements

CILC2011 A framework for structured knowledge extraction and representation from natural language via deep sentence analysis Stefania Costantini Niva Florio.
Mustafa Cayci INFS 795 An Evaluation on Feature Selection for Text Clustering.
Learning Semantic Information Extraction Rules from News The Dutch-Belgian Database Day 2013 (DBDBD 2013) Frederik Hogenboom Erasmus.
Statistical Methods and Linguistics - Steven Abney Thur. POSTECH Computer Science NLP Lab Shim Jun-Hyuk.
1 Developing Statistic-based and Rule-based Grammar Checkers for Chinese ESL Learners Howard Chen Department of English National Taiwan Normal University.
Research topics Semantic Web - Spring 2007 Computer Engineering Department Sharif University of Technology.
Predicting the Semantic Orientation of Adjective Vasileios Hatzivassiloglou and Kathleen R. McKeown Presented By Yash Satsangi.
KnowItNow: Fast, Scalable Information Extraction from the Web Michael J. Cafarella, Doug Downey, Stephen Soderland, Oren Etzioni.
Gimme’ The Context: Context- driven Automatic Semantic Annotation with CPANKOW Philipp Cimiano et al.
Language, Mind, and Brain by Ewa Dabrowska Chapter 2: Language processing: speed and flexibility.
Designing clustering methods for ontology building: The Mo’K workbench Authors: Gilles Bisson, Claire Nédellec and Dolores Cañamero Presenter: Ovidiu Fortu.
Article by: Feiyu Xu, Daniela Kurz, Jakub Piskorski, Sven Schmeier Article Summary by Mark Vickers.
Text Mining: Finding Nuggets in Mountains of Textual Data Jochen Dijrre, Peter Gerstl, Roland Seiffert Presented by Huimin Ye.
Text Mining: Finding Nuggets in Mountains of Textual Data Jochen Dijrre, Peter Gerstl, Roland Seiffert Presented by Drew DeHaas.
1. Introduction Which rules to describe Form and Function Type versus Token 2 Discourse Grammar Appreciation.
Detection of Relations in Textual Documents Manuela Kunze, Dietmar Rösner University of Magdeburg C Knowledge Based Systems and Document Processing.
SI485i : NLP Set 9 Advanced PCFGs Some slides from Chris Manning.
Mining and Summarizing Customer Reviews
Disambiguation of References to Individuals Levon Lloyd (State University of New York) Varun Bhagwan, Daniel Gruhl (IBM Research Center) Varun Bhagwan,
INTRODUCTION TO ARTIFICIAL INTELLIGENCE Massimo Poesio Unsupervised and Semi-Supervised Relation Extraction.
Thumbs Up or Thumbs Down? Semantic Orientation Applied to Unsupervised Classification on Reviews Peter D. Turney Institute for Information Technology National.
Empirical Methods in Information Extraction Claire Cardie Appeared in AI Magazine, 18:4, Summarized by Seong-Bae Park.
1 Statistical NLP: Lecture 10 Lexical Acquisition.
Automatic Lexical Annotation Applied to the SCARLET Ontology Matcher Laura Po and Sonia Bergamaschi DII, University of Modena and Reggio Emilia, Italy.
A Survey of NLP Toolkits Jing Jiang Mar 8, /08/20072 Outline WordNet Statistics-based phrases POS taggers Parsers Chunkers (syntax-based phrases)
ONTOLOGY LEARNING AND POPULATION FROM FROM TEXT Ch8 Population.
Distributional Part-of-Speech Tagging Hinrich Schütze CSLI, Ventura Hall Stanford, CA , USA NLP Applications.
2007. Software Engineering Laboratory, School of Computer Science S E Towards Answering Opinion Questions: Separating Facts from Opinions and Identifying.
Jennie Ning Zheng Linda Melchor Ferhat Omur. Contents Introduction WordNet Application – WordNet Data Structure - WordNet FrameNet Application – FrameNet.
Natural Language Processing Lecture 6 : Revision.
Classifier Evaluation Vasileios Hatzivassiloglou University of Texas at Dallas.
1 Statistical NLP: Lecture 9 Word Sense Disambiguation.
Katrin Erk Vector space models of word meaning. Geometric interpretation of lists of feature/value pairs In cognitive science: representation of a concept.
Recognizing Names in Biomedical Texts: a Machine Learning Approach GuoDong Zhou 1,*, Jie Zhang 1,2, Jian Su 1, Dan Shen 1,2 and ChewLim Tan 2 1 Institute.
A Bootstrapping Method for Building Subjectivity Lexicons for Languages with Scarce Resources Author: Carmen Banea, Rada Mihalcea, Janyce Wiebe Source:
CS 4705 Lecture 19 Word Sense Disambiguation. Overview Selectional restriction based approaches Robust techniques –Machine Learning Supervised Unsupervised.
A Cascaded Finite-State Parser for German Michael Schiehlen Institut für Maschinelle Sprachverarbeitung Universität Stuttgart
Modelling Human Thematic Fit Judgments IGK Colloquium 3/2/2005 Ulrike Padó.
인공지능 연구실 황명진 FSNLP Introduction. 2 The beginning Linguistic science 의 4 부분 –Cognitive side of how human acquire, produce, and understand.
1 Statistical NLP: Lecture 7 Collocations. 2 Introduction 4 Collocations are characterized by limited compositionality. 4 Large overlap between the concepts.
A Scalable Machine Learning Approach for Semi-Structured Named Entity Recognition Utku Irmak(Yahoo! Labs) Reiner Kraft(Yahoo! Inc.) WWW 2010(Information.
1/21 Automatic Discovery of Intentions in Text and its Application to Question Answering (ACL 2005 Student Research Workshop )
Element Level Semantic Matching Pavel Shvaiko Meaning Coordination and Negotiation Workshop, ISWC 8 th November 2004, Hiroshima, Japan Paper by Fausto.
Collocations and Terminology Vasileios Hatzivassiloglou University of Texas at Dallas.
Creating Subjective and Objective Sentence Classifier from Unannotated Texts Janyce Wiebe and Ellen Riloff Department of Computer Science University of.
Introduction Chapter 1 Foundations of statistical natural language processing.
Number Sense Disambiguation Stuart Moore Supervised by: Anna Korhonen (Computer Lab)‏ Sabine Buchholz (Toshiba CRL)‏
Finding frequent and interesting triples in text Janez Brank, Dunja Mladenić, Marko Grobelnik Jožef Stefan Institute, Ljubljana, Slovenia.
Communicative and Academic English for the EFL Professional.
Machine Learning Tutorial-2. Recall, Precision, F-measure, Accuracy Ch. 5.
Commonsense Reasoning in and over Natural Language Hugo Liu, Push Singh Media Laboratory of MIT The 8 th International Conference on Knowledge- Based Intelligent.
Answer Mining by Combining Extraction Techniques with Abductive Reasoning Sanda Harabagiu, Dan Moldovan, Christine Clark, Mitchell Bowden, Jown Williams.
Building Sub-Corpora Suitable for Extraction of Lexico-Syntactic Information Ondřej Bojar, Institute of Formal and Applied Linguistics, ÚFAL.
Finding document topics for improving topic segmentation Source: ACL2007 Authors: Olivier Ferret (18 route du Panorama, BP6) Reporter:Yong-Xiang Chen.
FILTERED RANKING FOR BOOTSTRAPPING IN EVENT EXTRACTION Shasha Liao Ralph York University.
Data Mining and Decision Support
CSA2050: Introduction to Computational Linguistics Part of Speech (POS) Tagging II Transformation Based Tagging Brill (1995)
Learning Event Durations from Event Descriptions Feng Pan, Rutu Mulkar, Jerry R. Hobbs University of Southern California ACL ’ 06.
Short Text Similarity with Word Embedding Date: 2016/03/28 Author: Tom Kenter, Maarten de Rijke Source: CIKM’15 Advisor: Jia-Ling Koh Speaker: Chih-Hsuan.
Identifying Expressions of Opinion in Context Eric Breck and Yejin Choi and Claire Cardie IJCAI 2007.
Language Identification and Part-of-Speech Tagging
Statistical NLP: Lecture 7
Learning Attributes and Relations
Statistical NLP: Lecture 3
CSc4730/6730 Scientific Visualization
Automatic Detection of Causal Relations for Question Answering
CS246: Information Retrieval
Semantic Similarity Methods in WordNet and their Application to Information Retrieval on the Web Yizhe Ge.
Statistical NLP: Lecture 10
Presentation transcript:

Presented by Rani Qumsiyeh & Andrew Zitzelberger

 Common approaches  Collocation analysis: Producing anonymous relations without a label.  Syntactic Dependencies: The dependencies between verbs and arguments.  Hearst’s approach: Matching lexico-syntactic patterns.

 Definition: A pair of words which occur together more often than expected by chance within a certain boundary.  Can be detected by Student’s t-test or X^2 test.  Examples of such techniques are presented in the related work section.

 “A person works for some employer”  Relation: work-for  Concepts: person, employer  The acquisition of selectional restrictions  Detecting verbs denoting the same ontological relation.  Hierarchical ordering of relations.  Discussed later in detail.

 Used to discover very specific relations such as part-of, cause, purpose.  Charniak employed part-of-speech tagging to detect such patterns.  Other approaches to detect causation and purpose relations are discussed later.

 Learning Attributes relying on the syntactic relation between a noun and its modifying adjectives.  Learning Relations on the basis of verbs and their arguments.  Matching lexico-syntactic patterns and aims at learning qualia structures for nouns.

 Attributes are defined as relations with a datatype as range.  Attributes are typically expressed in texts using the preposition of, the verb have or genitive constructs:  the color of the car  every car has a color  the car's color  Peter bought a new car. Its color [...]

 attitude adjectives, expressing the opinion of the speaker such as in 'good house'  temporal adjectives, such as the 'former president' or the 'occasional visitor‘  membership adjectives, such as the 'alleged criminal', a 'fake cowboy‘  event-related adjectives, such as 'abusive speech', in which either the agent of the speech is abusive or the event itself

 Find the corresponding description for the adjective by looking up its corresponding attribute in WordNet.  Consider only those adjectives which do have such an attribute relation.  This increases the probability that the adjective being considered denotes the value of some attribute, quality or property.

 Tokenize and part-of-speech tag the corpus using TreeTagger.  Match to the following two expressions and extract adjective/noun pairs:  (\w+{DET})? (\w+{NN})+ is{VBZ} \w+{JJ}  (\w+{DET})? \w+{JJ} (\w+{NN})+  Cond (n, a) := f(n, a)/f(n)

 Tourism Corpus  Threshold = 0.01  Car

 For each of the adjectives we look up the corresponding attribute in WordNet  age is one of {new, old}  value is one of {black}  numerousness/numerosity/multiplicity is one of {many}  otherness/distinctness/separateness is one of {other}  speed/swiftness/fastness is one of {fast}  size is one of {small, little, big}

 Evaluate for every domain concept according to (i) its attributes and their (ii) corresponding ranges by assigning them a rate from '0' to '3‘ ▪ '3' means that the attribute or its range is totally reasonable and correct. ▪ '0' means that the attribute or the range does not make any sense.

 A new approach that not only lists relations but finds the general relation.  work-for (man, department), work.for (employee, institute), work.for (woman, store)  work-for (person,organization)

 Conditional probability.  Pointwise mutual information (PMI).  A measure based on the x^-test.  Evaluate by applying their approach to the Genia corpus using the Genia ontology

 Extract verb frames using Steven Abney's chunker.  Extract tuples NP-V-NP and NP-V-P-NP.  Construct binary relations from tuples.  Use the lemmatized verb V as corresponding relation label  Use the head of the NP phrases as concepts.

 protein_molecule: 5  Protein_family_or_group: 10  amino-acid: 10

 Take into account the frequency of occurrence.  Chose the highest one

 Penalize concepts c which occur too frequently.  P{amino-acid) = 0.27, P(protein) = 0.14

 Compares contingencies between two variables (the two variables are statistically independent or not)  we can generalize c to ci if the X^2-test reveals the verb v and c to be statistically dependent  Level of significance = 0.05

 the Genia corpus contains sentences with words and verbs.  Extracted 100 relations, 15 were regarded as inappropriate by a biologist evaluator.  The 85 remaining was evaluated  Direct matches for domain and range (DM),  Average distance in terms of number of edges between correct and predicted concept (AD)  A symmetric variant of the Learning Accuracy (LA)

 Nature of Objects  Aristotle  Material cause (made of)  Agentive cause (movement, creation, change)  Formal cause (form, type)  Final cause (purpose, intention, aim)

Generative Lexicon framework [Pustejovsky, 1991] Qualia Structures Constitutive (components) Agentive (created) Formal (hypernym) Telic (function) Knife

 Human  Subjective decisions  Web  Linguistic errors  Ranking errors  Commercial Bias  Erroneous information  Lexical Ambiguity

 Pattern library tuples (p, c)  p is pattern  c is clue (c:string -> string)  Given a term t and a clue c  c(t) is sent to the search engine  π(x) refers to plural forms of x

 Amount words:  variety, bundle, majority, thousands, millions, hundreds, number, numbers, set, sets, series, range  Example:  “A conversation is made up of a series of observable interpersonal exchanges.” ▪ Constitutive role = exchange

PURP:=\w+{VB} NP I NP I be{VB} \w+{VBD}).

 No good patterns  X is made by Y  X is produced by Y  Instead:  Agentive_verbs = {build, produce, make, write, plant, elect, create, cook, construct, design}

 e = element  t = term

 Lexical elements: knife, beer, book, computer  Abstract Noun: conversation  Specific multi-term words:  Natural language processing  Data mining

 Students score  0 = incorrect  1 = not totally wrong  2 = still acceptable  3 = totally correct

Reasoning: Formal and constitutive patterns are more ambiguous.

 Madche and Stabb, 2000  Find relations using association rules  Transaction is defined as words occurring together in syntactic dependency  Calculate support and confidence  Precision = 11%, Recall = 13%

 Kavalec and Svatek, 2005  Added ‘above expectation’ heuristic ▪ Measure association between verb and pair of concepts

 Gamallo et al., 2002  Map syntactic dependencies to semantic relations  1) shallow parser + heuristics to derive syntactic dependencies  2) cluster based on syntactic positions  Problems ▪ Mapping is under specified ▪ Largely domain dependent

 Ciaramita et al., 2005  Statistical dependency parser to extract: ▪ SUBJECT-VERB-DIRECT_OBJECT ▪ SUBJECT-VERB-INDIRECT_OBJECT  χ 2 test – keep those occurring significantly more often than by chance  83% of learned relations are correct  53.1% of generalized relations are correct

 Heyer et al., 2001  Calculate 2 nd order collocations  Use set of defined rules to reason

 Ogata and Collier, 2004  HEARST patterns for extraction  Use heuristic reasoning rules

 Yamaguchi, 2001  Word space algorithm using 4 word window  Cos(angle) measure for similarity ▪ If similarity > threshold relationship  Precision = 59.89% for legal corpus

 Poesio and Almuhareb, 2005  Classify attributes into one of six categories: ▪ Quality, part, related-object, activity, related-agent, non- attribute  Classifier was trained using: ▪ Morphological information, clustering results, search engine results, and heuristics  Better results from combining related-object and part  F-measure = 53.8% for non-attribute class, and between 81-95% for other classes

 Claveau et al., 2003  Inductive Logic Programming Approach  Doesn’t distinguish between different qualia roles

 Learning relations from non-verbal structures  Gold standard of qualia structures  Deriving a reasoning calculus

 Strengths  Explained (their) methods in detail  Weaknesses  Required a lot of NLP background knowledge  Short summaries of other’s work