DOCSLIB.ORG

Full-Text Processing: Improving a Practical NLP System Based on Surface Information Within the Context

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read 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-!: ..... a. ,,~inqfl6 .... • ..- ~.,.. '..obtmnm~..~:.pei'iect. ' .: " : ....aimly,~ls. : : Howev~r,:" " ' ' ~ ......... by 9xtel~d c :co3!t e~/~ ~.g0dc[.~.Ofi!si.~tilng .-ef:p~fs.e d t'Imcs.6!-.: .~,..,2,'.{ .in~/t, ii~,}.~{ifit..of .tile. iJl:oces~i~/g 6bji,bt. fr0ih'-0ne'.smt~ :~tch'~:n~q~ce::.in :.a.text,4~a¢~fit~-eff~'!,~ven£~s :> L #..:::'ti;iic~. ~6 .rfiifltiifl6 sgi~tdlt¢:es {n:.~{ k0ifi'ee, f,6XVxnd .by fin"- handhng: """:' various'!?": l~roblems '"" ....m NLP ('such " " ; using syntaciic information on all tlie 0theriwSr(ls as the resolutien of stru~:tural ambiguities, i.n the whole text. Snch ,~s nmdifiee-modifier relation- pronoun referents, and the focus of focusing ships and their I)ositions in the text. our framework subjuncts (e.g. also and only), as well as improves the overM1 ae('uraey of a natural language for •adding SUl)plemen:t~try phrases t.o seine pro('essing system. elli)ti(al sen:fences.. ". " " " . .' ...... : ........ <:. : ? -: - ' 2";" ,:- q.: '. <;. :- .:'~ .v: '..-:: .' : :". '.-::' ' C".. : We, imp]etne~i{.M this II:amework:on:an Englisl~-to- • ,*"-' "~''<- ":~ ....... '. ".',' '." " , . "," ,', ' " - " . cOnllith, er lllallu~tts.,. ±.tt.: xtood.~,) .~,¢~v.. ....-.. ......... ,-~: .'key, '~.eclimot.ogy. for :.. mH)r.0y!ng" tlie. ac(;nra(:y •(ff ,h~xt.- .: ::. < :. :. ~G,':.; .:.: .. ", - ,.;-' , : '; ..... ',' : :-: : - ; :'; .... : t : ....... "q ""'.' . " ' ..... ' ...... " ", " .... " " m }rDuiid:i~/lowledge.,t, hd.(l(,el> iltfo1'(,ll(e !n(~cllal)isi~ls, C'O'tt'~X~-:~;:~l';!:;lt e t(:::~:~:1~;]~ ' :~~ (.2;1]I>!;;0'~ y ~.~;" is true:.that.-' We." can" " mWays.,' " " .o'nn.d ;' ex~mq)l.,'" ' 'eS ot~ 1 Jiob' .- . SllInlng.:..'. • ~x,,,.' ,, "s ; . : 1~,,'",' • '.,[ " : ; . .' ,<.;(.. '",.; 7.' lems thai requir.e c6mmoil 'sei,g~ mM .ilff¢4rence~ lnech.r ::. ,." ;u.~w~i~:~d:h;na::P;'.lYSo:::~lg.:~:;n:~'l'. < w3!-n[;a2ls;t a~lisI~lS;':s~rch.:as :t.ti( class'ie i)t:6iflems ]ne.ntloned. it['.- ',,.":" !. :. '. '.'"., !.:. '~' '.,-<,:' " ' : . (Cl{anlliai("1973~ il]whietl tl[i re.fi rents (if'l:,{'ouonns result of Word semse (tiszmtblgua~mn m one sentenc.e Y :: - - ':..: .-" ," ,: •, . - <-' ," "; ;; ;- ' - " . Wit-ir 'M~ the (W6i'd~ .{/c"{Sd i~lis~iou{'~(~ t.fih~ :Sl{Xl'(~:.ttie "are ndt,<ex lw~itl s%~L15P£t.l.li [;lle~l;(}x~;, nowexer ..m a..'..... ,.. .: ~. .::" ":,~..:~: ...::.'. ,,:-:;...': :.':,.;.:,: .:'.,..,.. ":.- •<.....< :...... P . .. ~ z-., .% ~, . ::.: ...;-:".-..;..-,~..,,. :-z-el. "" satlw .ld~illn~L:2 Fffrtlte1'iiior(,:,..:I~.~asstntlin'g;W.fllS.C(~Ml~Se :t~.X~..Wit'l'IllT ~ur(,sZl'l(%e;(l (iOlllai,n" ..:p&rr, l('lnarly An [,e 11: " .: *.. : --: - (..'. • .... .. • , , , .' • : • : ', , . -. .... 'abSerxre..t'ti/~i~3~ ~(mi);x(id~-ilenderlt :tfi:obloniS;'tht~( Art! ';::) ; ..6.y'.',: ';-,-.: .,..-! ..... ;..Y-;! : -i~:- "<:..'. ?., i~:!,.:.,!!~¢:.!..>"-..,':'~.:..,' *.~ • : i" ;~;. ' " ,-," " .-/, " v ( :~ ;-., < i-. - " .. "e ~. ?._:SL:.£t : . 'W/~,"(;all "O])t,,~kilI:.6"l.ll~C,~ "t,~, U~'l;erglllllltg: [,tie ll~DetlIleog .o I s(MgaDlg..Wll;nOt'lt-.Ille!lS( .DI. a (Leep lllieronce ille(lt7.. ' '~ "', .' ",.' ' -1 . '.... i. .~ .: , • ~ t" e imism o~ Cal( full" haiid (od( d data su( h ~ scl, i-)ts ' sm~(~nr~uy ftmolguous 1)nrases Irom sH'.ltc{urai.mlor: " ?" "~ ' y. - : ' ' " ..' " ' " " 1 ' • : • ', . " - ' .- • , :' ' ': ' ' [Schhnk and R{dsti6}k 1)981~ Wc therefore tried t0 matnm on all words w~th the same:lemmawlthm the .~,~...~, -.' i <..,,.'...~., '...,-,.,~,!,-.;.... ~,, ;, ~,i ', .~,.'~..:~; ' ; di,~(:a~r:;'e~,.'.M6r~ovel',, p~;O.c~siilg.:,~-MiOle.~.xt:: ~t:.a~i~:, d/)VelOp' a- praY( tl(-'.[tl ~,ile~no([- tllaL .wolll(l SOlV.O' lllOS ,.. , - ' - , , .., .... ' - • ....... " . ..... ' : - . - ' " • " " - .... tinle ltmkes:-it. po~ibto ~6,.refer::to otl~erdn.f(*rm~ti61~ abntexVddpenden.t px'obl0,nls.and, m~t)r.o'~e the aceu-.. ,' ' ,~,- .. ,-;, ' . ., • .,..-,,:; -.:. :, .,. " ;.. • ; • . ,,- .:. ':.'.; ; ",': ....... ,i":-, " i "' ;.' :' " "., ," - , ,~:' ," " : ; .' S'li(;[Fa.,~wor(IIreqi'fOn(~I~d~,1~e.poslrlo~z:ot.e~ten,WOl'(r, •.racy, oI ~ex.b,all&lysls :Dy,U,qlng a. stlnpte lnecP2a, nlstD.:. , , .~ ~ • :.. ..... ...: ...... :.....: ....,",, :, : : ,:", '., ..... ..- "< ." : .. ~.:....~. ;.. : ,. i ,.'., .; .-. " .... .- ." . ,wfiieh,c.an be.lmedf0r gesoban~i)ron.em~ ref~tetlcd und 'and-,eXlSldl]g 1i13~llllle-l'l,~a(13A)leoara . , , • ' ,. - _..,. : . ;, :.',-. ,: '-. ', .; - : " < , " - :,.', " -¢ -, - - " T6 t~e~h~, w:it}~ ~e' ttevel6,;~([ ~(ftah~4v6tk'f(fi" ~i@6 ':/ tlii~ '~0('us< ot-m~ash~gsnla'imictq :stidi..it~ a.l.~o, and-0nt:y, • " "-" ~-~ .- . ~,,. '~ - ~ .' : ' - . r """; :',"<' ', '-"' ':: ". "'-:':'"' " -':.? 2' *,..¢"': . ":'.':; ) - ',. , ': {~essi.ng.all_: se]~te.n~:8~ .{g..a': t;eXt ;siimflt~n('.0i/sk6! s(; that..i: • .Ii/:~hi's .: p~p"h'i:,, ~$!./.d'eScti'.t~9.)d3ii:.....a!ob)ist.. (>O~\,tgx,t~ ~e'a(-hsent.ende e~u(b'e d~s~nb'~gu~ded by itsing i~ffo~mia- . (proceS~ing l~ett!od , .m~mely~"filll-.t(~x~:processlng ,, f6- tioi~ ex~rgcted from other senten('es within tlm same (:using On its effects on ttie.output of a nmehine trails- 824 lation system. In the next section, we briefly (h'scril)e Context = {Sentencel, Sentence2, ..., Sentence n] tim framework of our method, which uses a siml)le context model; tl,(`n, in the following s('etions, we il- Stenence i = [Word i-I, Word i-2, ..., Word i-j} lustrate its effe(:tiveness with some actual outl)uts of our English-to-JCL1)anese lna('hine translation system. John likes apples. Sentence 1 Word1-1 [John] POX : N BASE : John ... 2 Framework ..............ub ./~o hn~ Word1-2 [llktm] ................ ~ POX : V BASE : like ... Full-text processing consists of thr('e steps: POX : N BASE : apple .~. 1. G(`neratil,g a context model tlmt consists of 1)arsed trees of each seltt('n(`e ill a sour('e t(`xt Sentence 2 Tom ah'o likes apples. Word2-1 [Tom] 2. Refining the context model by assigning a single raft- POS : N BASE : Tom ... fled parse tree to (`a<'h senten<'e in the text Word2-2 [also[ 3. Resolving the prol)lems in -;t<'h sentence in the <'<m- POS : ADV BASF. : also., text ntodel an<l generating a. final analysis for ea<'h Word2-3 [likes] POS : V BASE : like ,.. sentence in tit(. text Word2.4 [apples] The resl)ective procedures fl)r these steps are (It'- POS : N BASE : apple .. scribed in the tolh)wing thre(, subs(`ctions. Sentence 3 He also likes oranges. Word3-1 [He] 2.1 Generation of a simple context model POS : PN BASE : he ... Word3-2 [also] In order to refer to ('ontext information that consists POX : ADV BASE : also., of dat;t on multiple senten('es in at text, it is esseu- Word3-3 [likes] tim to constru('t some eollt(`:~t model; the tirst st(' 1) POS : V BASE : like ,.. of the full-text 1)ro('essing nwthod ix therefore to ('on- Word3-4 [oranges] POS : N BASE : oranse ,., stru('t a context lnodel by amalyzing (`a('h senten('(` in an inlmt text. To avoid any (,rrors that may o('cur during transforlmLtion into any other rel)r(`s('ntations, Figm'e 1: Example of ~t context mod('l su(:h as a h)gicM rel)resentation , we stayed with sur- face structures, and to i)reserve the robustn('ss of this framework, we used only a. set of l)arsed tr('es as ;t su('h a s('ntenee, hfformation extracted front COln- (:ontext model. Thus, ea(:h sent.enc(` of an inl)Ut text pl(`te 1)arses of w(`ll-formed sentences 2 in a context ix pro('(`ssed t)y a syntactic lmrs('r in the first st('I), model ('all b(` us('(l to cOlnlflete incolnl)lete parses, in and the positi(m of eac|t instance of every h'mma., its the f()rm of partially parsed chunks that a bottom- morphological information, and its lno(lifiee-modifier up 1)ars(,r outlmts fl)r ill-formed sentences by using a relationships with other content words are extracted previously des('ribed method (N~Lsukawa, 1995). from the parser output, and stored to construct a On the other hand, fl)r some sentences in a text, context model, ;~s shown in Figure 1. In addition, if such as Time ]lies like an arrow, a syntactic t)arser any on-line knowledge r(`sourc('s are ~tvMbd)l(`, infl)r- lltay gent,rate nlore thatl olle parse tree, owillg to the mation extracted froln tit(, resour<:es is also stored in 1)r(`sen(-e of words that Call ])e ;Lssigned to more than the context model. For examl)le, infl)rmation on sym one part of st)eech , or to the l)resen('e of complicated onyms extra.('te(t from an on-lilw thesaurus dictionary coordinate structures, or for wtrious other re~Lsons.
Load more

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]
  • 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]
  • Cross-Language Ontology Learning
    Cross-language Ontology Learning Cross-language Ontology Learning Incorporating and Exploiting Cross-language Data in the Ontology Learning Process Hans Hjelm c Hans Hjelm, Stockholm 2009 ISBN 978-91-7155-806-0 Printed in Sweden by US-AB, Stockholm 2009 Distributor: Department of Linguistics, Stockholm University Abstract An ontology is a knowledge-representation structure, where words, terms or concepts are defined by their mutual hierarchical relations. Ontologies are becoming ever more prevalent in the world of natural language processing, where we currently see a tendency towards using semantics for solving a variety of tasks, particularly tasks related to information access. Ontologies, taxonomies and thesauri (all related notions) are also used in various variants by humans, to standardize business transactions or for finding conceptual relations between terms in, e.g., the medical domain. The acquisition of machine-readable, domain-specific semantic knowledge is time consuming and prone to inconsistencies. The field of ontology learning therefore provides tools for automating the construction of domain ontologies (ontologies describing the entities and relations within a particular field of interest), by analyzing large quantities of domain-specific texts. This thesis studies three main topics within the field of ontology learning. First, we examine which sources of information are useful within an ontology learning system and how the information sources can be combined effectively. Secondly, we do this with a special focus on cross-language text collections, to see if we can learn more from studying several languages at once, than we can from a single-language text collection. Finally, we investigate new approaches to formal and automatic evaluation of the quality of a learned ontology.
    [Show full text]