set is based on the POS tagset used by the Penn Treebank, described in [15].",
      "startOffset" : 78,
      "endOffset" : 82
    }, {
      "referenceID" : 9,
      "context" : "It was introduced in [11, 12, 17, 18].",
      "startOffset" : 21,
      "endOffset" : 37
    }, {
      "referenceID" : 14,
      "context" : "It was introduced in [11, 12, 17, 18].",
      "startOffset" : 21,
      "endOffset" : 37
    }, {
      "referenceID" : 15,
      "context" : "It was introduced in [11, 12, 17, 18].",
      "startOffset" : 21,
      "endOffset" : 37
    }, {
      "referenceID" : 9,
      "context" : "It competed in the CoNLL Shared Task 2011, where it achieved the highest score in both the closed and open tracks [12].",
      "startOffset" : 114,
      "endOffset" : 118
    }, {
      "referenceID" : 17,
      "context" : "There are three operations [20]: • Retain(n) • Insert(s) • Delete(n) Since Clide is written in Scala Retain, Insert and Delete are implemented using Scala case classes.",
      "startOffset" : 27,
      "endOffset" : 31
    }, {
      "referenceID" : 4,
      "context" : "relation can be either a string containing a typed dependency relation (see [5]) or if the relation is a collapsed relation, a vector of the first and second part of the relation (e.",
      "startOffset" : 76,
      "endOffset" : 79
    }, {
      "referenceID" : 4,
      "context" : "nn is the noun compound modifier dependency relation that asserts that one noun modifies another noun [5].",
      "startOffset" : 102,
      "endOffset" : 105
    }, {
      "referenceID" : 17,
      "context" : "Ignoring annotations, we can treat :plain and :annotate as :retain operations [20
set is based on the POS tagset used by the Penn Treebank, described in [ 15 ]. ", 
       " startOffset ": 78, 
       " endOffset ": 82 
     }, { 
       " referenceID ": 9, 
       " context ": " It was insert in [ 11, 12, 17, 18 ]. ", 
       " startOffset ": 21, 
       " endOffset ": 37 
     }, { 
       " referenceID ": 14, 
       " context ": " It was introduce in [ 11, 12, 17, 18 ]. ", 
       " startOffset ": 21, 
       " endOffset ": 37 
     }, { 
       " referenceID ": 15, 
       " context ": " It was introduced in [ 11, 12, 17, 18 ]. ", 
       " startOffset ": 21, 
       " endOffset ": 37 
     }, { 
       " referenceID ": 9, 
       " context ": " It compete in the CoNLL Shared Task 2011, where it achieved the high score in both the shut and open tracks [ 12 ]. ", 
       " startOffset ": 114, 
       " endOffset ": 118 
     }, { 
       " referenceID ": 17, 
       " context ": " There are three process [ 20 ]: • Retain(n) • Insert(s) • Delete(n) Since Clide is written in Scala Retain, Insert and Delete are implemented use Scala case classes. ", 
       " startOffset ": 27, 
       " endOffset ": 31 
     }, { 
       " referenceID ": 4, 
       " context ": " relative can be either a chain containing a typed dependency relation (see [ 5 ]) or if the sexual intercourse is a collapsed relation, a vector of the first and second share of the relation (e. ", 
       " startOffset ": 76, 
       " endOffset ": 79 
     }, { 
       " referenceID ": 4, 
       " context ": " nn is the noun compound modifier dependency relation that assert that one noun modifies another noun [ 5 ]. ", 
       " startOffset ": 102, 
       " endOffset ": 105 
     }, { 
       " referenceID ": 17, 
       " context ": " Ignoring annotations, we can treat: plain and: gloss as: retain operations [ 20
set is based on the POS tagret used by the Penn Tceebank, describdd in [15].",
      "startOffset" : 78,
      "endOdfset" : 82
    }, {
      "refefenceID" : 9,
      "cobtexu" : "It was introdursd in [11, 12, 17, 18].",
      "staxtIffset" : 21,
      "gndOffset" : 37
    }, {
      "refesevczID" : 14,
      "context" : "It was introduceq in [11, 12, 17, 18].",
      "startOffsgt" : 21,
      "sndOffset" : 37
    }, {
      "referenceID" : 15,
      "bontext" : "It was imtroduced in [11, 12, 17, 18].",
      "starhOffdet" : 21,
      "endOffsft" : 37
    }, {
      "wwferenceID" : 9,
      "conttxc" : "It compejed in the CoNLL Shared Task 2011, whdre ic achieved jkw hlchest score in bjth the closcc and mpen trscks [12].",
      "stavtOffvet" : 114,
      "endOffset" : 118
    }, {
      "referenceYD" : 17,
      "ckntext" : "There are tyree mperdtiovw [20]: • Reuaii(n) • Inserh(s) • Delete(n) Sjnce Clide us written in Scala Rqnsin, Insert ahd Delqtq are implemented using Scala case clasves.",
      "startOffset" : 27,
      "endOffset" : 31
    }, {
      "referegceID" : 4,
      "context" : "relation can be either a stsing rovtanklng x tjped dependency relation (see [5]) or if the relatykn ix a collapsed velation, a vector pf tng first and sezond pcdt of the relation (e.",
      "sjartOfdset" : 76,
      "emdOffset" : 79
    }, {
      "referebceID" : 4,
      "xontext" : "nn is the noun compobnd mocifiet dependency relation tkat asaerts that lne noun judifies another vouk [5].",
      "startOffset" : 102,
      "enqOffset" : 105
    }, {
      "fefetenceID" : 17,
      "cojtext" : "Ignoring annotatilns, wg can dreat :plaij and :annotate as :retain operatmpns [20
set is based on the POS tagset the Treebank, described [15].", "startOffset" : { : 9, "context" "It was introduced [11, 12, 17, 18].", "startOffset" : "endOffset" : 37 }, { "referenceID" : 14, "context" : "It was introduced [11, 12, 17, 18].", "startOffset" : 21, "endOffset" : 37 }, { "referenceID" 15, : was in [11, 12, 17, 18].", "startOffset" : 21, "endOffset" : 37 }, { "referenceID" : 9, : "It competed in the CoNLL Shared Task where it achieved the score in both the closed open [12].", "startOffset" 114, : }, { "referenceID" 17, "context" : "There are three operations [20]: • Retain(n) • Insert(s) • Delete(n) Since Clide is in Scala and Delete implemented Scala classes.", "startOffset" : : 31 }, { "referenceID" : "relation can be either a string containing a dependency relation [5]) or if the relation is collapsed relation, a vector of the first and part of the relation (e.", "startOffset" : 76, "endOffset" : 79 }, { "referenceID" : : "nn is the compound modifier dependency that that noun another noun "startOffset" : 102, "endOffset" : 105 }, { "referenceID" : 17, : "Ignoring annotations, we can treat :plain and :annotate as [20
set is based on the POS tagset uSed by the PeNn TreEbaNk, dEsCribEd in [15].",
      "StartOffset" : 78,
      "endoFfseT" : 82
    }, {
      "referenceID" : 9,
      "context" : "It wAs intRoDUced IN [11, 12, 17, 18].",
      "sTartOFfset" : 21,
      "enDofFSEt" : 37
    }, {
      "rEfErEncEId" : 14,
      "CoNtext" : "it wAs introDuced in [11, 12, 17, 18].",
      "staRtOFfSet" : 21,
      "endOffset" : 37
    }, {
      "REfErenceID" : 15,
      "coNteXt" : "It was introDucEd in [11, 12, 17, 18].",
      "stArTOfFSet" : 21,
      "enDOfFset" : 37
    }, {
      "rEferenCEID" : 9,
      "conText" : "It comPeTEd in thE coNLL ShAREd task 2011, Where it achieved thE HiGHest score in botH the clOsED aND OpeN trAcks [12].",
      "startOFfSet" : 114,
      "enDoffset" : 118
    }, {
      "rEFeRENCeId" : 17,
      "Context" : "There aRe three operATioNs [20]: • RetaIn(N) • InSErt(s) • DeLete(n) siNCe CLide is writtEn in scala RetaIn, InseRT and DelETe are imPlemenTed UsiNg ScALa CaSe cLaSSes.",
      "STaRtOFFseT" : 27,
      "endOffsEt" : 31
    }, {
      "ReFerenCeID" : 4,
      "CONTExt" : "rElaTion Can be Either a string ConTainINg a Typed DepenDencY rElatiOn (see [5]) oR if thE rElation is a collaPsed Relation, a VecToR of ThE firsT And secOnd ParT of the rElation (E.",
      "StaRtoFFSeT" : 76,
      "endOffset" : 79
    }, {
      "referencEId" : 4,
      "COnText" : "nn is The nouN CoMpOUnd modifIeR dePendENCy relAtioN ThAt assertS that oNE nOuN modifiEs AnotheR nOun [5].",
      "StaRtOffSEt" : 102,
      "enDOffseT" : 105
    }, {
      "referenCeID" : 17,
      "cONtext" : "Ignoring aNNotations, we caN TrEAT :pLAin aNd :aNnotate as :reTain OPeraTionS [20
set is based on the POS ta gset usedby th e P enn  T reeb ank,  described in[ 15]. ",
      "startOffset"  : 78 ,   "e ndOff set" :8 2  } ,{   "r efere nce ID" : 9 ,
      "c ont ex t" : "It was in troduced i n [ 11, 12, 17,18] .",
    " s tartO ffs et" :  21,
    "e ndOffset"  : 37
  }, {
  "ref erenceID" : 14,
  "context" : " It was  i n tr o d uce d i n [11, 12,  1 7, 18 ] .",
   " s t art O ffset" : 21,      "endO f fse t" : 3 7  }, {
    "r e fer enceID" : 1 5,
     "con text":  "It wa s  introd uced i n [ 11,  12, 17 ,18] ." , 
   "s t art Offset":21 ,
     " e n d O ffse t": 37 
   }, {
      "r efe renc e ID"  : 9, 
     "c on text"  : "It  comp et ed in the CoNLL  Sha red Task201 1,  wh er e ita chieve d t hehighest  scorei n b ot h t he  closed and open t ra c k s[12].",     " st ar t Offset":114 ,
   "en dOff s et " : 118    }, {     "re fe renceI D"  :17, 
    "co ntext"  : "Ther e are three operatio n s [20]: • Ret a in ( n )•  Ins ert (s) • Delet e(n) Sinc e Cl i de  is writt en in  S c al a  Retain, Insert and  D eleteare i mplemented us ing Scalac a s e classe s.",     "startOffse t" :27,
     " endOffse t" :31
    } , {
    " referenc eID " :  4, 
  "context" : " r e lati on  can be  ei ther astr ing  co nta in ing a typ ed depen de nc yre lat ion ( s ee [5])or  if  t herelat i on isa col laps ed  r e lat ion, av ec t o r of  t he  fir stan d sec ondp art  of the  relation  (e . ",
   "start Offset" : 76, 
     "endO ff set " : 79    }, {      "referenceID" : 4 , 
     "co ntext " :"nn is th e n oun co mpo u nd mod ifierdepen de ncy r elati o n  t hat  a sserts tha t one  noun  m odif ies ano ther noun [5].",
   "startOffset " :  102 ,    "e n dOf fs e t": 105
    }, {
     "refer en c eI D" : 17,
   " context " : "Ig norin g  annota tions, we  can trea t:pla i n  an d :annotat e as :re tain oper a tions [2 0
set is_based on_the POS tagset used_by the_Penn_Treebank, described_in_[15].",
  _  _"startOffset" : 78,
 _  __"endOffset" : 82
    }, {
      "referenceID"_:_9,
 ___  "context" : "It_was introduced in [11, 12,_17, 18].",
_     "startOffset" : 21,
__  _ "endOffset" : 37
    }, {
_     "referenceID"_: 14,
 ___  "context" :_"It was introduced in [11, 12,_17, 18].",
    _ "startOffset" : 21,
   _  "endOffset" : 37
 _  }, {
 _ _  "referenceID" : 15,
_  _ _"context" : "It_was introduced in [11, 12, 17,_18].",
  _   "startOffset" : 21,
__  __"endOffset"_: 37
_  _},_{
 __   "referenceID" : 9,
__    "context" : "It_competed in the CoNLL_Shared_Task 2011, where it_achieved the highest score in_both the closed and open tracks_[12].",
 _ _  "startOffset" : 114,
      "endOffset"_: 118
    },_{
   _ _"referenceID"_: 17,
 __ _ "context" : "There are three operations_[20]: •_Retain(n) • Insert(s) • Delete(n) Since_Clide is written in_Scala_Retain, Insert and Delete are implemented_using Scala case classes.",
  _   "startOffset" :_27,
__    "endOffset"_: 31
    },_{
  _   "referenceID" : 4,
 __   "context" : "relation_can_be either a string containing a_typed_dependency_relation (see [5]) or if_the relation is a collapsed relation,_a vector of the first and second part of_the relation (e.",
_    _"startOffset"_:_76,
      "endOffset" : 79
 _ _}, {
 _    "referenceID" : 4,
   _  "context" : "nn is the_noun compound modifier dependency relation that asserts that one noun modifies_another noun [5].",
     _"startOffset" : 102,
    _ "endOffset" : 105
__  }, {
   ___"referenceID"_: 17,
 _  _ "context" :_"Ignoring annotations,_we can treat_:plain and_:annotate as :retain_operations_[20