<!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>Text Classification Based on Deep Textual Parsing</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Boris Galitsky</string-name>
          <email>bgalitsky@hotmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Dmitry Ilvovsky</string-name>
          <email>dilvovsky@hse.ru</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Knowledge Trail Inc.</institution>
          ,
          <addr-line>San Jose</addr-line>
          ,
          <country country="US">USA</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>National Research University Higher School of Economics</institution>
          ,
          <addr-line>Moscow</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2011</year>
      </pub-date>
      <abstract>
        <p>The problem of classifying text based on the deep parsing structure is addressed. An algorithm for document classification tasks where counts of words or n-grams is insufficient is proposed. The parse tree kernel method at the level of paragraphs, based on anaphora, rhetoric structure relations and communicative actions linking phrases in the parse thicket is considered.</p>
      </abstract>
      <kwd-group>
        <kwd>text genre</kwd>
        <kwd>style classification</kwd>
        <kwd>rhetoric structure</kwd>
        <kwd>discourse</kwd>
        <kwd>metalanguage</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>
        The problem of genre classification (also referred as automatic genre identification,
AGI) has received so far some attention of the researches. Mainly there are two tied
directions of these studies:
1. To develop intelligible genre system and to collect a corpus which would represent
the established genre system. Usually the texts are collected from the Web [
        <xref ref-type="bibr" rid="ref11 ref8">8, 11</xref>
        ].
2. To develop a machine classifier for classifying texts of different genres [
        <xref ref-type="bibr" rid="ref10 ref11 ref12 ref13 ref14 ref9">9-14</xref>
        ].
      </p>
      <p>
        In this paper we will consider both style and genre classification, without paying a
lot of attention on the difference between these notions. Following [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] we will refer to
“style” as to specific usage of language, and to “genre” as to the category of a text,
which represent its intention and aim.
      </p>
      <p>
        There are several applications of genre classification:
1. Evaluating how many different texts are there on the Web. This application can be
treated as developing a socio- or psycho-metric tool [
        <xref ref-type="bibr" rid="ref11 ref12 ref13 ref8">8,11,12,13</xref>
        ].
2. Using genre classification for improving user-based information retrieval: based on
the query, the search system should provide documents of appropriate genre (for
example, if the query sounds scientific enough, return scholar papers, if the query
is less formal – blogs, social media) [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ].
3. Recognizing document type for a document management system (like security,
document recommendation, and other applications) [
        <xref ref-type="bibr" rid="ref28">28</xref>
        ].
      </p>
      <p>
        Besides there are different attempts to genre classifications the majority of
researches agree upon the following idea: the less complicated text elements are used as
the features for classification, the better the results are. For example, [
        <xref ref-type="bibr" rid="ref14 ref29">14,29</xref>
        ] suggests
using character n-grams to perform genre classification on Brown corpus, BNC, HGC
and other corpora. In [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] the syntactic patterns, morphological patterns and character
n-grams are used to build feature sets and are compared to each other. The latter
allowed us to achieve the highest F-measure, while the former provides poor results.
The morphological pattern based classifier does not outperform the character-based
one. In [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] common words are used to form feature sets.
      </p>
      <p>
        To perform text classification in the described domains, we employ discourse
information such as anaphora, rhetoric structure, entity synonymy. Relying on syntactic
parse trees would provide us with specific expressions and phrasings connected with a
style of writing. However, it will still be insufficient for a thorough description of
linguistic features inherent to a style of writing. It is hard to identify such features
without employing a discourse structure of a document. This discourse structure
needs to include anaphora and rhetoric relations. Furthermore, to systematically learn
these discourse features associated with the style of writing one needs a unified
approach to classify graph structures at the level of paragraphs [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ].
      </p>
      <p>
        The design of such features for automated learning of syntactic and discourse
structures for classification is still done manually today. To overcome this problem,
tree kernel approach has been proposed [
        <xref ref-type="bibr" rid="ref26">26</xref>
        ]. Tree kernels constructed over syntactic
parse trees, as well as discourse trees [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ] is one of the solutions to conduct feature
engineering. Convolution tree kernel [
        <xref ref-type="bibr" rid="ref24">24</xref>
        ] defines a feature space consisting of all
subtree types of parse trees and counts the number of common subtrees to express the
respective distance in the feature space.
      </p>
      <p>
        The kernel ability to generate large feature sets is useful to assure we have enough
