<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Event extraction from Social Media text using Conditional Random Fields</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Nagesh Bhattu Sristy</string-name>
          <email>nageshbs@idrbt.ac.in</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>N. Satya Krishna∗</string-name>
          <email>satya.krishna.nunna@gmail.com</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>D. V. L. N. Somayajulu</string-name>
          <email>soma@nitw.ac.in</email>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>IDRBT</institution>
          ,
          <addr-line>Hyderabad, Hyderabad, Telangana</addr-line>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>IDRBT</institution>
          ,
          <addr-line>Hyderabad, Telangana</addr-line>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>NIT</institution>
          ,
          <addr-line>Warangal, Warangal, Telangana</addr-line>
        </aff>
      </contrib-group>
      <abstract>
        <p>Social Media tools popularized the digital devices among masses making information dissemination easier and faster. Exchange of text is most popular efective means of communication across social media users. It has become necessity to process, understand the semantics of messages communicated as the messages have wide efect across the users. Event extraction refers to understanding the events across streams of social media messages. Event extraction helps in taking quicker corrective actions in case of natural calamities and hence possibly save lives of people. The main objective of the task is, drawing specific knowledge to predict the events( incidents) specified in digital text. We proposed two step procedure to extract events. First phase consists of applying a binary classifier to identify the messages, containing the event. Second phase consists of applying a sequence labeling technique, conditional random ifelds(CRF), to extract the event from the message. As social media text is noisy, it is a challenge to develop learning algorithms for these tasks. We use Parts of Speech (POS) tags of the words to address some of the issues in this challenge.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>CCS CONCEPTS</title>
      <p>• Information systems → Structured text search;
ACM proceedings, LATEX, text tagging</p>
    </sec>
    <sec id="sec-2">
      <title>INTRODUCTION</title>
      <p>Twitter1 and Facebook2 messages provide up-to-date information
about the current events. In todays world with proliferation in the
usage of social media, extracting current events from unstructured
tweets and posts has gained ample attention. Social media data
consists unusual characteristics like short length, stylistic
variations, acronyms, noisy and unstructured forms. This makes event
extraction a challenging problem in Natural Language Processing
(NLP). Numerous tools have been developed [14], [8] in the recent
past for enabling short-text processing for various tasks such as
POS Tagging, Chunking, Named Entity Recognition. These tools
use special techniques to account for the out-of-vocabulary terms in
text collected from twitter. Ritter et al. [14] uses brown’s clustering
on a huge corpus of english tweets to cluster similarly used words
such as ’2morrow’, ’tmrrow’, ’2mar’. In comparison to english, the
resources available for remaining languages are quite less even for
formal text. This shared task pertains to processing text written in
∗Work done as part of Ph.D
1http://www.twitter.com
2http://www.facebook.com
Indian languages namely ’hindi’, ’tamil’, ’malayalam’ to obtain the
events from the social media messages.</p>
      <p>Event Extraction is one of the most valuable tasks in Natural
Language and Information Extraction. For example, accurate selection
of news messages will improve the performance of news systems
[5]. Furthermore, by detecting the occurrence of events, as early as
possible, the performance of risk analysis systems Capet et al. [4],
trafic monitoring systems Kamijo et al . [7] can be improved and
forecasting civil unrest [13].</p>
      <p>Early works, most of the methods Allan et al. [1] [6] Yang et al.
[17] for event extraction have focused on news articles, which is the
only best source of information for current events. With the ability
of social media tools to virally popularize news items and their
acceptance across masses, numerous media agencies have been
relying on twitter, facebook feed pages to disseminate their news
highlights. Twitter feeds for hindi 3,4, tamil 5,6 and malayalam 7,8
are few examples of social media forums continuously posting the
news items. Among the posts made by these feeds, only a small
fraction of tweets contain events.</p>
      <p>Alen Ritter Allan et al. [1] developed the first open-domain event
extraction tool (TWICAL) for twitter data. Extraction of
NASDAQ100 listed companies information from RSS feed using StockWatcher
was proposed by [10]. Hermes Borsje et al. [3] is news interpreter
that supports the decision making process to filter the relevant news
using Semantic Web technologies. Using specific features related
to the natural disasters, Sakaki et al. [15] proposed a method to
detect the earthquake-related tweets. Benson et al. [2] presented a
relation extractor to predict the artists and venues from tweets.
2</p>
    </sec>
    <sec id="sec-3">
      <title>OVERVIEW</title>
      <p>Social media text written in Indian languages has received much
