A Toolkit for Natural Language Processing, Information Retrieval, and Network Analysis

Total Page:16

File Type:pdf, Size:1020Kb

A Toolkit for Natural Language Processing, Information Retrieval, and Network Analysis Clairlib: A Toolkit for Natural Language Processing, Information Retrieval, and Network Analysis Amjad Abu-Jbara Dragomir Radev EECS Department EECS Department and University of Michigan School of Information Ann Arbor, MI, USA University of Michigan [email protected] Ann Arbor, MI, USA [email protected] Abstract NLTK (Bird and Loper, 2004) and GATE (Cun- ningham et al., 2002) for Natural Language Pro- In this paper we present Clairlib, an open- cessing; Pajek (Batagelj and Mrvar, 2003) and source toolkit for Natural Language Process- GUESS (Adar, 2006) for Network Analysis and Vi- ing, Information Retrieval, and Network Anal- 1 ysis. Clairlib provides an integrated frame- sualization; and Lemur for Language Modeling and work intended to simplify a number of generic Information Retrieval. tasks within and across those three areas. It This paper presents Clairlib, an open-source has a command-line interface, a graphical in- toolkit that contains a suit of modules for generic terface, and a documented API. Clairlib is tasks in Natural Language Processing (NLP), Infor- compatible with all the common platforms and mation Retrieval (IR), and Network Analysis (NA). operating systems. In addition to its own func- While many systems have been developed to address tionality, it provides interfaces to external soft- ware and corpora. Clairlib comes with a com- tasks or subtasks in one of these areas as we have prehensive documentation and a rich set of tu- just mentioned, Clairlib provides one integrated en- torials and visual demos. vironment that addresses tasks in the three areas. This makes it useful for a wide range of applications 1 Introduction within and across the three domains. Clairlib is designed to meet the needs of re- The development of software packages and code li- searchers and educators with varying purposes and braries that implement algorithms and perform tasks backgrounds. For this purpose, Clairlib provides in scientific areas is of great advantage for both re- three different interfaces to its functionality: a searchers and educators. The availability of these graphical interface, a command-line interface, and tools saves the researchers a lot of the time and the an application programming interface (API). effort needed to implement the new approaches they Clairlib is developed and maintained by the Com- propose and conduct experiments to verify their hy- putational Linguistics and Information Retrieval potheses. Educators also find these tools useful in (CLAIR) group at the University of Michigan. The class demonstrations and for setting up practical pro- first version of Clairlib was released in the year gramming assignments and projects for their stu- 2007. It has been heavily developed since then until dents. it witnessed a qualitative leap by adding the Graphi- A large number of systems have been developed cal Interface and many new features to the latest ver- over the years to solve problems and perform tasks sion that we are presenting here. in Natural Language Processing, Information Re- Clairlib core modules are written in Perl. The trieval, or Network Analysis. Many of these sys- GUI was written in Java. The Perl back-end and the tems perform specific tasks such as parsing, Graph Java front-end are efficiently tied together through a Partitioning, co-reference resolution, web crawling communication module. Clairlib is compatible with etc. Some other systems are frameworks for per- forming generic tasks in one area of focus such as 1http://www.lemurproject.org/ 121 Proceedings of the ACL-HLT 2011 System Demonstrations, pages 121–126, Portland, Oregon, USA, 21 June 2011. c 2011 Association for Computational Linguistics all the common platforms and operating systems. 2.2 Command-line Interface The only requirements are a Perl interpreter and Java The command-line interface provides an easy access Runtime Environment (JRE). to many of the tasks that Clairlib modules imple- Clairlib has been used in several research projects ment. It provides more than 50 different commands. to implement systems and conduct experiments. It Each command is documented and demonstrated in also has been used in several academic courses. one or more tutorials. The function of each com- The rest of this paper is organized as follows. In mand can be customized by passing arguments with Section 2, we describe the structure of Clairlib. In the command. For example, the command Section 3, we present its functionality. Section 4 partition.pl -graph graph.net -method GirvanNewman -n 4 presents some usage examples. We conclude in Sec- tion 5. uses the GrivanNewman algorithm to divide a given graph into 4 partitions. 2 System Overview 2.3 Graphical User Interface Clairlib consists of three main components: the core The graphical user interface (GUI) is an impor- library, the command-line interface, and the graph- tant feature that has been recently added to Clairlib ical user interface. The three components were de- and constituted a quantum leap in its development. signed and connected together in a manner that aims The main purpose of the GUI is to make the rich to achieve simplicity, integration, and ease of use. In set of Clairlib functionalities easier to access by a the following subsections, we briefly describe each larger number of users from various levels and back- of the three components. grounds especially students and users with limited or no programming experience. 2.1 Modules It is also intended to help students do their assign- The core of Clairlib is a collection of more than 100 ments, projects, and research experiments in an in- modules organized in a shallow hierarchy, each of teractive environment. We believe that visual tools which performs a specific task or implements a cer- facilitate understanding and make learning a more tain algorithm. A set of core modules define the data enjoyable experience for many students. Focusing structures and perform the basic processing tasks. on this purpose, the GUI is tuned for simplicity and For example, Clair::Document defines a data struc- ease of use more than high computational efficiency. ture for holding textual data in various formats, and Therefore, while it is suitable for small and medium performs the basic text processing tasks such as tok- scale projects, it is not guaranteed to work efficiently enization, stemming, tag stripping, etc. for large projects that involve large datasets and re- Another set of modules perform more specific quire heavy processing. The command-line inter- tasks in the three areas of focus (NLP, IR, and NA). face is a better choice for large projects. For example, Clair::Bio::GIN::Interaction is de- The GUI consists of three components: the Net- voted to protein-protein interaction extraction from work Editor/Visualizer/Analyzer, the Text Proces- biomedical text. sor, and the Corpus Processor. The Network com- A third set contains modules that interface Clair- ponent allows the user to 1) build a new network lib to external tools. For example, Clair::Utils::Parse using a set of drawing and editing tools, 2) open provides an interface to Charniak parser (Charniak, existing networks stored in files in several different 2000), Stanford parser (Klein and Manning, 2003), formats, 3) visualize a network and interact with it, 2 and Chunklink . 4) compute different statistics for a network such as Each module has a well-defined API. The API is diameter, clustering coefficient, degree distribution, oriented to developers to help them write applica- etc., and 5) perform several operations on a network tions and build systems on top of Clairlib modules; such as random walk, label propagation, partition- and to researchers to help them write applications ing, etc. This component uses the open source li- and setup custom experiments for their research. brary, JUNG3 to visualize networks. Figure 1 shows 2http://ilk.uvt.nl/team/sabine/chunklink/README.html 3http://jung.sourceforge.net/ 122 Figure 1: A screenshot for the network visualization component of Clairlib a screenshot for the Network Visualizer. 2.4 Documentation Clairlib comes with an extensive documentation. The Text Processing component allows users to The documentation contains the installation infor- process textual data published on the internet or im- mation for different platforms, a description of all ported from a file stored on the disk. It can process Clairlib components and modules, and a lot of usage data in plain, html, or PDF format. Most of the text examples. In addition to this documentation, Clair- processing capabilities implemented in Clairlib core lib provides three other resources: library are available through this component. Fig- ure 2 shows a screenshot of the text processing com- API Reference ponent. The API Reference provides a complete descrip- tion of each module in the library. It describes each The Corpus Processing component allows users subroutine, the task it performs, the arguments it to build a corpus of textual data out of a collection takes, the value it returns, etc. This reference is use- of files in plain, HTML, or PDF format; or by crawl- ful for developers who want to use Clairlib modules ing a website. Several tasks could be performed on in their own applications and systems. The API Ref- a corpus such as indexing, querying, summarization, erence is published on the internet. information extraction, hyperlink network construc- tion, etc. Tutorials Although these components can be run indepen- Tutorials teach users how to use Clairlib by ex- dently, they are very integrated and designed to eas- amples. Each tutorial addresses a specific task and ily interact with each other. For example, a user can provides a set of instructions to complete the task crawl a website using the Corpus component, then using Clairlib command-line tools or its API. switch to the Text Processing component to extract the text from the web documents and stem all the Visual Demos words, then switch back to the Corpus component Visual demos target the users of the graphical in- to build a document similarity graph.
Recommended publications
  • An Artificial Neural Network Approach for Sentence Boundary Disambiguation in Urdu Language Text
    The International Arab Journal of Information Technology, Vol. 12, No. 4, July 2015 395 An Artificial Neural Network Approach for Sentence Boundary Disambiguation in Urdu Language Text Shazia Raj, Zobia Rehman, Sonia Rauf, Rehana Siddique, and Waqas Anwar Department of Computer Science, COMSATS Institute of Information Technology, Pakistan Abstract: Sentence boundary identification is an important step for text processing tasks, e.g., machine translation, POS tagging, text summarization etc., in this paper, we present an approach comprising of Feed Forward Neural Network (FFNN) along with part of speech information of the words in a corpus. Proposed adaptive system has been tested after training it with varying sizes of data and threshold values. The best results, our system produced are 93.05% precision, 99.53% recall and 96.18% f-measure. Keywords: Sentence boundary identification, feed forwardneural network, back propagation learning algorithm. Received April 22, 2013; accepted September 19, 2013; published online August 17, 2014 1. Introduction In such conditions it would be difficult for a machine to differentiate sentence terminators from Sentence boundary disambiguation is a problem in natural language processing that decides about the ambiguous punctuations. beginning and end of a sentence. Almost all language Urdu language processing is in infancy stage and processing applications need their input text split into application development for it is way slower for sentences for certain reasons. Sentence boundary number of reasons. One of these reasons is lack of detection is a difficult task as very often ambiguous Urdu text corpus, either tagged or untagged. However, punctuation marks are used in the text.
    [Show full text]
  • A Comparison of Knowledge Extraction Tools for the Semantic Web
    A Comparison of Knowledge Extraction Tools for the Semantic Web Aldo Gangemi1;2 1 LIPN, Universit´eParis13-CNRS-SorbonneCit´e,France 2 STLab, ISTC-CNR, Rome, Italy. Abstract. In the last years, basic NLP tasks: NER, WSD, relation ex- traction, etc. have been configured for Semantic Web tasks including on- tology learning, linked data population, entity resolution, NL querying to linked data, etc. Some assessment of the state of art of existing Knowl- edge Extraction (KE) tools when applied to the Semantic Web is then desirable. In this paper we describe a landscape analysis of several tools, either conceived specifically for KE on the Semantic Web, or adaptable to it, or even acting as aggregators of extracted data from other tools. Our aim is to assess the currently available capabilities against a rich palette of ontology design constructs, focusing specifically on the actual semantic reusability of KE output. 1 Introduction We present a landscape analysis of the current tools for Knowledge Extraction from text (KE), when applied on the Semantic Web (SW). Knowledge Extraction from text has become a key semantic technology, and has become key to the Semantic Web as well (see. e.g. [31]). Indeed, interest in ontology learning is not new (see e.g. [23], which dates back to 2001, and [10]), and an advanced tool like Text2Onto [11] was set up already in 2005. However, interest in KE was initially limited in the SW community, which preferred to concentrate on manual design of ontologies as a seal of quality. Things started changing after the linked data bootstrapping provided by DB- pedia [22], and the consequent need for substantial population of knowledge bases, schema induction from data, natural language access to structured data, and in general all applications that make joint exploitation of structured and unstructured content.
    [Show full text]
  • ACL 2019 Social Media Mining for Health Applications (#SMM4H)
    ACL 2019 Social Media Mining for Health Applications (#SMM4H) Workshop & Shared Task Proceedings of the Fourth Workshop August 2, 2019 Florence, Italy c 2019 The Association for Computational Linguistics Order copies of this and other ACL proceedings from: Association for Computational Linguistics (ACL) 209 N. Eighth Street Stroudsburg, PA 18360 USA Tel: +1-570-476-8006 Fax: +1-570-476-0860 [email protected] ISBN 978-1-950737-46-8 ii Preface Welcome to the 4th Social Media Mining for Health Applications Workshop and Shared Task - #SMM4H 2019. The total number of users of social media continues to grow worldwide, resulting in the generation of vast amounts of data. Popular social networking sites such as Facebook, Twitter and Instagram dominate this sphere. According to estimates, 500 million tweets and 4.3 billion Facebook messages are posted every day 1. The latest Pew Research Report 2, nearly half of adults worldwide and two- thirds of all American adults (65%) use social networking. The report states that of the total users, 26% have discussed health information, and, of those, 30% changed behavior based on this information and 42% discussed current medical conditions. Advances in automated data processing, machine learning and NLP present the possibility of utilizing this massive data source for biomedical and public health applications, if researchers address the methodological challenges unique to this media. In its fourth iteration, the #SMM4H workshop takes place in Florence, Italy, on August 2, 2019, and is co-located with the
    [Show full text]
  • Full-Text Processing: Improving a Practical NLP System Based on Surface Information Within the Context
    Full-text processing: improving a practical NLP system based on surface information within the context Tetsuya Nasukawa. IBM Research Tokyo Resem~hLaborat0ry t623-14, Shimotsurum~, Yimmt;0¢sl{i; I<almgawa<kbn 2421,, J aimn • nasukawa@t,rl:, vnet;::ibm icbm Abstract text. Without constructing a i):recige filodel of the eohtext through, deep sema~nfiCamtlys~is, our frmne= Rich information fl)r resolving ambigui- "work-refers .to a set(ff:parsed trees. (.r~sltlt~ 9 f syn- ties m sentence ~malysis~ including vari- : tacti(" miaiysis)ofeach sexitencd in t.li~;~i'ext as (:on- ous context-dependent 1)rol)lems. can be ob- text ilfformation, Thus. our context model consists tained by analyzing a simple set of parsed of parse(f trees that are obtained 1)y using mi exlst- ~rces of each senten('e in a text withom il!g g¢lwral syntactic parser. Excel)t for information constructing a predse model of the contex~ ()It the sequence of senl;,en('es, olIr framework does nol tl(rough deep senmntic.anMysis. Th.us. pro- consider any discourse stru(:~:ure mwh as the discourse cessmg• ,!,' a gloup" of sentem' .., '~,'(s togethel. i ': makes.' • " segmenm, focus space stack, or dominant hierarclty it.,p.(,)ss{t?!e .t.9 !~npl:ovel-t]le ~ccui'a~'Y (?f a :: :.it~.(.fi.ii~idin:.(cfi.0szufid, Sht/!er, dgs6)i.Tli6refbi.e, om< ,,~ ~-. ~t.ehi- - ....t sii~ 1 "~g;. ;, ~-ni~chin¢''ti-mslat{b~t'@~--..: .;- . .? • . : ...... - ~,',". ..........;-.preaches ":........... 'to-context pr0cessmg,,' • and.m" "tier-ran : ' le d at. •tern ; ::'Li:In i. thin.j.;'P'..p) a (r ~;.!iwe : .%d,es(tib~, ..i-!: ....
    [Show full text]
  • Natural Language Processing
    Chowdhury, G. (2003) Natural language processing. Annual Review of Information Science and Technology, 37. pp. 51-89. ISSN 0066-4200 http://eprints.cdlr.strath.ac.uk/2611/ This is an author-produced version of a paper published in The Annual Review of Information Science and Technology ISSN 0066-4200 . This version has been peer-reviewed, but does not include the final publisher proof corrections, published layout, or pagination. Strathprints is designed to allow users to access the research output of the University of Strathclyde. Copyright © and Moral Rights for the papers on this site are retained by the individual authors and/or other copyright owners. Users may download and/or print one copy of any article(s) in Strathprints to facilitate their private study or for non-commercial research. You may not engage in further distribution of the material or use it for any profitmaking activities or any commercial gain. You may freely distribute the url (http://eprints.cdlr.strath.ac.uk) of the Strathprints website. Any correspondence concerning this service should be sent to The Strathprints Administrator: [email protected] Natural Language Processing Gobinda G. Chowdhury Dept. of Computer and Information Sciences University of Strathclyde, Glasgow G1 1XH, UK e-mail: [email protected] Introduction Natural Language Processing (NLP) is an area of research and application that explores how computers can be used to understand and manipulate natural language text or speech to do useful things. NLP researchers aim to gather knowledge on how human beings understand and use language so that appropriate tools and techniques can be developed to make computer systems understand and manipulate natural languages to perform the desired tasks.
    [Show full text]
  • Entity Extraction: from Unstructured Text to Dbpedia RDF Triples Exner
    Entity extraction: From unstructured text to DBpedia RDF triples Exner, Peter; Nugues, Pierre Published in: Proceedings of the Web of Linked Entities Workshop in conjuction with the 11th International Semantic Web Conference (ISWC 2012) 2012 Link to publication Citation for published version (APA): Exner, P., & Nugues, P. (2012). Entity extraction: From unstructured text to DBpedia RDF triples. In Proceedings of the Web of Linked Entities Workshop in conjuction with the 11th International Semantic Web Conference (ISWC 2012) (pp. 58-69). CEUR. http://ceur-ws.org/Vol-906/paper7.pdf Total number of authors: 2 General rights Unless other specific re-use rights are stated the following general rights apply: Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal Read more about Creative commons licenses: https://creativecommons.org/licenses/ Take down policy If you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim. LUND UNIVERSITY PO Box 117 221 00 Lund +46 46-222 00 00 Entity Extraction: From Unstructured Text to DBpedia RDF Triples Peter Exner and Pierre Nugues Department of Computer science Lund University [email protected] [email protected] Abstract.
    [Show full text]
  • Mining Text Data
    Mining Text Data Charu C. Aggarwal • ChengXiang Zhai Editors Mining Text Data Editors Charu C. Aggarwal ChengXiang Zhai IBM T.J. Watson Research Center University of Illinois at Urbana-Champaign Yorktown Heights, NY, USA Urbana, IL, USA [email protected] [email protected] ISBN 978-1-4614-3222-7 e-ISBN 978-1-4614-3223-4 DOI 10.1007/978-1-4614-3223-4 Springer New York Dordrecht Heidelberg London Library of Congress Control Number: 2012930923 © Springer Science+Business Media, LLC 2012 All rights reserved. This work may not be translated or copied in whole or in part without the written permission of the publisher (Springer Science+Business Media, LLC, 233 Spring Street, New York, NY 10013, USA), except for brief excerpts in connection with reviews or scholarly analysis. Use in connection with any form of information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed is forbidden. The use in this publication of trade names, trademarks, service marks, and similar terms, even if they are not identified as such, is not to be taken as an expression of opinion as to whether or not they are subject to proprietary rights. Printed on acid-free paper Springer is part of Springer Science+Business Media (www.springer.com) Contents 1 An Introduction to Text Mining 1 Charu C. Aggarwal and ChengXiang Zhai 1. Introduction 1 2. Algorithms for Text Mining 4 3. Future Directions 8 References 10 2 Information Extraction from Text 11 Jing Jiang 1. Introduction 11 2. Named Entity Recognition 15 2.1 Rule-based Approach 16 2.2 Statistical Learning Approach 17 3.
    [Show full text]
  • An Analysis of the Semantic Annotation Task on the Linked Data Cloud
    An Analysis of the Semantic Annotation Task on the Linked Data Cloud Michel Gagnon Department of computer engineering and software engineering, Polytechnique Montréal E-mail: [email protected] Amal Zouaq Department of computer engineering and software engineering, Polytechnique Montréal School of Electrical Engineering and Computer Science, University of Ottawa E-mail: [email protected] Francisco Aranha Fundação Getulio Vargas, Escola de Administração de Empresas de São Paulo Faezeh Ensan Ferdowsi University of Mashhad, Mashhad Iran, E-mail: [email protected] Ludovic Jean-Louis Netmail E-mail: [email protected] Abstract Semantic annotation, the process of identifying key-phrases in texts and linking them to concepts in a knowledge base, is an important basis for semantic information retrieval and the Semantic Web uptake. Despite the emergence of semantic annotation systems, very few comparative studies have been published on their performance. In this paper, we provide an evaluation of the performance of existing arXiv:1811.05549v1 [cs.CL] 13 Nov 2018 systems over three tasks: full semantic annotation, named entity recognition, and keyword detection. More specifically, the spotting capability (recognition of relevant surface forms in text) is evaluated for all three tasks, whereas the disambiguation (correctly associating an entity from Wikipedia or DBpedia to the spotted surface forms) is evaluated only for the first two tasks. Our evaluation is twofold: First, we compute standard precision and recall on the output of semantic annotators on diverse datasets, each best suited for one of the identified tasks. Second, we build a statistical model using logistic regression to identify significant performance differences.
    [Show full text]
  • NEWRITER: a Text Editor for Boosting Scientific Paper Writing
    NEWRITER: A Text Editor for Boosting Scientific Paper Writing Joao˜ Ribeiro Bezerra1, Lu´ıs Fabr´ıcio Wanderley Goes´ 2 a and Wladmir Cardoso Brandao˜ 1 b 1Department of Computer Science, Pontifical Catholic University of Minas Gerais (PUC Minas), Belo Hozizonte, Brazil 2Department of Informatics, University of Leicester, Leicester, England, U.K. Keywords: Writing Assistance, Language Model, Transformer, BERT, Natural Language Processing. Abstract: Nowadays, in the scientific field, text production is required from scientists as means of sharing their research and contribution to science. Scientific text writing is a task that demands time and formal writing skills and can be specifically slow and challenging for inexperienced researchers. In addition, scientific texts must be written in English, follow a specific style and terminology, which can be a difficult task specially for researchers that aren’t native English speakers or that don’t know the specific writing procedures required by some publisher. In this article, we propose NEWRITER, a neural network based approach to address scientific text writing assistance. In particular, it enables users to feed related scientific text as an input to train a scientific-text base language model into a user-customized, specialized one. Then, the user is presented with real-time text suggestions as they write their own text. Experimental results show that our user-customized language model can be effectively used for scientific text writing assistance when compared to state-of-the-art pre-trained models. 1 INTRODUCTION of words, keeping the context of other words in the text when processing each singular word. The se- Text production is required from scientists as means quences of words are transformed into embeddings of sharing their research and contribution to science.
    [Show full text]
  • A Large-Scale Classification of English Verbs
    A Large-scale Classification of English Verbs Karin Kipper University of Colorado at Boulder [email protected] Anna Korhonen University of Cambridge Computer Laboratory [email protected] Neville Ryant Computer and Information Science Department University of Pennsylvania [email protected] Martha Palmer Department of Linguistics University of Colorado at Boulder [email protected] Abstract. Lexical classifications have proved useful in supporting various natural language processing (NLP) tasks. The largest verb classification for English is Levin’s (1993) work which defined groupings of verbs based on syntactic and semantic properties. VerbNet (Kipper et al., 2000; Kipper-Schuler, 2005) – the largest computational verb lexicon currently avail- able for English – provides detailed syntactic-semantic descriptions of Levin classes. While the classes included are extensive enough for some NLP use, they are not comprehensive. Korhonen and Briscoe (2004) have proposed a significant extension of Levin’s classification which incorporates 57 novel classes for verbs not covered (comprehensively) by Levin. Ko- rhonen and Ryant (2005) have recently supplemented this with another extension including 53 additional classes. This article describes the integration of these two extensions into VerbNet. The result is a comprehensive Levin-style classification for English verbs providing over 90% token coverage of the Proposition Bank data (Palmer et al., 2005) and thus can be highly useful for practical applications. Keywords: lexical classification, lexical resources, computational linguistics 1. Introduction Lexical classes, defined in terms of shared meaning components and similar (morpho- )syntactic behavior of words, have attracted considerable interest in NLP (Pinker, 1989; Jackendoff, 1990; Levin, 1993). These classes are useful for their ability to capture generalizations about a range of (cross- )linguistic properties.
    [Show full text]
  • Verbnet Representations: Subevent Semantics for Transfer Verbs
    VerbNet Representations: Subevent Semantics for Transfer Verbs Susan Windisch Brown Julia Bonn James Gung University of Colorado University of Colorado University of Colorado [email protected] [email protected] [email protected] Annie Zaenen James Pustejovsky Martha Palmer Stanford University Brandeis University University of Colorado [email protected]@[email protected] Abstract verb senses and introduce a means for automati- cally translating text to these representations. We This paper announces the release of a new ver- explore the format of these representations and the sion of the English lexical resource VerbNet types of information they track by thoroughly ex- with substantially revised semantic represen- amining the representations for transfer of posses- tations designed to facilitate computer plan- sions and information. These event types are ex- ning and reasoning based on human language. We use the transfer of possession and trans- cellent examples of complex events with multi- fer of information event representations to il- ple participants and relations between them that lustrate both the general framework of the change across the time frame of the event. By representations and the types of nuances the aligning our new representations more closely new representations can capture. These repre- with the dynamic event structure encapsulated by sentations use a Generative Lexicon-inspired the Generative Lexicon, we can provide a more subevent structure to track attributes of event precise subevent structure that makes the changes participants across time, highlighting opposi- tions and temporal and causal relations among over time explicit (Pustejovsky, 1995; Pustejovsky the subevents. et al., 2016). Who has what when and who knows what when are exactly the sorts of things that we 1 Introduction want to extract from text, but this extraction is dif- ficult without explicit, computationally-tractable Many natural language processing tasks have seen representations.
    [Show full text]
  • Collection Statistics for Fast Duplicate Document Detection
    Collection Statistics for Fast Duplicate Document Detection ABDUR CHOWDHURY, OPHIR FRIEDER, DAVID GROSSMAN, and MARY CATHERINE McCABE Illinois Institute of Technology We present a new algorithm for duplicate document detection that uses collection statistics. We com- pare our approach with the state-of-the-art approach using multiple collections. These collections include a 30 MB 18,577 web document collection developed by Excite@Home and three NIST collec- tions. The first NIST collection consists of 100 MB 18,232 LA-Times documents, which is roughly similar in the number of documents to the Excite@Home collection. The other two collections are both 2 GB and are the 247,491-web document collection and the TREC disks 4 and 5—528,023 document collection. We show that our approach called I-Match, scales in terms of the number of documents and works well for documents of all sizes. We compared our solution to the state of the art and found that in addition to improved accuracy of detection, our approach executed in roughly one-fifth the time. 1. INTRODUCTION Data portals are everywhere. The tremendous growth of the Internet has spurred the existence of data portals for nearly every topic. Some of these por- tals are of general interest; some are highly domain specific. Independent of the focus, the vast majority of the portals obtain data, loosely called documents, from multiple sources. Obtaining data from multiple input sources typically results in duplication. The detection of duplicate documents within a collection has recently become an area of great interest [Shivakumar and Garcia-Molina 1998; Broder et al.
    [Show full text]