linguistic features to differentiate between the classes, to quickly model new and not
well understood linguistic phenomena in learning machines. However, it is often
possible to manually design features for linear kernels that produce high accuracy and
fast computation time whereas the complexity of tree kernels may prevent their
application in real scenarios. SVM [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ] can work directly with kernels by replacing the dot
product with a particular kernel function. This useful property of kernel methods, that
implicitly calculates the dot product in a high-dimensional space over the original
representations of objects such as sentences, has made kernel methods an effective
solution to modeling structured linguistic objects [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ].
      </p>
      <p>In this paper we will try to show how using more complicated and extensive
syntactical information allows improving the result of genre classification. The goal of
this research is to apply the learning based on high-level linguistic features for the
style and genre classification task and also to estimate the influence of the corpus
annotation quality to the quality of the performance.
2</p>
    </sec>
    <sec id="sec-2">
      <title>From style to genre</title>
      <p>Moving from “simple” to “complex” system of style classes we start to distinguish
texts between 2 classes: description (object-level) and meta-description
(metalanguage or meta-level). We consider domain of literature documents.</p>
      <p>A combination of object-language and metalanguage patterns and description
styles can be found in literature. In the literature domain, we attempt to draw a
boundary between the pure metalanguage (works of literature with a special level of
abstraction) and a mixed level text (a typical work of literature). Describing the nature, a
historical event, an encounter between people, an author uses a language object.
Describing the thought, beliefs, desires and knowledge of characters about the nature,
events and interactions between people, an author may use a metalanguage, if its
entities/ range over the expressions (phrases) of the language-object.</p>
      <p>An outstanding example of the use of metalanguage in literature is Franz Kafka’s
novel “The Trial”. According to our model, the whole plot is described in
metalanguage, and object-level layer is not presented at all. This is unlike a typical work of
literature, where both levels are employed and object-level prevail, such as fairy tales.
The novel is a pure example of the presence of meta-theory and absence of
objectlevel theory, from the standpoint of logic. The reader is expected to form the object–
level theory herself to avoid an ambiguity in the interpretation of this novel.</p>
      <p>
        For the genre classification we used the system of genres and the corpus from
[
        <xref ref-type="bibr" rid="ref2 ref3">2,3</xref>
        ]. Let us describe the genre system in more details. Unlike in other disciplines,
authors do not define particular genres in systematic, exact, crisp way, but instead of
this construct 17 main so-called Functional Dimension which are the basis for a genre
description. For example, the direction A7 corresponds to instructions (tutorials,
FAQs, manuals, recipes), the direction A11 – to personal writing, such as diary-like
blogs, personal letters, traditional diaries. A collection of texts, picked from the Web,
is annotated by humans according to these directions: the annotator is asked to what
extent this or that direction is present in the text. There are four possible answers: 0
none or hardly at all; 0.5 slightly; 1 somewhat or partly; 2 strongly or very much so.
After the annotation, every text is represented as a vector in the space of 17 functional
dimensions, which makes any kind of machine learning applicable. The texts and
functional dimension are bi-clustered and the resulting clusters are said to represent a
genre. The resulting system of genres consists of combinations of FTDs. Let us
describe some of genres, achieved in [
        <xref ref-type="bibr" rid="ref2 ref3">2,3</xref>
        ]. There are genres that use only singly
dimension: for example, the cluster Cl6 corresponds to the dimension A16, which is aimed
at presenting information. But the are some genres that correspond to two or three
dimensions: the cluster Cl13 stands for dimensions A1 + A11, which are opinion
blogs, often reporting personal experience and expressing one’s emotions; and the
cluster Cl14 stands for dimensions A11 + A19 + A3, which are diary blogs expressing
one’s emotions and attempting to embellish the description. The clusters often
correspond to traditional genres, but are more reliable than traditional genres, since the
annotator does not have to choose between several predefined genres. We adopt both
the genre system and the corpus from this research.
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>Discourse text structure for the classification task</title>
      <p>It turns out that low-level features could be insufficient for the style classification
in some domains like meta-document or design-document text detection. Since
important phrases can be distributed through different sentences, one needs a sentence
boundary – independent way of extracting both syntactic and discourse features.
Therefore we intend to combine/merge parse trees to make sure we cover all the
phrase of interest.</p>
      <p>
        Rhetorical Structure Theory (RST) [
        <xref ref-type="bibr" rid="ref20 ref5">5, 20</xref>
        ] has been used to describe or understand