lesser attention compared to english. The multiplicity of languages
in India and usage by comparatively lesser population can be
thought of as the possible reasons for this observation. Tokenization
is first step in processing the social media text written in Indian
languages. Efective tokenization helps in segregating meaningful
features from noise. Feature extraction involves conversion of text
into lemma form and morphological analysis. POS tagging involves
attributing POS tags for the text, observed as a sequence of words.
We depend on the tools available 9 [12] for POS tagging of various
Indian language sentences. The task is to identify event carrying
3https://twitter.com/aajtak?lang=en
4https://twitter.com/bbchindi?lang=en
5https://twitter.com/news7tamil?lang=en
6https://twitter.com/thatstamil?lang=en
7https://twitter.com/manoramanews?lang=en
8https://twitter.com/beatsofkerala?lang=en
9http://ltrc.iiit.ac.in/download.php
messages and then extract relevant portions of the events from
such carrying text. The main phase of the approach consists of
building a classifier to distinguish messages based on whether they
carry event or not. Further post-processing is applied to extract the
actual event from the event text. This is done through sequence
tagger trained from the provided training data. Figure 1 indicates
the overview of the our approach followed for the shared task.
We use mallet 10 [9] the toolkit for the various machine learning
algorithms applied in this work.
2.1</p>
    </sec>
    <sec id="sec-4">
      <title>Problem Statement</title>
      <p>Given a collection of sequence of words D where each sentence is
of form w1, w2...wn , identify the sequences carrying events. For the
identified sequences a label sequence l1, l2...ln is predicted where
each tag li ∈ B, I , O. The tags B,I,O indicate the beginning, inside
and outside of event in event carrying text.
2.2</p>
    </sec>
    <sec id="sec-5">
      <title>Tokenization &amp; POS Tagging</title>
      <p>Tokenization for our approach follows that of twokenizer 11. This
was extended to handle the unicodes of Indian languages. The
indian languages hindi,tamil,malayalam have unicode ranges of
0x0900-0x097F, 0x0B80-0x0BFF, 0x0D00-0x0D7F respectively.
Emoticons, urls, hashtags, userids are various other special tokens.</p>
      <p>
        The POS taggers used from 12 have their own tokenizers and
lemmatizers to do the morphological analysis. These tools are designed
for news wire text which is supposed to be much more cleaner than
the text seen on social media. We modified the respective tokenizers
to get process the social media text.
10http://mallet.cs.umass.edu/index.php
11https://github.com/brendano/tweetmotif
12http://ltrc.iiit.ac.in/download.php
The critical component of our solution is the classifier which detects
the events. We analysed the detection capabilities of 3 classifiers
namely naive Bayes, logistic regression and semi-supervised naive
Bayes EM. Naive Bayes (NB) algorithm models the classifier as an
outcome of generative algorithm. If D is a training dataset of N
examples x1, x2, ...xN and y1, y2...yN are corresponding labels, NB
model is expressed in the equation (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ). We assume that the each
xi ∈ R F and each yi ∈ {1, 2, .., L} are the domains of respective
portions of examples (xi, yi ) where F is the number of features
and L is number of labels. xi j represents j’th features count in i’th
example. wj is the jth feature in the set of features. p (wj |y) is the
j’th element of the parameter vector associated with label y.
      </p>
      <p>N
maximize X loд(p (xi, yi ))</p>
      <p>i=1
p (xi, yi ) = p (yi )p (xi |yi )
p (xi, yi ) =</p>
      <p>
        F
Y p (wj |yi )xi j
j=1
(
        <xref ref-type="bibr" rid="ref1">1</xref>
        )
(
        <xref ref-type="bibr" rid="ref2">2</xref>
        )
(
        <xref ref-type="bibr" rid="ref3">3</xref>
        )
(
        <xref ref-type="bibr" rid="ref5">5</xref>
        )
(
        <xref ref-type="bibr" rid="ref6">6</xref>
        )
(
        <xref ref-type="bibr" rid="ref7">7</xref>
        )
      </p>
    </sec>
    <sec id="sec-6">
      <title>Event Extraction</title>
      <p>
        Event extraction is performed using CRF [16]. If (xi, yi) is the i’th
example where xi is a feature sequence of lenght T and yi is
corresponding label sequence, the CRF models the maximization of joint
conditional likelihood in Equation (
        <xref ref-type="bibr" rid="ref6">6</xref>
        ) where p (yi |xi) is defined as
      </p>
      <p>
        Naive Bayes EM (NBEM) is a semi-supervised algorithm [11]
