Efficiently Pretrained Transformer-Based Language Model for Polish

Total Page:16

File Type:pdf, Size:1020Kb

Efficiently Pretrained Transformer-Based Language Model for Polish HerBERT: Efficiently Pretrained Transformer-based Language Model for Polish Robert Mroczkowski1 Piotr Rybak1 Alina Wróblewska2 Ireneusz Gawlik1,3 1ML Research at Allegro.pl 2Institute of Computer Science, Polish Academy of Sciences 3Department of Computer Science, AGH University of Science and Technology {firstname.lastname}@allegro.pl, [email protected] Abstract While most of the research related to analyzing and improving BERT-based models focuses on En- BERT-based models are currently used for glish, there is an increasing body of work aimed solving nearly all Natural Language Process- at training and evaluation of models for other lan- ing (NLP) tasks and most often achieve state- guages, including Polish. Thus far, a handful of of-the-art results. Therefore, the NLP com- munity conducts extensive research on under- models specific for Polish has been released, e.g. 1 standing these models, but above all on design- Polbert , first version of HerBERT (Rybak et al., ing effective and efficient training procedures. 2020), and Polish RoBERTa (Dadas et al., 2020). Several ablation studies investigating how to Aforementioned works lack ablation studies, train BERT-like models have been carried out, making it difficult to attribute hyperparameters but the vast majority of them concerned only choices to models performance. In this work, we the English language. A training procedure de- fill this gap by conducting an extensive set of exper- signed for English does not have to be univer- sal and applicable to other especially typolog- iments and developing an efficient BERT training ically different languages. Therefore, this pa- procedure. As a result, we were able to train and per presents the first ablation study focused on release a new BERT-based model for Polish lan- Polish, which, unlike the isolating English lan- guage understanding. Our model establishes a new guage, is a fusional language. We design and state-of-the-art on the variety of downstream tasks thoroughly evaluate a pretraining procedure of including semantic relatedness, question answer- transferring knowledge from multilingual to ing, sentiment analysis and part-of-speech tagging. monolingual BERT-based models. In addition to multilingual model initialization, other fac- To summarize, our contributions are: tors that possibly influence pretraining are also 1. development and evaluation of an efficient explored, i.e. training objective, corpus size, BPE-Dropout, and pretraining length. Based pretraining procedure for transferring knowl- on the proposed procedure, a Polish BERT- edge from multilingual to monolingual lan- based language model – HerBERT – is trained. guage models based on work by Arkhipov This model achieves state-of-the-art results on et al.(2019), multiple downstream tasks. 2. detailed analysis and an ablation study chal- 1 Introduction lenging the effectiveness of Sentence Struc- tural Objective (SSO, Wang et al., 2020), and Recent advancements in self-supervised pretrain- Byte Pair Encoding Dropout (BPE-Dropout, ing techniques drastically changed the way we de- Provilkov et al., 2020), sign Natural Language Processing (NLP) systems. Even though, pretraining has been present in NLP 3. release of HerBERT2 – a BERT-based model for many years (Mikolov et al., 2013; Pennington for Polish language understanding, which et al., 2014; Bojanowski et al., 2017), only recently achieves state-of-the-art results on KLEJ we observed a shift from task-specific to general- Benchmark (Rybak et al., 2020) and POS tag- purpose models. In particular, the BERT model ging task (Wróblewska, 2020). (Devlin et al., 2019) proved to be a dominant ar- 1https://github.com/kldarek/polbert chitecture and obtained state-of-the-art results for 2https://huggingface.co/allegro/ a variety of NLP tasks. herbert-large-cased 1 Proceedings of the 8th BSNLP Workshop on Balto-Slavic Natural Language Processing, pages 1–10 April 20, 2021. ©2021 Association for Computational Linguistics The rest of the paper is organized as follows. In glish language understanding. There was little re- Section2, we provide an overview of related work. search into understanding how different pretrain- After that, Section3 introduces the BERT-based ing techniques affect BERT-based models for other language model and experimental setup used in this languages. The main research focus was to train work. In Section4, we conduct a thorough ablation BERT-based models and report their performance study to investigate the impact of several design on downstream tasks. The first such models were choices on the performance of downstream tasks. released for German3 and Chinese (Devlin et al., Next, in Section5 we apply drawn conclusions 2019), recently followed by Finnish (Virtanen et al., and describe the training of HerBERT model. In 2019), French (Martin et al., 2020; Le et al., 2020), Section6, we evaluate HerBERT on a set of eleven Polish (Rybak et al., 2020; Dadas et al., 2020), tasks and compare its performance to other state- Russian (Kuratov and Arkhipov, 2019), and many of-the-art models. Finally, we conclude our work other languages4. Research on developing and in- in Section7. vestigating an efficient procedure of pretraining BERT-based models was rather neglected in these 2 Related Work languages. Language understanding for low-resource lan- The first significant ablation study of BERT-based guages has also been addressed by training jointly language pretraining was described by Liu et al. for several languages at the same time. That ap- (2019). Authors demonstrated the ineffectiveness proach improves performance for moderate and of Next Sentence Prediction (NSP) objective, the low-resource languages as showed by Conneau and importance of dynamic token masking, and gains Lample(2019). The first model of this kind was the from using both large batch size and large training multilingual BERT trained for 104 languages (De- dataset. Further large-scale studies analyzed the vlin et al., 2019) followed by Conneau and Lample relation between the model and the training dataset (2019) and Conneau et al.(2020). sizes (Kaplan et al., 2020), the amount of compute used for training (Brown et al., 2020) and training 3 Experimental Setup strategies and objectives (Raffel et al., 2019). In this section, we describe the experimental setup Other work focused on studying and improv- used in the ablation study. First, we introduce the ing BERT training objectives. As mentioned be- corpora we used to train models. Then, we give an fore, the NSP objective was either removed (Liu overview of the language model architecture and et al., 2019) or enhanced either by predicting the training procedure. In particular, we describe the correct order of sentences (Sentence Order Pre- method of transferring knowledge from multilin- diction (SOP), Lan et al., 2020) or discriminat- gual to monolingual BERT-based models. Finally, ing between previous, next and random sentence we present the evaluation tasks. (Sentence Structural Objective (SSO), Wang et al., 2020). Similarly, the Masked Language Modelling 3.1 Training Data (MLM) objective was extended to either predict We gathered six corpora to create two datasets spans of tokens (Joshi et al., 2019), re-order shuf- on which we trained HerBERT. The first dataset fled tokens (Word Structural Objective (WSO), (henceforth called Small) consists of corpora of Wang et al., 2020) or replaced altogether with a the highest quality, i.e. NKJP, Wikipedia, and binary classification problem using mask genera- Wolne Lektury. The second dataset (Large) is over tion (Clark et al., 2020). five times larger as it additionally contains texts of For tokenization, the Byte Pair Encoding algo- lower quality (CCNet and Open Subtitles). Below, rithm (BPE, Sennrich et al., 2016) is commonly we present a short description of each corpus. Ad- used. The original BERT model used WordPiece ditionally, we include the basic corpora statistics in implementation (Schuster and Nakajima, 2012), Table1. which was later replaced by SentencePiece (Kudo and Richardson, 2018). Gong et al.(2018) dis- NKJP (Narodowy Korpus J˛ezykaPolskiego, eng. covered that rare words lack semantic meaning. National Corpus of Polish)(Przepiórkowski, 2012) Provilkov et al.(2020) proposed a BPE-Dropout is a well balanced collection of Polish texts. It technique to solve this issue. 3https://deepset.ai/german-bert All of the above work was conducted for En- 4https://huggingface.co/models 2 Corpus Tokens Documents Avg len representative parts of our corpus, i.e annotated subset of the NKJP, and the Wikipedia. Source Corpora Subword regularization is supposed to empha- NKJP 1357M 3.9M 347 size the semantic meaning of tokens (Gong et al., 2018; Provilkov et al., 2020). To verify its im- Wikipedia 260M 1.4M 190 pact on training language model we used a BPE- Wolne Lektury 41M 5.5k 7447 Dropout (Provilkov et al., 2020) with a probability CCNet Head 2641M 7.0M 379 of dropping a merge equal to 10%. CCNet Middle 3243M 7.9M 409 Architecture We followed the original BERT Open Subtitles 1056M 1.1M 961 (Devlin et al., 2019) architectures for both BASE (12 layers, 12 attention heads and hidden dimen- Final Corpora sion of 768) and LARGE (24 layers, 16 attention Small 1658M 5.3M 313 heads and hidden dimension of 1024) variants. Large 8599M 21.3M 404 Initialization We initialized models either ran- domly or by using weights from XLM-RoBERTa Table 1: Overview of all data sources used to train Her- (Conneau et al., 2020). In the latter case, the pa- BERT. We combine them into two corpora. The Small corpus consists of the highest quality text resources: rameters for all layers except word embeddings and NKJP, Wikipedia, and Wolne Lektury. The Large cor- token type embeddings were copied directly from pus consists of all sources. Avg len is the average num- the source model. Since XLM-RoBERTa does not ber of tokens per document in each corpus. use the NSP objective and does not have the token type embeddings, we took them from the original BERT model.
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]