the structure of texts and to link rhetorical structure to other phenomena, such as
anaphora or cohesion. RST is one of the most popular approach to model
extrasentence as well as intra-sentence discourse. RST represents texts by labeled
hierarchical structures. Their leaves correspond to contiguous Elementary Discourse Units;
adjacent ones are connected by rhetorical relations (e.g., Elaboration, Contrast),
forming larger discourse units (represented by internal nodes), which in turn are also
subject to this relation linking. Discourse units linked by a rhetorical relation are further
distinguished based on their relative importance in the text: nucleus being the central
part, whereas satellite being the peripheral one. Discourse analysis in RST involves
two subtasks: discourse segmentation is the task of identifying the EDUs, and
discourse parsing is the task of linking the discourse units into a labeled tree.
      </p>
      <p>Discourse analysis explores how meanings can be built up in a communicative
process, which varies between a text metalanguage and a text language-object. Each
part of a text has a specific role in conveying the overall message of a given text.
4</p>
    </sec>
    <sec id="sec-4">
      <title>Learning on extended parse trees</title>
      <p>
        The design of discourse and syntactic features for automated text assessment tasks is
still an art nowadays. One of the solutions to systematically treat these features is the
set of tree kernels built over syntactic parse trees, extended by discourse relations.
Convolution tree kernel [
        <xref ref-type="bibr" rid="ref24 ref25">24, 25</xref>
        ] defines a feature space consisting of all subtree types
of parse trees and counts the number of common subtrees as the syntactic similarity
between two parse trees. They have found a lot of applications in a number of NLP
tasks.
      </p>
      <p>
        To obtain the inter-sentence links, we employed anaphoric relations from Stanford
NLP [
        <xref ref-type="bibr" rid="ref22 ref23">22, 23</xref>
        ]. Rhetoric parser [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] builds a discourse parse tree by applying an
optimal parsing algorithm to probabilities obtained from two conditional random fields,
intra-sentence and multi-sentence parsing. We also rely on additional tags to extend
SVM feature space, finding similarities between trees. These additional tags include
noun entities from Stanford NLP such as organization and title, and verb types from
VerbNet.
      </p>
      <p>
        For every arc which connects two parse trees, we obtain the extension of these
trees, extending branches according to the arc. For a given parse tree, we will obtain a
set of its extension, so the elements of kernel will be computed for many extensions,
instead of just a single tree [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]. The problem here is that we need to find common
sub-trees for a much higher number of trees than the number of sentences in text,
however by subsumption (sub-tree relation) the number of common sub-trees will be
substantially reduced. The resultant trees are not the proper parse trees for a sentence,
but nevertheless form an adequate feature space for tree kernel learning.
      </p>
    </sec>
    <sec id="sec-5">
      <title>Evaluation</title>
      <sec id="sec-5-1">
        <title>Style dataset</title>
        <p>For the literature domain, we collected 160 paragraphs as meta-documents from
Kafka’s novel “The Trial” as well as his other novels so that these paragraphs are read as
metalanguage patterns. As a set of object-level documents we manually selected 200
paragraphs of text in the same domain (scholarly articles about “The Trial”). We split
the data into 3 subsets for training/evaluation portions and cross-validation.
Nearest neighbor classifier 48.5
(TF*IDF based)
tTrreeees kernel – regular parse 63.3</p>
        <sec id="sec-5-1-1">
          <title>Tree kernel SVM – extended</title>
          <p>trees for both anaphora and 71.5
RST</p>
        </sec>
      </sec>
      <sec id="sec-5-2">
        <title>Precision Recall</title>
        <p>
          As it was mentioned earlier we adopted the genre system and the corpora from [
          <xref ref-type="bibr" rid="ref1 ref3">1, 3</xref>
          ].
The genre system is constructed in the following way. First, the Functional Text
Dimensions (FTD) are defined. The FTD are genre annotations which reflect
judgements as to what extent a text can be interpreted as belonging to a generalized
functional category. A genre is a combination of several FTD. In other words, the genre is
a point in the space, defined by FTD.
        </p>
        <p>The corpus was annotated by humans. Every user was asked to evaluate texts of
FTD on a scale: 0 none or hardly at all; 0.5 slightly; 1 somewhat or partly; 2 strongly
or very much so. See an example of FTD and annotated texts below.</p>
        <sec id="sec-5-2-1">
          <title>To what extent does the text argue to persuade the reader to sup</title>
          <p>port (or renounce) an opinion or a point of view? (‘Strongly’, for
argumentative blogs, editorials or opinion pieces)
To what extent is the text’s content fictional? (‘None’ if you
judge it to be factual/informative.)
To what extent does the text aim at teaching the reader how
something works? (For example, a tutorial or an FAQ)
To what extent does the text appear to be an informative report of
events recent at the time of writing?
To what extent does the text lay down a contract or specify a set
of regulations?</p>
          <p>
            In [
            <xref ref-type="bibr" rid="ref2 ref3">2,3</xref>
            ] 17 general dimensions are defined. Among them ten A1, A3, A4, A5, A6,