which makes use of test data also along with the training data to
infer the classifier. If the dataset training and testing portions of the
dataset are designated as Dl and Du respectively, the NBEM learns
the classifier as a maximizer of (
        <xref ref-type="bibr" rid="ref4">4</xref>
        ). The first part of the objective is
same as that of NB approach. Labels of test examples are not known
and are learnt in an iterative EM algorithm, where E-Step predicts
the labels of the test examples and M-Step learns the parameters of
the model with the probabilistic labels learnt in the E-Step.
maximize X loд(p (xi, yi )) + X loд(p (xi, y) (
        <xref ref-type="bibr" rid="ref4">4</xref>
        )
i ∈Dl
i ∈Du
      </p>
      <p>
        Maximum entropy or logistic regression (MaxEnt) is a
discriminative approach for building the classifier and hence does not get
much benefit of the EM setting. MaxEnt learns the model which
maximizes the objective in equation (
        <xref ref-type="bibr" rid="ref6">6</xref>
        ). The conditional
distribution in equation (
        <xref ref-type="bibr" rid="ref7">7</xref>
        ) is softmax function. The numerator of equation
(
        <xref ref-type="bibr" rid="ref7">7</xref>
        ) is the score of example xi in class yi . The denominator is
normalizer which ensures that the value p (y |x) is summing upto 1. It
is known as maximum entropy, because Equation (
        <xref ref-type="bibr" rid="ref6">6</xref>
        ) is a dual of
equivalent maximization of entropy under feature constraints. µ y
is parameter vector corresponding to class y, which is of same size
as that of F (number of features). L is the total number of labels.
      </p>
      <p>N
maximize X loд(p (yi |xi ))</p>
      <p>i=1
p (yi |xi) = PL</p>
      <p>
        y=1 µ yt .xi)
exp (µ yi t .xi)
in Equation (
        <xref ref-type="bibr" rid="ref8">8</xref>
        ). The diference between the numerator in Equations
(
        <xref ref-type="bibr" rid="ref6">6</xref>
        ) and (
        <xref ref-type="bibr" rid="ref8">8</xref>
        ) lies in features considered. CRF tries to model
sequential dependencies, while MaxEnt classifier disregards sequential
dependecies. The feature vector f (xi, yi) in Equation (
        <xref ref-type="bibr" rid="ref8">8</xref>
        ) is similar
to the feature vector in Equation (
        <xref ref-type="bibr" rid="ref6">6</xref>
        ), encoding number of times a
feature associated with a label. The feature vector g(yi) encodes
the label sequence features or number of times a label combination
appears in succession in the example (xi, yi). The number of
features of g(yi) vector is LX L each encoding possible label bigrams.
The denominator Z (xi) is normalizer which is evaluated over all
possible label assignments (LT f or xi)over label space. Evaluation
of Z (xi) is eficiently done using forward-backward algorithm. µ
and η are respective parameters associated with node features and
edge features of CRF.
      </p>
      <p>p (yi |xi) =
exp (µ t .f (xi, yi) + ηt g(yi))</p>
      <p>
        Z (xi)
(
        <xref ref-type="bibr" rid="ref8">8</xref>
        )
      </p>
      <p>We used CRF++ 13 as our sequence labeller. CRF++ allows feature
templates to be given for learning. The features being used for
CRF++ are unigrams with a window of 5 words from the current
word. As unigram features are extremely noisy as they are mostly
seen very few times in the corpus and test data unigrams mostly are
seen for the first time, we use POS tag based features also as second
set of features to help the model inferred by CRF in mimicking event
extraction process. We use similar 5 tag window for POS tags also.
We used label based bigram features as label based features. The
dataset provided for the shared task contains the starting ending
positions of the event for each matched event text with in the
text. We have converted this format of the input to the B, I , O based
tagging to reflect the input for CRF++. As the tokenization employed
adds spaces to reflect the tokenization process, the output of CRF is
remapped to original to reflect the positions of the event as expected
by the shared task.
3</p>
    </sec>
    <sec id="sec-7">
      <title>EXPERIMENTS</title>
      <p>The datasets taken for the task are summarized in Table 1. The
preprocessing replaces all urls with keyword URL, ’@’ mentions
are replaced with USER and hash-tags are all preserved as they
sometime contain the event specific tags such as #BombBlast
#EarthQuake. The test set for hindi is 4-times that of trainset while tamil
and malayalam are relatively better in this ratio. Number of unique
words is lesser for malayalam.
13https://taku910.github.io/crfpp/</p>
      <sec id="sec-7-1">
        <title>Language Hindi Hindi Hindi</title>
        <p>Hindi