A7, A8, A9, A11 form 7 different genres. See the explanations of these genres bellow.
For further classification we will exploit these genres.
─ [tells] Instructions for how to use software.
─ [tele] Instructions for how to use hardware.
─ [ted] Emotional speech on a political topic. Presentation of him/her self. Attempt to
sound convincing.
─ [synd] An article on a political event by a professional journalist.
─ [news] A presentation of a news article in an objective, independent manner.
─ [fict] Novels, stories, verses.
─ [un] UN reports.
          </p>
          <p>The values of quality measures – recall, precision and F-measure – are
optimistically high. The highest F-measure is achieved by classification of Ted against Synd.
Both of these genres correspond to describing political topics. However the rhetorical
structures for these genres are completely different. Hence we are able to learn a very
efficient classifier to distinguish between these genres.</p>
          <p>Another important point is a superior performance in the comparison with the
results for the shallow-annotated dataset. Although the classes from this dataset could
be roughly mapped on some genres (e.g. meta-level literature texts are corresponding
with the [fict] genre) the distinction is less accurate.
6</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>Conclusions</title>
      <p>We observed that using SVM TK one can differentiate between a broad range of text
styles and genres. Each text style and genre has its inherent rhetoric structure which is
leveraged and automatically learned. Since the correlation between text style and text
vocabulary is rather low, traditional classification approaches which only take into
account keyword statistics information could lack the accuracy in the complex cases.</p>
      <p>In this paper we have presented two experiments on style and genre classifications.
The style experiments were aimed at distinguishing between two types of writing and
language usage: description and meta-description. These styles share the same
vocabulary but the rhetoric structure of documents with descriptions and documents with
meta-descriptions is fairly different.</p>
      <p>For the genre classification part we adopted a corpus annotated with 7 different