Hindi</p>
        <p>Hindi
Malayalam
Malayalam
Malayalam
Tamil
Tamil
Tamil</p>
      </sec>
      <sec id="sec-7-2">
        <title>Method</title>
        <p>NB
MaxEnt</p>
        <p>NBEM
MaxEnt + POS
MaxEnt + POS</p>
        <p>NBEM</p>
        <p>NB
MaxEnt
NBEM</p>
        <p>NB
MaxEnt
NBEM
We used mallet library for building the binary classifier for event
detection. The training dataset consisted of event-text file and
annotation file. The events text file consisted of one message for each
line with additional details such as user-id, message-id. The
annotation file shows message-id and event index for each event carrying
message given in events file. We prepared a binary classifier
treating the missing messages of annotation file as labelled ’no’, while
matched events as ’yes’. The performance of classifier is measured
using two metrics namely Accuracy and F1-Score. They are defined
in equations</p>
        <p>Accuracy =
Precision =</p>
        <p>Recall =
F 1 − Score =</p>
        <p>N oo f CorrectPredictions
T otalnoo f Predictions</p>
        <p>T ruePositives
T otalPositivePredictions</p>
        <p>T ruePositives
T otalPositiveexamples
2 ∗ Precision ∗ Recall</p>
        <p>
          Precision + Recall
(
          <xref ref-type="bibr" rid="ref9">9</xref>
          )
(
          <xref ref-type="bibr" rid="ref10">10</xref>
          )
(
          <xref ref-type="bibr" rid="ref11">11</xref>
          )
(
          <xref ref-type="bibr" rid="ref12">12</xref>
          )
        </p>
        <p>We performed a 5 fold cross-validation to detect events. The
classification accuracies and F1-Scores of diferent classifiers NB, ME,
NBEM are reported in table 2</p>
        <p>We can observe that MaxEnt classifier performs better than NB
in all cases significantly, asserting the superiority of discriminative
approaches. Adding POS tag features has improved the classification
accuracy of MaxEnt and NB by 4.4% and 6.4% respectively. NBEM
is the semi-supervised approach which is consistently better than
the other two methods with and with-out POS tags, as it uses the
test portion of the data for learning its model.
3.2</p>
      </sec>
    </sec>
    <sec id="sec-8">
      <title>Event Extraction Accuracy</title>
      <p>
        The event extraction module contains the tags B, I, O indicating
the beginning, inside, ending of a event. The accuracy and F1-Score
of Equations (
        <xref ref-type="bibr" rid="ref9">9</xref>
        ) and (
        <xref ref-type="bibr" rid="ref12">12</xref>
        ) are extended for the CRF output and the
tagging efectiveness is reported in table 3. Our submission only
includes only one language namely hindi.
      </p>
      <sec id="sec-8-1">
        <title>Language Hindi</title>
      </sec>
      <sec id="sec-8-2">
        <title>Precision 31.56 Recall 71.39</title>
        <p>F-measure