genres and conducted a series of pairwise classification between two genres. From
mathematical point of view, as a part of future extension of this research we may
conduct one genre against all-others-genres-together classification, which will allow
us to understand how distinctive each genre is. Hence we will obtain a more complete
picture of the genre system in general. If every genre is distinctive enough, it means
that the whole genre system is well developed and the dimensions are adequate.
However there might arise some problems because of the corpus being unbalanced: there
are different numbers of texts in every genre and to tackle this problem we will have
to balance the corpus.
7</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Lee</surname>
          </string-name>
          , David YW.
          <article-title>Genres, registers, text types, domains and styles: Clarifying the concepts and navigating a path through the BNC jungle</article-title>
          . (
          <year>2001</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Sharoff</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <article-title>In the garden and in the jungle: Comparing genres in the BNC and Internet</article-title>
          .
          <source>In Genres on the Web: Computational Models and Empirical Studies</source>
          , pages
          <fpage>149</fpage>
          -
          <lpage>166</lpage>
          . Springer, Berlin/New York. (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Sharoff</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wu</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Markert</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <article-title>The Web library of Babel: evaluating genre collections</article-title>
          .
          <source>In Proc. of the Seventh Language Resources and Evaluation Conference</source>
          ,
          <string-name>
            <surname>LREC</surname>
          </string-name>
          <year>2010</year>
          ,
          <article-title>Malta</article-title>
          . (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>Richard</given-names>
            <surname>Forsyth</surname>
          </string-name>
          and
          <string-name>
            <given-names>Serge</given-names>
            <surname>Sharoff</surname>
          </string-name>
          .
          <article-title>Document Dissimilarity within and across Languages: a Benchmarking Study</article-title>
          .
          <source>Literary and Linguistic Computing</source>
          ,
          <volume>29</volume>
          :
          <fpage>6</fpage>
          -
          <lpage>22</lpage>
          . (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Mann</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Matthiessen</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Thompson</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Rhetorical Structure Theory and Text Analysis. Discourse Description: Diverse linguistic analyses of a fund-raising text / ed</article-title>
          . by W. C. Mann and
          <string-name>
            <given-names>S. A.</given-names>
            <surname>Thompson</surname>
          </string-name>
          . - Amsterdam. -P.
          <fpage>39</fpage>
          -
          <lpage>78</lpage>
          (
          <year>1992</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Egg</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Redeker</surname>
          </string-name>
          , G.:
          <article-title>Underspecified discourse representation</article-title>
          .
          <source>In: Anton Benz &amp; Peter Kühnlein (eds)</source>
          , Constraints in Discourse (pp.
          <fpage>117</fpage>
          -
          <lpage>138</lpage>
          ), Amsterdam: Benjamins. (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Taboada</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>The Genre Structure of Bulletin Board Messages</article-title>
          .
          <source>Text Technology</source>
          <volume>13</volume>
          (
          <issue>2</issue>
          ):
          <fpage>55</fpage>
          -
          <lpage>82</lpage>
          . (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Biber</surname>
            , Douglas,
            <given-names>Jerry</given-names>
          </string-name>
          <string-name>
            <surname>Kurjian</surname>
          </string-name>
          .
          <article-title>Towards a taxonomy of web registers and text types: a multidimensional analysis</article-title>
          .
          <source>" Language and Computers 59.1</source>
          (
          <year>2006</year>
          ):
          <fpage>109</fpage>
          -
          <lpage>131</lpage>
          . (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Freund</surname>
          </string-name>
          , Luanne, Charles LA Clarke, Elaine G. Toms.
          <article-title>Towards genre classification for IR in the workplace</article-title>
          .
          <source>Proceedings of the 1st international conference on Information interaction in context. ACM</source>
          (
          <year>2006</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Kessler</surname>
            , Brett, Geoffrey Numberg,
            <given-names>Hinrich</given-names>
          </string-name>
          <string-name>
            <surname>Schütze</surname>
          </string-name>
          .
          <article-title>Automatic detection of text genre." Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics</article-title>
          .
          <article-title>Association for Computational Linguistics (</article-title>
          <year>1997</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Santini</surname>
            ,
            <given-names>Marina.</given-names>
          </string-name>
          <article-title>Automatic identification of genre in web pages</article-title>
          .
          <source>Diss</source>
          . University of Brighton (
          <year>2007</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Sarawgi</surname>
            , Ruchita, Kailash Gajulapalli,
            <given-names>Yejin</given-names>
          </string-name>
          <string-name>
            <surname>Choi</surname>
          </string-name>
          .
          <article-title>Gender attribution: tracing stylometric evidence beyond topic and genre</article-title>
          .
          <source>Proceedings of the Fifteenth Conference on Computational Natural Language Learning. Association for Computational Linguistics</source>
          (
          <year>2011</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Stamatatos</surname>
            , Efstathios, Nikos Fakotakis,
            <given-names>George</given-names>
          </string-name>
          <string-name>
            <surname>Kokkinakis</surname>
          </string-name>
          .
          <article-title>Text genre detection using common word frequencies</article-title>
          .
          <source>" Proceedings of the 18th conference on Computational linguistics-Volume 2. Association for Computational Linguistics</source>
          (
          <year>2000</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Wu</surname>
            , Zhili,
            <given-names>Katja</given-names>
          </string-name>
          <string-name>
            <surname>Markert</surname>
            , and
            <given-names>Serge</given-names>
          </string-name>
          <string-name>
            <surname>Sharoff</surname>
          </string-name>
          .
          <article-title>Fine-grained genre classification using structural learning algorithms</article-title>
          .
          <source>Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics. Association for Computational Linguistics</source>
          (
          <year>2010</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Joty</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Carenini</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ng</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mehdad</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          :
          <article-title>Combining Intra- and Multi-sentential Rhetorical Parsing for Document-level Discourse Analysis</article-title>
          .
          <source>In Proceedings of the 51st Annual Meeting of the Association for Computational Linguistics (ACL</source>
          <year>2013</year>
          ), Sofia, Bulgaria (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Galitsky</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ilvovsky</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kuznetsov</surname>
            ,
            <given-names>S. O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Strok</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>Matching sets of parse trees for answering multi-sentence questions // Proceedings of the Recent Advances in Natural Language Processing</article-title>
          ,
          <string-name>
            <surname>RANLP</surname>
          </string-name>
          <year>2013</year>
          .
          <article-title>- INCOMA Ltd</article-title>
          .,
          <string-name>
            <surname>Shoumen</surname>
          </string-name>
          , Bulgaria.- P.
          <fpage>285</fpage>
          -
          <lpage>294</lpage>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Ilvovsky</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Going beyond sentences when applying tree kernels</article-title>
          .
          <source>Proceedings of the Student Research Workshop</source>
          .‒ ACL
          <year>2014</year>
          .
          <article-title>‒</article-title>
          P.
          <fpage>56</fpage>
          -
          <lpage>63</lpage>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Galitsky</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kuznetsov</surname>
            ,
            <given-names>S.O.</given-names>
          </string-name>
          :
          <article-title>Learning communicative actions of conflicting human agents</article-title>
          .
          <source>J. Exp. Theor. Artif. Intell</source>
          . -Vol.
          <volume>20</volume>
          (
          <issue>4</issue>
          ). - P.
          <fpage>277</fpage>
          -
          <lpage>317</lpage>
          (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Vapnik</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          :
          <article-title>The Nature of Statistical Learning Theory</article-title>
          . - Springer-Verlag (
          <year>1995</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Marcu</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>From Discourse Structures to Text Summaries</article-title>
          .
          <source>Proceedings of ACL Workshop on Intelligent Scalable</source>
          Text Summarization / eds. I. Mani and
          <string-name>
            <given-names>M.</given-names>
            <surname>Maybury</surname>
          </string-name>
          . - Madrid, P.
          <fpage>82</fpage>
          -
          <lpage>88</lpage>
          (
          <year>1997</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Severyn</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Moschitti</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Fast Support Vector Machines for Convolution Tree Kernels</article-title>
          .
          <source>Data Mining Knowledge Discovery</source>
          <volume>25</volume>
          .‒
          <fpage>2012</fpage>
          .‒ P.
          <fpage>325</fpage>
          -
          <lpage>357</lpage>
          . (
          <year>1997</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <string-name>
            <surname>Marta</surname>
            <given-names>Recasens</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Marie-Catherine de Marneffe</surname>
            , and
            <given-names>Christopher</given-names>
          </string-name>
          <string-name>
            <surname>Potts</surname>
          </string-name>
          .
          <article-title>The Life and Death of Discourse Entities: Identifying Singleton Mentions</article-title>
          .
          <source>In Proceedings of NAACL</source>
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23.
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chang</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Peirsman</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chambers</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Surdeanu</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jurafsky</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Deterministic coreference resolution based on entity-centric, precision-ranked rules</article-title>
          .
          <source>Computational Linguistics</source>
          <volume>39</volume>
          (
          <issue>4</issue>
          ),
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          24. Collins,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Duffy</surname>
          </string-name>
          , N.:
          <article-title>Convolution kernels for natural language</article-title>
          .
          <source>In Proceedings of NIPS</source>
          ,
          <fpage>625</fpage>
          -
          <lpage>632</lpage>
          (
          <year>2002</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          25.
          <string-name>
            <surname>Moschitti</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Efficient Convolution Kernels for Dependency and Constituent Syntactic Trees</article-title>
          .
          <source>In Proceedings of the 17th European Conference on Machine Learning</source>
          , Berlin, Germany (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          26.
          <string-name>
            <surname>Sharoff</surname>
          </string-name>
          , Serge.
          <article-title>"Functional Text Dimensions for annotation of Web corpora</article-title>
          . http://corpus.leeds.ac.uk/serge/publications/2015-corpora-submission.
          <source>pdf</source>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          27.
          <string-name>
            <surname>Cumby</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Roth D</surname>
          </string-name>
          .
          <article-title>On Kernel Methods for Relational Learning</article-title>
          . ICML, pp.
          <fpage>107</fpage>
          -
          <lpage>14</lpage>
          . (
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          28.
          <string-name>
            <surname>Galitsky</surname>
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ilvovsky</surname>
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kuznetsov</surname>
            <given-names>S. O.</given-names>
          </string-name>
          <string-name>
            <surname>Text</surname>
          </string-name>
          <article-title>Classification into Abstract Classes Based on Discourse Structure</article-title>
          ,
          <source>in: Proceedings of the Recent Advances in Natural Language Processing</source>
          ,
          <string-name>
            <surname>RANLP</surname>
          </string-name>
          <year>2015</year>
          . Hissar. P.
          <volume>201</volume>
          -
          <fpage>207</fpage>
          . (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          29.
          <string-name>
            <surname>Kanaris</surname>
          </string-name>
          , I. and E. Stamatatos Learning to Recognize
          <source>Webpage Genres Information Processing and Management</source>
          ,
          <volume>45</volume>
          (
          <issue>5</issue>
          ), pp.
          <fpage>499</fpage>
          -
          <lpage>512</lpage>
          ,
          <string-name>
            <surname>Elsevier</surname>
          </string-name>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>