43.77</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>James</given-names>
            <surname>Allan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Ron</given-names>
            <surname>Papka</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Victor</given-names>
            <surname>Lavrenko</surname>
          </string-name>
          .
          <year>1998</year>
          .
          <article-title>On-line new event detection and tracking</article-title>
          .
          <source>In Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval. ACM</source>
          ,
          <volume>37</volume>
          -
          <fpage>45</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>Edward</given-names>
            <surname>Benson</surname>
          </string-name>
          , Aria Haghighi, and
          <string-name>
            <given-names>Regina</given-names>
            <surname>Barzilay</surname>
          </string-name>
          .
          <year>2011</year>
          .
          <article-title>Event discovery in social media feeds</article-title>
          .
          <source>In Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies-Volume 1. Association for Computational Linguistics</source>
          ,
          <fpage>389</fpage>
          -
          <lpage>398</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>Jethro</given-names>
            <surname>Borsje</surname>
          </string-name>
          , Leonard Levering, and
          <string-name>
            <given-names>Flavius</given-names>
            <surname>Frasincar</surname>
          </string-name>
          .
          <year>2008</year>
          .
          <article-title>Hermes: a semantic web-based news decision support system</article-title>
          .
          <source>In Proceedings of the 2008 ACM symposium on Applied computing. ACM</source>
          ,
          <volume>2415</volume>
          -
          <fpage>2420</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>Philippe</given-names>
            <surname>Capet</surname>
          </string-name>
          , Thomas Delavallade, Takuya Nakamura, Agnes Sandor, Cedric Tarsitano, and
          <string-name>
            <given-names>Stavroula</given-names>
            <surname>Voyatzi</surname>
          </string-name>
          .
          <year>2008</year>
          .
          <article-title>A Risk Assessment System with Automatic Extraction of Event Types</article-title>
          . Springer US, Boston, MA,
          <fpage>220</fpage>
          -
          <lpage>229</lpage>
          . https://doi.org/10. 1007/978-0-
          <fpage>387</fpage>
          -87685-6_
          <fpage>27</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>Philipp</given-names>
            <surname>Cimiano</surname>
          </string-name>
          and
          <string-name>
            <given-names>Stefen</given-names>
            <surname>Staab</surname>
          </string-name>
          .
          <year>2004</year>
          .
          <article-title>Learning by Googling</article-title>
          .
          <source>SIGKDD Explor. Newsl. 6</source>
          ,
          <issue>2</issue>
          (Dec.
          <year>2004</year>
          ),
          <fpage>24</fpage>
          -
          <lpage>33</lpage>
          . https://doi.org/10.1145/1046456.1046460
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <surname>George</surname>
            <given-names>R Doddington</given-names>
          </string-name>
          , Alexis Mitchell,
          <article-title>Mark A Przybocki, Lance A Ramshaw, Stephanie Strassel</article-title>
          , and
          <string-name>
            <surname>Ralph M Weischedel</surname>
          </string-name>
          .
          <year>2004</year>
          .
          <article-title>The Automatic Content Extraction (ACE) Program-Tasks, Data, and</article-title>
          <string-name>
            <surname>Evaluation.. In LREC</surname>
          </string-name>
          , Vol.
          <volume>2</volume>
          .
          <fpage>837</fpage>
          -
          <lpage>840</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>Shunsuke</given-names>
            <surname>Kamijo</surname>
          </string-name>
          , Yasuyuki Matsushita, Katsushi Ikeuchi, and
          <string-name>
            <given-names>Masao</given-names>
            <surname>Sakauchi</surname>
          </string-name>
          .
          <year>2000</year>
          .
          <article-title>Trafic monitoring and accident detection at intersections</article-title>
          .
          <source>IEEE transactions on Intelligent transportation systems 1</source>
          ,
          <issue>2</issue>
          (
          <year>2000</year>
          ),
          <fpage>108</fpage>
          -
          <lpage>118</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>Chenliang</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Jianshu</given-names>
            <surname>Weng</surname>
          </string-name>
          , Qi He, Yuxia Yao, Anwitaman Datta, Aixin Sun, and
          <string-name>
            <surname>Bu-Sung Lee</surname>
          </string-name>
          .
          <year>2012</year>
          .
          <article-title>TwiNER: Named Entity Recognition in Targeted Twitter Stream</article-title>
          .
          <source>In Proceedings of the 35th International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR '12)</source>
          . ACM, New York, NY, USA,
          <fpage>721</fpage>
          -
          <lpage>730</lpage>
          . https://doi.org/10.1145/2348283.2348380
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>Andrew</given-names>
            <surname>Kachites McCallum</surname>
          </string-name>
          .
          <year>2002</year>
          .
          <article-title>MALLET: A Machine Learning for Language Toolkit</article-title>
          . (
          <year>2002</year>
          ). http://mallet.cs.umass.edu.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>Alex</surname>
            <given-names>Micu</given-names>
          </string-name>
          , Laurens Mast, Viorel Milea, Flavius Frasincar, and
          <string-name>
            <given-names>Uzay</given-names>
            <surname>Kaymak</surname>
          </string-name>
          .
          <year>2009</year>
          .
          <article-title>Financial news analysis using a semantic web approach</article-title>
          .
          <source>In Semantic Knowledge Management: An Ontology-Based Framework. IGI Global</source>
          ,
          <volume>311</volume>
          -
          <fpage>328</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>Kamal</surname>
            <given-names>Nigam</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Andrew Kachites Mccallum</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Sebastian</given-names>
            <surname>Thrun</surname>
          </string-name>
          , and Tom Mitchell.
          <year>2000</year>
          .
          <article-title>Text Classification from Labeled and Unlabeled Documents using EM</article-title>
          .
          <source>Machine Learning</source>
          <volume>39</volume>
          ,
          <volume>2</volume>
          (
          <issue>01 May 2000</issue>
          ),
          <fpage>103</fpage>
          -
          <lpage>134</lpage>
          . https://doi.org/10.1023/A: 1007692713085
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <surname>Avinesh</surname>
            <given-names>PVS</given-names>
          </string-name>
          and
          <string-name>
            <given-names>G</given-names>
            <surname>Karthik</surname>
          </string-name>
          .
          <year>2007</year>
          .
          <article-title>Part-of-speech tagging and chunking using conditional random fields and transformation based learning</article-title>
          .
          <source>In Proceedings of IJCAI Workshop on Shallow Parsing for South Asian Languages</source>
          , Vol.
          <volume>21</volume>
          .
          <fpage>21</fpage>
          -
          <lpage>25</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <surname>Naren</surname>
            <given-names>Ramakrishnan</given-names>
          </string-name>
          , Patrick Butler, Sathappan Muthiah, Nathan Self, Rupinder Khandpur, Parang Saraf,
          <string-name>
            <surname>Wei</surname>
            <given-names>Wang</given-names>
          </string-name>
          , Jose Cadena, Anil Vullikanti, Gizem Korkmaz, Chris Kuhlman, Achla Marathe,
          <string-name>
            <given-names>Liang</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Ting</given-names>
            <surname>Hua</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Feng</given-names>
            <surname>Chen</surname>
          </string-name>
          , Chang Tien Lu, Bert Huang, Aravind Srinivasan, Khoa Trinh, Lise Getoor, Graham Katz, Andy Doyle, Chris Ackermann, Ilya Zavorin,
          <string-name>
            <given-names>Jim</given-names>
            <surname>Ford</surname>
          </string-name>
          , Kristen Summers, Youssef Fayed, Jaime Arredondo, Dipak Gupta, and
          <string-name>
            <given-names>David</given-names>
            <surname>Mares</surname>
          </string-name>
          .
          <year>2014</year>
          .
          <article-title>'Beating the News' with EMBERS: Forecasting Civil Unrest Using Open Source Indicators</article-title>
          .
          <source>In Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '14)</source>
          . ACM, New York, NY, USA,
          <fpage>1799</fpage>
          -
          <lpage>1808</lpage>
          . https://doi.org/10.1145/2623330.2623373
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <surname>Alan</surname>
            <given-names>Ritter</given-names>
          </string-name>
          , Sam Clark, Mausam, and
          <string-name>
            <given-names>Oren</given-names>
            <surname>Etzioni</surname>
          </string-name>
          .
          <year>2011</year>
          .
          <article-title>Named Entity Recognition in Tweets: An Experimental Study</article-title>
          .
          <source>In Proceedings of the Conference on Empirical Methods in Natural Language Processing (EMNLP '11)</source>
          .
          <article-title>Association for Computational Linguistics</article-title>
          , Stroudsburg, PA, USA,
          <fpage>1524</fpage>
          -
          <lpage>1534</lpage>
          . http://dl.acm.org/citation.cfm?id=
          <volume>2145432</volume>
          .
          <fpage>2145595</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <surname>Takeshi</surname>
            <given-names>Sakaki</given-names>
          </string-name>
          , Makoto Okazaki, and
          <string-name>
            <given-names>Yutaka</given-names>
            <surname>Matsuo</surname>
          </string-name>
          .
          <year>2010</year>
          .
          <article-title>Earthquake shakes Twitter users: real-time event detection by social sensors</article-title>
          .
          <source>In Proceedings of the 19th international conference on World wide web. ACM</source>
          ,
          <volume>851</volume>
          -
          <fpage>860</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>Charles</given-names>
            <surname>Sutton</surname>
          </string-name>
          ,
          <string-name>
            <surname>Andrew McCallum</surname>
          </string-name>
          , et al.
          <year>2012</year>
          .
          <article-title>An introduction to conditional random fields</article-title>
          .
          <source>Foundations and Trends® in Machine Learning</source>
          <volume>4</volume>
          ,
          <issue>4</issue>
          (
          <year>2012</year>
          ),
          <fpage>267</fpage>
          -
          <lpage>373</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <surname>Yiming</surname>
            <given-names>Yang</given-names>
          </string-name>
          , Tom Pierce, and Jaime Carbonell.
          <year>1998</year>
          .
          <article-title>A study of retrospective and on-line event detection</article-title>
          .
          <source>In Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval. ACM</source>
          ,
          <volume>28</volume>
          -
          <fpage>36</fpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>