<!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>Evaluating noise reduction strategies for terminology extraction</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Johannes Scha¨ fer</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ina R o¨siger</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ulrich Heid</string-name>
          <email>heid@uni-hildesheim.de</email>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Michael Dorna</string-name>
          <email>michael.dorna@de.bosch.com</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Institute for Natural Language Processing, University of Stuttgart</institution>
          ,
          <country country="DE">Germany</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Robert Bosch GmbH</institution>
          ,
          <country country="DE">Germany</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>University of Hildesheim</institution>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2015</year>
      </pub-date>
      <fpage>123</fpage>
      <lpage>132</lpage>
      <abstract>
        <p>We present work on the task of reducing noise in nominal terminology extraction. Based on a comparative evaluation of statistical measures aimed at capturing domain specificity, we propose strategies to increase the typically quite low accuracy of classical hybrid nominal multi-word term extraction. Our experiments on a set of German do-it-yourself instruction texts show that using linguistic filters that determine the right span of the MWE before applying a suitable combination of statistical measures improves results.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>The automatic extraction of terminology from
domain-specific text is a task that has gained
interest in the research community over the last twenty
years. It is an important prerequisite for
applications such as ontology creation or knowledge
extraction from texts.</p>
      <p>The work presented here is part of a project
that deals with knowledge extraction and
ontology creation from German texts from the
do-ityourself domain. As a first step, we aim at high
quality terminology extraction of nominal
candidates, as these describe the objects of the domain,
followed by the extraction of verbal items and
verb+complement patterns before we bring them
together to build up partial ontologies of the
domain. This paper describes strategies to reduce
noise in nominal term extraction.</p>
      <p>We consider single-word terms and multi-word
terms, but focus on the latter because the
extraction of multi-word terms (MWTs) is more
difficult. As they are of variable length it is in many
cases nontrivial to ensure the correct span of the
term. We aim at extracting noun phrases (NPs)
of different levels of complexity, such as adjective
and noun combinations as well as NPs containing
a genitive or prepositional modifier.</p>
      <p>Nominal terms may contain embedded
prepositional phrases (PPs), such as in example (1).
(1) Bohrer mit Diamantspitze1</p>
      <p>(drill with diamond bit)</p>
      <p>However, we do not want to extract PPs that are
not syntactically attached to a term, e.g. because
they are verb-dependent, such as in example (2).
(2) die *Oberfl a¨che mit Lein o¨lfirnis bedecken
(cover the *surface with linseed oil varnish)
Thus, one of the noise reduction steps is to
ensure that the extracted nominal candidates are
syntactically valid, and do not cover too long spans.</p>
      <p>
        There are also cases where the term extraction
may return too short candidates. Sometimes, the
extracted terms only occur as part of bigger terms,
and are not valid on their own, such as in
example (3).
(3) elektromagnetisch *angetriebene Spritzpistole
(electromagnetically *operated spray gun)
There are both statistical and hybrid approaches
to term extraction
        <xref ref-type="bibr" rid="ref12 ref6">(Cabre and Vivaldi Palatresi,
2013)</xref>
        . Association measures (cf. e.g. Evert
(2005)) are designed to extract collocations
(“unithood”, cf. Kageura and Umino (1996)) and have
been used for terminology extraction, e.g. by
Couturier et al. (2006). However, Roche et al.
      </p>
      <p>1Extracted term candidates are underlined. The * here
denotes wrongly extracted MWT candidates.
(2004) investigated the use of association
measures for this task and came to the conclusion
that these standard measures are outperformed by
more sophisticated approaches. They do not
focus on domain-specificity (“termhood”) and thus
do not perform better at terminology extraction
than mere frequency based approaches (Pazienza
et al. (2005), confirmed by our own experiments,
where the maximal F1-score obtained with
association measures is 0.45).</p>
      <p>Termhood is addressed through statistical
measures that only use the candidate’s frequency in a
domain-specific corpus (e.g. Frantzi et al. (2000)),
as well as by measures based on a comparison of a
candidate’s frequency in a domain and in
generallanguage corpora (cf. Ahmad et al. (1992) and
section 2.3). However, among others due to data
sparseness in small size specialized corpora, both
approaches perform much better on single-word
terms (SWTs) than on MWTs.</p>
      <p>Most hybrid systems (linguistic pattern-based
search for candidates plus statistical ranking)
often do not address variable length and syntactic
validity satisfactorily (with a few noteworthy
exceptions, cf. for example Chen et al. (2008)):
part-of-speech (POS) sequence patterns are
typically flat and cannot identify phrase boundaries
and grammatical functions (cf. example (2)). As
the POS patterns do not model phrase structure,
they may cut off essential parts from a multi-word,
returning unattested candidates (cf. example (3)).</p>
      <p>We address the above issues by means of a
three-step approach which modifies and extends
the classical hybrid scenario: (i) nominal
candidates are selected via part-of-speech patterns; (ii)
they are filtered wrt syntactic validity and
embedding and finally (iii) ranked according to statistical
measures that involve a comparison between
specialized and general-language corpus. The system
with which we experiment extracts lemma
combinations, morphosyntactic properties and
textspecific metadata. Our method is evaluated on a
2.7 million word corpus of German do-it-yourself
(DIY) instruction texts against a gold standard.</p>
      <p>The main contributions of this paper are a study
on the suitability of standard statistical measures
for the extraction of nominal single- and
multiword terms, as a basis for further adaptations and
methods to improve the noise-silence ratio, based
on experiments with linguistic filters (we use
parsing information to ensure the MWE is a valid
nominal phrase (NP)), and experiments on the
combination of statistical measures. We believe that
the methods we propose are generalizable to other
domains of specialization and to other languages.
More experiments will however be needed to
confirm this.</p>
    </sec>
    <sec id="sec-2">
      <title>2 Improving term extraction quality</title>
      <p>In the present work, we only deal with
nominal candidates. To maximize recall on
(comparatively) small specialized corpora, we use POS
patterns that account for basic terms2 (N, Adj N, N P
N, N D Ngenitive) and for their potential variants
(step (i) in the summary above). The set of
patterns is described by the regular expressions given
below.
– (Adv? Adj? Adj)? N
– (N D)? (Adv? Adj)? N P D? (Adv? Adj)? N
– (Adv? Adj)? N D (Adv? Adj)? Ngenitive</p>
      <p>
        These patterns are flat and thus do not
adequately represent syntactic structure. In particular,
they cannot distinguish between cases (a) where
NP and PP are sister nodes vs. (b) where the PP
is embedded in the NP (cf. examples (1) and (2)
above). Thus, step (ii) is added to remove noise:
we exclude items from our candidate set which are
syntactically invalid (too long ones) by checking
phrase boundaries and we use the C-value score
        <xref ref-type="bibr" rid="ref15">(Frantzi et al., 2000)</xref>
        to remove too short items,
i.e. those occurring only embedded in other
candidates. In step (iii) we combine statistical
measures to rank the selected candidates by domain
specificity.
2.1
      </p>
      <sec id="sec-2-1">
        <title>Ensuring syntactic validity</title>
        <p>Candidates covering too long spans typically
occur when part of the extracted MWT is actually
attached to the verbal phrase, e.g. in example (4)
and example (5).
(4) die *Schablone mit Farbe bespru¨hen
(spray the *template with paint)
(5) ein *Loch in die Wand bohren
(drill a *hole into the wall)
2POS tags: N-noun, Adj-adjective, P-preposition,
Adv-adverb, D-determiner.</p>
        <p>
          We filter these by using the dependency parser
mate
          <xref ref-type="bibr" rid="ref4">(Bohnet, 2010)</xref>
          to find start and end points of
NPs.3 This parser was chosen because, in the long
run, we aim at relation extraction based on
syntactic functions. Moreover, mate has been shown to
produce the highest accuracy in a recent
evaluation of the currently available dependency parsers
          <xref ref-type="bibr" rid="ref9">(Choi et al., 2015)</xref>
          . We are aware that mate has not
been optimized to solve the PP attachment
problem and that there is no evaluation on specialized
text available yet (cf., however, Zollmann et al.
(2016) on a partial evaluation).
        </p>
        <p>The boundary violation filter works as follows:
If an instance of a MWT candidate comprises two
sister phrases, i.e. if the POS sequence identified
goes beyond the end point of an NP, it is not
counted as a valid occurrence of the respective
lemma sequence. As an example for a violation,
consider the following MWT candidate where
‘ein Loch’ and ‘in die Wand’ are sister phrases
(‘ein Loch in die Wand bohren’ (drill a hole
into the wall), (5)), whereas in the example (6)
(‘Bohrer mit Diamandspitze benutzen’ (use a drill
with diamond bit)) there is no violation.</p>
        <p>(5)
(6)</p>
        <p>NP
ein Loch</p>
        <p>VP
PP</p>
        <p>VP
in die Wand
2.2</p>
      </sec>
      <sec id="sec-2-2">
        <title>Filtering out invalid embedded phrases</title>
        <p>An example to show the necessity for an accurate
treatment of nested terms was found in our
extraction result: ‘zuga¨ngliche Stelle’ (accessible place)
and ‘schlecht zuga¨ngliche Stelle’ (poorly
accessible place). It should be obvious that from
occurrences of the latter term we do not want to extract
the former.</p>
        <p>
          Thus, with nested MWEs, not all fragments of
a longer expression might be suitable candidate
terms. C-value
          <xref ref-type="bibr" rid="ref14 ref18">(Frantzi and Ananiadou, 1996)</xref>
          identifies embedded sequences as valid units
under the following condiditons: (a) the embedded
sequence also occurs on its own; (b) the
embedded sequence occurs in lexically diverse longer
sequences. The C-value for a candidate term a is
defined as in formula 1.
        </p>
        <p>C(a) =
(log2 |a| ⇤ f (a)
log2 |a| ⇤ f (a)
if a not nested
PbP2T(Taaf)(b) otherwise
(1)
|a| = term length of a (number of words)
f(.) = frequency in the domain corpus
Ta = set of longer candidate terms that contain a</p>
        <p>P (Ta) = number of these longer candidate terms</p>
        <p>Furthermore, C-value reflects the idea that
longer sequences have a tendency to be more
(domain-) specific than shorter ones.</p>
        <p>
          Based on this, we consider German noun
compounds as pseudo-MWEs and compute the term
length |a| from formula 1 by using the result of
compound splitting as produced by the compound
splitting tool COMPOST
          <xref ref-type="bibr" rid="ref7">(Cap, 2014)</xref>
          (cf.
formula 2).
        </p>
        <p>termlength(a) = X(1 + log(cslen(w))) (2)
w2 a
w = a word
cslen(w) = number of compound elements in w</p>
        <p>Frantzi and Ananiadou (1996) propose C-value
as a termhood measure using only the frequencies
in the domain corpus; thus, most general-language
noise cannot be filtered out. We therefore
suggest to use C-value as a corrected frequency and
to combine it with further statistical measures.
2.3</p>
      </sec>
      <sec id="sec-2-3">
        <title>Ranking by domain-specificity</title>
        <p>In section 4, we will compare the following
statistical measures designed to rank candidate terms
by domain-specificity. A detailed description of
these measures is given in Scha¨fer (2015). As
these measures place general-language candidates
V
bohren</p>
        <p>V
benutzen</p>
        <p>N
Bohrer</p>
        <p>NP</p>
        <p>PP
mit Diamantspitze</p>
        <p>The candidate sequence is not removed from
the list of possible candidate terms, as other
occurrences might not have been analyzed as
violating syntactic boundaries. The filter is thus a “soft”
one as it only affects the frequency of the lexeme
combination candidate. We also experiment using
a “hard” filter, where the lexeme combination
candidate is removed altogether.</p>
        <p>
          3In the current experiments only for subject and object
phrases.
at the bottom of the list, a selection of top
candidates shows a reduced amount of noise. The
measures are defined as follows using the domain
frequencies f , the general-language frequencies F as
well as the sizes of the corpora: s for the domain
corpus and S for the general-language corpus.
• Weirdness ratio for domain specificity (DS)
          <xref ref-type="bibr" rid="ref2">(Ahmad et al., 1999)</xref>
          : Identifies
domainspecific terms by the ratio of the relative
frequencies in the domain and in general
language as in formula 3.
        </p>
        <p>
          f /s
Weirdness = F /S
(3)
• Corpora-comparing log-likelihood (LL)
          <xref ref-type="bibr" rid="ref15 ref22">(Rayson and Garside, 2000)</xref>
          : Identifies
units with significant frequency differences
between the two corpora by formula 44.
Note that this version of LL differs from the
standard log-likelihood collocation measure.
        </p>
        <p>✓
LL = 2 f ⇤ log
✓ f ◆</p>
        <p>Ef
+ F ⇤ log
✓ F ◆◆</p>
        <p>EF
(4)
With Ef = s⇤ (f+F ) and EF = S⇤ (F +f) .</p>
        <p>
          s+S S+s
• Contrastive Selection via Heads (CSvH)
          <xref ref-type="bibr" rid="ref3">(Basili et al., 2001)</xref>
          : Computes the
domainspecificity of a multi-word candidate (ct)
using a contrastive filter based on the
generallanguage frequency of its head (h(ct)) by
formula 5.
        </p>
        <p>cwct = log(fh(ct)) ⇤ log(
) ⇤ fct (5)</p>
        <p>
          S
Fh(ct)
• Term Frequency Inverse Term Frequency
(TFITF)
          <xref ref-type="bibr" rid="ref5">(Bonin et al., 2010)</xref>
          : Combines the
term frequency in the domain corpus with
the inverse term frequency in the
generallanguage corpus as in formula 6.
        </p>
        <p>wt = log(f (t)) ⇤ log
(6)</p>
        <p>
          S
F (t)
4As the LL formula is obviously symmetric in the two
corpora, we multiplied the result for candidates by 1 if their
relative frequency in the domain is smaller than the one in
general language, in order to place candidates with a
significantly high general-language frequency at the bottom of the
list.
• Contrastive Selection of multi-word terms
(CSmw)
          <xref ref-type="bibr" rid="ref5">(Bonin et al., 2010)</xref>
          : Applies a
contrastive filter using the general-language
frequency including an arctan scaling to reduce
variation in low-frequency candidates as in
formula 7.
f (t)
CSmw(t) = arctan(log(f (t)) ⇤ F (t)/S )
(7)
3
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Evaluation setup</title>
      <p>
        Tool. We used the TTC5 (Terminology extraction,
translation tools and comparable corpora
(20102012)) term extraction research prototype
        <xref ref-type="bibr" rid="ref17 ref20">(Gojun
et al., 2012)</xref>
        , a standard hybrid tool that
combines linguistic preprocessing with statistical
measures, which has recently proven to outperform
SDL MultiTerm6, a purely statistical commercial
state-of-the-art tool
        <xref ref-type="bibr" rid="ref16">(George, 2014)</xref>
        .
      </p>
      <p>The pipeline involves the following
components:
corpus
pre−
processing
pattern
search
ranking</p>
      <p>term
candidate
list
• Pattern-based term candidate extraction:
use of simple as well as extended POS-based
patterns to identify term candidates;for the
patterns used see section 2.
5TTC-project: http://www.ttc-project.eu/
6http://www.sdl.com/de/cxc/language/
terminology-management/multiterm/
# tokens
62,131
6,868
5,150
15,104
35,302
2,160,008
444,381
text
do-it-yourself handbook
encyclopedia entries
list of FAQs with answers
tips and tricks for do-it-yourselfers
marketing texts
user generated project descriptions
user generated wiki content</p>
      <sec id="sec-3-1">
        <title>2,728,944 total DIY corpus</title>
        <p>• Ranking:
sorting of the candidate lists produced by the
preceding step, according to different
measures (cf. section 2.3).</p>
        <p>Domain corpus. We use a corpus of expert
and user-generated German texts from the
DIYdomain, consisting a.o. of manuals, practical tips,
marketing texts and project descriptions (cf.
table 1). This corpus is highly heterogeneous since
the domain texts were acquired by various
methods resulting in fundamentally different types of
texts. The texts also differ with regard to the level
of expertise of the author and the intended reader.
Some texts are written by a domain expert as
instructions for users and some are user-generated
context.</p>
        <p>As the texts differ wrt authorship and text style,
several statistical measures are implemented in
order to identify different properties of terms
providing multiple lists of term candidates. A domain
expert can then select the most relevant lists for
the construction of a terminological representation
of the domain language. For the experiments
presented in this work we treated the corpus as a
single unit. A source identifier was included as meta
data annotation. In future work on a larger
version of the corpus, subsets by text type and
author/intended reader may be analyzed separately.</p>
        <sec id="sec-3-1-1">
          <title>General-language corpus. We use the</title>
          <p>
            SdeWaC corpus
            <xref ref-type="bibr" rid="ref12 ref6">(Faaß and Eckart, 2013)</xref>
            as a
general-language corpus. It consists of 880
million tokens. This corpus was chosen since its
sentences are a broad collection of German web texts
supposed to provide a statistically representative
distribution of words in general language. 7
          </p>
        </sec>
      </sec>
      <sec id="sec-3-2">
        <title>POS pattern number example</title>
        <p>N 4,238 Kreissa¨ge</p>
        <p>(circular saw)
Adj N 604 thermische Zersetzung
(thermal decomposition)
N P N 148 Bohren von Du¨bello¨chern
(drilling of dowel holes)
N D Ngen 107 Viskosita¨t der Farbe
(viscosity of the paint)</p>
        <p>
          Gold standard. A gold standard (GS) has been
developed for the basic POS patterns (cf. section
2) which we take to capture the core terminology
of the domain. Lemma sequences with a minimum
frequency of four were extracted from the domain
corpus matching these patterns. The gold standard
contains those terms which were marked as terms
by at least two out of three independent annotators
carefully following defined guidelines
          <xref ref-type="bibr" rid="ref16">(George,
2014)</xref>
          . This process of creating a gold standard
is based on the concept of monolingual reference
lists (cf. Loginova et al. (2012)). Our gold
standard contains 4,238 SWTs (nouns including
compounds) and 826 MWTs (cf. table 2). This
distribution is due to the fact that we derived the gold
standard from the available text data and not e.g.
from a test suite. Moreover, the frequency cut-off
of four removed many MWT from being
considered for the gold standard. As German compounds
“count” as SWT, the MWT number is
comparatively low. Our statistical methods are however
also applied to compounds (cf. section 2.3). The
inter-annotator agreement8 ranges between
moderate and substantial agreement, depending on the
pattern. For multi-words, the kappa is 0.59
(moderate agreement) which is satisfactory considering
the imbalanced distribution of categories.
        </p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Evaluation of noise reduction steps</title>
      <sec id="sec-4-1">
        <title>Comparative evaluation of statistical measures</title>
        <p>We compare the suitability of the measures
mentioned in section 2.3, as a basis for further
adjustments. The measures DS and CSmw seem to be
the most suited overall (cf. figure 2), while TFITF
7An alternative source would be Wikipedia, as it covers a
broad variety of specialized topics.</p>
        <sec id="sec-4-1-1">
          <title>8We compute Fleiss’ kappa (Fleiss, 1971).</title>
          <p>
            Interpretation according to
            <xref ref-type="bibr" rid="ref19">(Landis and Koch, 1977)</xref>
            .
term
Drehmomentvorwahl (torque pre-selection)
Bohrer (drill)
Mutter (screw nut/mother)
freq f-rank
          </p>
          <p>33 2,344
1,094 44
510 133</p>
        </sec>
        <sec id="sec-4-1-2">
          <title>DS-rank 65 158,094 216,341</title>
          <p>0.5 1 1.5 2 2.5
top-n candidates (normalized by the length of the GS)
produces superior results only for very short
candidate term lists. CSmw achieves a maximum
F1-score of 0.59 (48% precision and 77% recall)
which is an improvement of 20 % over the
simple frequency baseline. For very short lists TFITF
achieves a precision of above 80%, for example
84% in the top 150 extracted candidates where
other measures barely reach 70%. In the
following we analyze these observations in detail and
illustrate the reasons with examples from the
extraction result as presented in table 3. This
table shows in columns from left to right: extracted
terms, their frequency in the domain corpus and
their rank in the result lists according to the
measures frequency, DS, TFITF and CSmw.</p>
          <p>Sorting the candidates by their DS-value shows
a high density of highly domain-specific terms
at the top. For example, ‘Drehmomentvorwahl’
(torque pre-selection) on rank 65 (out of 226,715
candidates). DS seems to strongly focus on very
specialized terms of the domain texts which do not
occur in general language, or only with very low
frequency. However, as a consequence it misses
important domain terms which also occur with a
moderate frequency in general language. For
example the term ‘Bohrer’ (drill) which is essential
for the domain (domain corpus frequency: 1,094)
is only on DS-rank 158,094. This shows that the
DS-value approach is not suitable to provide a list
of important terms in the domain, but rather to
identify its very specialized terms.</p>
          <p>The TFITF-measure determines termhood by
including the domain corpus frequency of a
candidate term logarithmically (cf. formula in
section 2.3) - unlike the DS-measure which uses
it relatively. As a result several top candidate
terms of the TFITF list are of a different kind
than the best DS terms. For example, the
abovementioned term ‘Bohrer’ (drill) is now at rank 40.
3 TFITF even puts the candidate ‘Mutter’ (screw
nut/mother) which, due to its homography, is hard
for a terminology extractor to identify as a term,
at rank 2,276; this is acceptable, considering that
there are 5,097 terms listed in the gold standard.
The measure puts a stronger emphasis on the
domain corpus frequency producing a considerable
amount of noise in form of general-language
candidates, which explains its rather mediocre
overall performance. We thus suggest to use TFITF
to extract a relatively small set of terms with a
very high precision, for example for bootstrapping
approaches or for an ontology learning which not
only focuses on special technical terms of the
domain but rather on its key topics.</p>
          <p>The results acquired by the measure CSmw are
in between TFITF and DS. It also gives more
emphasis to the domain corpus frequency of a
candidate term than DS, however not as much as TFITF.
In the statistical analysis this approach reached the
best overall F-scores. The CSmw-measure
identifies the same top terms as the DS-measure, namely
those which are highly domain specific and rare in
general language, for example:
‘Drehmomentvorwahl’ (torque pre-selection) on rank 67.
Furthermore, it ranks comparatively high the essential
objects of the domain which are also used in general
language, for example: ‘Bohrer’ (drill) is on rank
2,554. Consequently, the measure also produces
some noise (as TFITF does) which is why it does
not outperform the DS-measure. The ranking by
CSmw turns out to be the most recommendable for
a general terminology extraction which focuses on
0.6
Frequency
DS
CSvH
CSmw</p>
          <p>C-value
LL
TFITF
CSmw+C
0.5 1 1.5 2 2.5
top-n candidates (normalized by the length of the GS)
technical terms as well as on essential objects of
the domain.</p>
          <p>While LL outperforms the frequency baseline,
for our domain it has proven to be one of the
weaker measures and we could not identify any
further useful characteristics.</p>
          <p>The unsatisfactory result of the ranking by
CSvH is based on its strong emphasis on MWTs
which have a head with a very high domain
corpus frequency. Thus, the result lists show many
general-language candidates at their top which is
why the measure underperforms the baseline.</p>
          <p>The above results were obtained from an
evaluation of a mixed set of SWTs and MWTs. A
separate analysis of the MWT extraction (cf.
figure 3) shows that the two best-performing
measures (DS and CSmw) achieve an F1-score of only
about 0.49 (recall 64%, precision 40%). In
comparison, the maximum F1-score for the extraction
of single-word terms was about 0.65. The low
performance of the MWT extraction is due to the fact
that this task also includes the determination of
the right length of the MWT and therefore leads
to more noise (in total approximately 80% noise
in the MWT candidates selected by the basic POS
patterns). Thus, a further filtering of the
multiword candidates is necessary.
4.2</p>
        </sec>
      </sec>
      <sec id="sec-4-2">
        <title>Effect of C-value</title>
        <p>Out of the 226,715 items that follow our extended
patterns (frequency 1), C-value successfully
removes 58,491 cases of noise that only occur
embedded (25.8%). In our GS-based evaluation,
Cvalue outperforms mere frequency, as shown in
figure 2 in the extraction of the basic term patterns.
candidate term
Band
Klebeband
doppelseitiges Klebeband</p>
        <p>The positive effect of C-value is illustrated with
a few examples in table 4. The frequency of
occurrence in the domain corpus of the first
can3 didate term ‘Band’ (tape) is relatively similar to
the one of the second candidate ‘Klebeband’
(adhesive tape). They are both single-word nouns
and thus would be considered almost equally as
terms for the domain. After applying the C-value
approach however their termhood values differ
clearly with ‘Klebeband’ having a value twice as
high as the value of ‘Band’. This mainly
follows from the term length computation based on
the number of components of compounds
(‘Klebeband’ is a compound with two components:
‘kleben’ (to glue) and ‘Band’). Furthermore, the
frequency of ‘doppelseitiges Klebeband’
(doublesided adhesive tape) is only approximately a third
of the frequency of the single noun ‘Klebeband’.
The C-value method here also rewards the length
of the multi-word and computes a value that is half
of the C-value of the single noun despite the much
lower absolute frequency of ‘doppelseitiges
Klebeband’. Note that the termhood value of
‘doppelseitiges Klebeband’ is also greater than the value
for ‘Band’ even though it has a lower frequency.
This shows that the fine-grained measurement of
the length characteristic of candidate terms
including a special treatment for compounds is beneficial
for terminology extraction.</p>
        <p>However, it has to be noted that the ranking of
candidate terms by C-value alone is not sufficient
for term extraction, as extracted top lists with a
recall of greater than 50% still contain a
considerable amount of noise (at least 78%), mostly in the
form of general-language candidates.</p>
        <p>We found that CSmw, one of the
bestperforming measures in the comparative
evaluation, improves when domain-specificity is
computed on C-value instead of frequency
(CSmw+Cplot in Figure 3, maximum F1-score 0.51). This
is due to C-value’s sensitivity for nested terms
which is combined with the domain-specificity
filter from CSmw.
0.2 0
ignore PBs
‘soft’ PB filter
‘hard’ PB filter
0.5 1 1.5 2
top-n candidates (normalized by length of GS)
2.5
As the syntactic filter only affects POS sequences
with prepositions whose proportion in the GS is
rather small, the effect of phrase boundaries (PBs)
cannot be shown in Figure 3 and was thus tested
in two other settings. First, we evaluated against
the 107 N P N terms in the gold standard. Figure 4
shows the effects of applying the “soft” filter
(frequency adjustments, section 2.1) and the “hard”
filter (candidate removed altogether) on the
F1score. Both filters clearly improve the standard
extraction based on CSmw. However, the filter
affects more than just the terms in the GS (17,4%
of all NP+PP candidate occurrences affected) and
we would like to observe the effects on all variants
of prepositional patterns. Thus, in a
precisionbased evaluation, we ranked the MWT candidates
by the number of times they violated the
syntactic filter and manually checked, for the top 500
removal candidates, whether the removal was
justified. The result, as shown in Table 5, indicates
that the quality of the parser output is sufficient to
predict syntactic validity: the overall precision for
these top 500 candidates was 83%.</p>
        <p>Top n
Precision
Top n
Precision</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Conclusion and future work</title>
      <p>We presented three steps to remove noise and to
increase performance in nominal terminology
extraction. We also suggested a combination of
statistical measures that is particulary suitable for this
task: Our best setting has proven to be a
combination of C-value and CSmw, together with a
syntactic validity check. A qualitative analysis of
the extraction results showed that different
termhood measures emphasize different characteristics
of terms, as their top lists differ. Therefore, a
combination of statistical measures can also be
considered for further improvements, instead of only
focusing on one single best performing measure.
One could for example think of ways to combine
the top lists of a set of best-performing measures,
or try an approach that combines or ranks different
scores of certain measures in one formula. Future
work will also be based on English data where we
will evaluate further steps to improve term
extraction results, e.g. by combining the termhood
measures also with association measures and by
further improving the syntactic analysis through the
use of an additional constituency parser. A further
objective of this work will be to assess the
generality of the approach on different domains.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <string-name>
            <given-names>Khurshid</given-names>
            <surname>Ahmad</surname>
          </string-name>
          , Andrea Davies, Heather Fulford, and
          <string-name>
            <given-names>Margaret</given-names>
            <surname>Rogers</surname>
          </string-name>
          .
          <year>1992</year>
          .
          <article-title>What is a term? The semi-automatic extraction of terms from text. Translation Studies: An Interdiscipline: Selected papers from the Translation Studies Congress</article-title>
          , Vienna,
          <year>1994</year>
          , pages
          <fpage>267</fpage>
          -
          <lpage>278</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <string-name>
            <given-names>Khurshid</given-names>
            <surname>Ahmad</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Lee</given-names>
            <surname>Gillam</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Lena</given-names>
            <surname>Tostevin</surname>
          </string-name>
          .
          <year>1999</year>
          .
          <article-title>University of Surrey Participation in TREC8: Weirdness Indexing for Logical Document Extrapolation and Retrieval (WILDER)</article-title>
          .
          <source>In Text REtrieval Conference.</source>
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          <string-name>
            <given-names>Roberto</given-names>
            <surname>Basili</surname>
          </string-name>
          , Alessandro Moschitti, Maria Teresa Pazienza, and Fabio Massimo Zanzotto.
          <year>2001</year>
          .
          <article-title>A contrastive approach to term extraction</article-title>
          .
          <source>In Terminologie et intelligence artificielle. Rencontres</source>
          , pages
          <fpage>119</fpage>
          -
          <lpage>128</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          <string-name>
            <given-names>Bernd</given-names>
            <surname>Bohnet</surname>
          </string-name>
          .
          <year>2010</year>
          .
          <article-title>Very high accuracy and fast dependency parsing is not a contradiction</article-title>
          .
          <source>In Proceedings of the 23rd International Conference on Computational Linguistics (COLING</source>
          <year>2010</year>
          ), Beijing, China, pages
          <fpage>89</fpage>
          -
          <lpage>97</lpage>
          . Association for Computational Linguistics.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <string-name>
            <given-names>Francesca</given-names>
            <surname>Bonin</surname>
          </string-name>
          , Felice Dell'Orletta,
          <string-name>
            <given-names>Giulia</given-names>
            <surname>Venturi</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Simonetta</given-names>
            <surname>Montemagni</surname>
          </string-name>
          .
          <year>2010</year>
          .
          <article-title>A contrastive approach to multi-word term extraction from domain corpora</article-title>
          .
          <source>In Proceedings of the 7th International Conference on Language Resources and Evaluation</source>
          , Malta, pages
          <fpage>19</fpage>
          -
          <lpage>21</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <source>Maria Teresa Cabre and Jorge Vivaldi Palatresi</source>
          .
          <year>2013</year>
          .
          <article-title>Acquisition of terminological data from text: Approaches</article-title>
          . In Handbu¨cher zur Sprach- und
          <source>Kommunikationswissenschaft / Handbooks of Linguistics and Communication Science (HSK) 5/4</source>
          , pages
          <fpage>1486</fpage>
          -
          <lpage>1497</lpage>
          . DeGruyter Mouton.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          <string-name>
            <given-names>Fabienne</given-names>
            <surname>Cap</surname>
          </string-name>
          .
          <year>2014</year>
          .
          <article-title>Morphological processing of compounds for statistical machine translation</article-title>
          .
          <source>PhD thesis</source>
          ,
          <source>Institute for Natural Language Processing (IMS)</source>
          , University of Stuttgart, http://elib.uni-stuttgart.de/opus/ volltexte/2014/9768/.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          <string-name>
            <given-names>Chaomei</given-names>
            <surname>Chen</surname>
          </string-name>
          , Fidelia Ibekwe-SanJuan, Eric SanJuan, and
          <string-name>
            <given-names>Michael</given-names>
            <surname>Vogeley</surname>
          </string-name>
          .
          <year>2008</year>
          .
          <article-title>Identifying thematic variations in sdss research</article-title>
          .
          <source>In 6th International Conference on Language Resources and Evaluation Conference (LREC-08)</source>
          , pages
          <fpage>319</fpage>
          -
          <lpage>330</lpage>
          . Presses Universitaires de Lyon.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          <string-name>
            <surname>Jinho D. Choi</surname>
          </string-name>
          ,
          <string-name>
            <surname>Joel R. Tetreault</surname>
            , and
            <given-names>Amanda</given-names>
          </string-name>
          <string-name>
            <surname>Stent</surname>
          </string-name>
          .
          <year>2015</year>
          .
          <article-title>It depends: Dependency parser comparison using a web-based evaluation tool</article-title>
          .
          <source>In Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing of the Asian Federation of Natural Language Processing, ACL 2015, July 26-31</source>
          ,
          <year>2015</year>
          , Beijing, China, Volume
          <volume>1</volume>
          :
          <string-name>
            <given-names>Long</given-names>
            <surname>Papers</surname>
          </string-name>
          , pages
          <fpage>387</fpage>
          -
          <lpage>396</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          <string-name>
            <surname>Jean-Franc¸ois Couturier</surname>
            , Sylvain Neuvel, and
            <given-names>Patrick</given-names>
          </string-name>
          <string-name>
            <surname>Drouin</surname>
          </string-name>
          .
          <year>2006</year>
          .
          <article-title>Applying Lexical Constraints on Morpho-Syntactic Patterns for the Identification of Conceptual-Relational Content in Specialized Texts</article-title>
          .
          <source>Language Resources and Evaluation Conference (LREC-06)</source>
          , Genoa, Italy.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          <string-name>
            <given-names>Stefan</given-names>
            <surname>Evert</surname>
          </string-name>
          .
          <year>2005</year>
          . The Statistics of Word Cooccurrences:
          <article-title>Word Pairs and Collocations</article-title>
          .
          <source>PhD thesis</source>
          , Universita¨t Stuttgart, http://elib.uni-stuttgart.de/opus/ volltexte/2005/2371.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          <string-name>
            <given-names>Gertrud</given-names>
            <surname>Faaß</surname>
          </string-name>
          and
          <string-name>
            <given-names>Kerstin</given-names>
            <surname>Eckart</surname>
          </string-name>
          .
          <year>2013</year>
          .
          <article-title>SdeWaC - A Corpus of Parsable Sentences from the Web</article-title>
          . In Iryna Gurevych, Chris Biemann, and Torsten Zesch, editors,
          <source>Language processing and knowledge in the Web: 25th International Conference, GSCL</source>
          <year>2013</year>
          , Darmstadt, Germany, volume
          <volume>8105</volume>
          of Lecture Notes in Computer Science, pages
          <fpage>61</fpage>
          -
          <lpage>68</lpage>
          . Springer.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          <string-name>
            <given-names>Joseph L.</given-names>
            <surname>Fleiss</surname>
          </string-name>
          .
          <year>1971</year>
          .
          <article-title>Measuring nominal scale agreement among many raters</article-title>
          .
          <source>Psychological Bulletin</source>
          ,
          <volume>76</volume>
          (
          <issue>5</issue>
          ):
          <fpage>378</fpage>
          -
          <lpage>382</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          <string-name>
            <surname>Katerina</surname>
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Frantzi</surname>
            and
            <given-names>Sophia</given-names>
          </string-name>
          <string-name>
            <surname>Ananiadou</surname>
          </string-name>
          .
          <year>1996</year>
          .
          <article-title>Extracting nested collocations</article-title>
          .
          <source>In Proceedings of the 16th conference on Computational linguisticsVolume 1</source>
          , pages
          <fpage>41</fpage>
          -
          <lpage>46</lpage>
          . Association for Computational Linguistics.
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          <string-name>
            <surname>Katerina</surname>
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Frantzi</surname>
            , Sophia Ananiadou, and
            <given-names>Hideki</given-names>
          </string-name>
          <string-name>
            <surname>Mima</surname>
          </string-name>
          .
          <year>2000</year>
          .
          <article-title>Automatic recognition of multi-word terms: the c-value/nc-value method</article-title>
          .
          <source>International Journal on Digital Libraries</source>
          ,
          <volume>3</volume>
          (
          <issue>2</issue>
          ):
          <fpage>115</fpage>
          -
          <lpage>130</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          <string-name>
            <given-names>Tanja</given-names>
            <surname>George</surname>
          </string-name>
          .
          <year>2014</year>
          .
          <article-title>Comparing a commercial term extraction tool with a research prototype: an evaluation study on DIY instruction texts</article-title>
          .
          <source>Bachelor thesis</source>
          , ms.
          <source>Institute for Natural Language Processing (IMS)</source>
          , University of Stuttgart.
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          <string-name>
            <given-names>Anita</given-names>
            <surname>Gojun</surname>
          </string-name>
          , Ulrich Heid, Bernd Weißbach, Carola Loth, and
          <string-name>
            <given-names>Insa</given-names>
            <surname>Mingers</surname>
          </string-name>
          .
          <year>2012</year>
          .
          <article-title>Adapting and evaluating a generic term extraction tool</article-title>
          .
          <source>In Proceedings of the Eighth International Conference on Language Resources and Evaluation (LREC'12)</source>
          .
          <source>European Language Resources Association (ELRA).</source>
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          <string-name>
            <given-names>Kyo</given-names>
            <surname>Kageura</surname>
          </string-name>
          and
          <string-name>
            <given-names>Bin</given-names>
            <surname>Umino</surname>
          </string-name>
          .
          <year>1996</year>
          .
          <article-title>Methods of automatic term recognition: A review</article-title>
          .
          <source>Terminology</source>
          ,
          <volume>3</volume>
          (
          <issue>2</issue>
          ):
          <fpage>259</fpage>
          -
          <lpage>289</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          <string-name>
            <surname>J. Richard</surname>
            Landis and
            <given-names>Gary G.</given-names>
          </string-name>
          <string-name>
            <surname>Koch</surname>
          </string-name>
          .
          <year>1977</year>
          .
          <article-title>The measurement of observer agreement for categorical data</article-title>
          .
          <source>biometrics</source>
          , pages
          <fpage>159</fpage>
          -
          <lpage>174</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          <string-name>
            <given-names>Elizaveta</given-names>
            <surname>Loginova</surname>
          </string-name>
          , Anita Gojun, Helena Blancafort, Marie Gue´gan, Tatiana Gornostay, and
          <string-name>
            <given-names>Ulrich</given-names>
            <surname>Heid</surname>
          </string-name>
          .
          <year>2012</year>
          .
          <article-title>Reference lists for the evaluation of term extraction tools</article-title>
          .
          <source>In Proceedings of the Terminology and Knowledge Engineering Conference</source>
          (TKE'
          <year>2012</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          <string-name>
            <given-names>Maria</given-names>
            <surname>Teresa</surname>
          </string-name>
          <string-name>
            <surname>Pazienza</surname>
          </string-name>
          , Marco Pennacchiotti, and Fabio Massimo Zanzotto.
          <year>2005</year>
          .
          <article-title>Terminology extraction: an analysis of linguistic and statistical approaches</article-title>
          .
          <source>In Knowledge Mining</source>
          , pages
          <fpage>255</fpage>
          -
          <lpage>279</lpage>
          . Springer.
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          <string-name>
            <given-names>Paul</given-names>
            <surname>Rayson</surname>
          </string-name>
          and
          <string-name>
            <given-names>Roger</given-names>
            <surname>Garside</surname>
          </string-name>
          .
          <year>2000</year>
          .
          <article-title>Comparing Corpora Using Frequency Profiling</article-title>
          .
          <source>In Proceedings of the Workshop on Comparing Corpora - Volume 9, WCC '00</source>
          , pages
          <fpage>1</fpage>
          -
          <lpage>6</lpage>
          , Stroudsburg, PA, USA. Association for Computational Linguistics.
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          <string-name>
            <given-names>Mathieu</given-names>
            <surname>Roche</surname>
          </string-name>
          , Je´roˆme Aze´,
          <string-name>
            <given-names>Yves</given-names>
            <surname>Kodratoff</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Michele</given-names>
            <surname>Sebag</surname>
          </string-name>
          .
          <year>2004</year>
          .
          <article-title>Learning interestingness measures in terminology extraction. a roc-based approach</article-title>
          .
          <source>In “ROC Analysis in AI” Workshop (ECAI</source>
          <year>2004</year>
          ), Valencia, Spain, pages
          <fpage>81</fpage>
          -
          <lpage>88</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          <string-name>
            <given-names>Johannes</given-names>
            <surname>Scha</surname>
          </string-name>
          ¨fer.
          <year>2015</year>
          .
          <article-title>Statistical and parsing-based approaches to the extraction of multi-word terms from texts: implementation and comparative evaluation</article-title>
          .
          <source>Bachelor thesis</source>
          , ms.
          <source>Institute for Natural Language Processing (IMS)</source>
          , University of Stuttgart.
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          <string-name>
            <given-names>Helmut</given-names>
            <surname>Schmid</surname>
          </string-name>
          and
          <string-name>
            <given-names>Florian</given-names>
            <surname>Laws</surname>
          </string-name>
          .
          <year>2008</year>
          .
          <article-title>Estimation of conditional probabilities with decision trees and an application to fine-grained POS tagging</article-title>
          .
          <source>In Proceedings of the 22nd International Conference on Computational Linguistics-Volume</source>
          <volume>1</volume>
          , pages
          <fpage>777</fpage>
          -
          <lpage>784</lpage>
          . Association for Computational Linguistics.
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          <string-name>
            <given-names>Marie</given-names>
            <surname>Zollmann</surname>
          </string-name>
          , Ina Ro¨siger, Ulrich Heid, and
          <string-name>
            <given-names>Michael</given-names>
            <surname>Dorna</surname>
          </string-name>
          .
          <year>2016</year>
          .
          <article-title>Nutzen von Parsing in der Termextraktion: eine qualitative und quantitative korpusbasierte Untersuchung</article-title>
          .
          <source>In Poster session of the DGfS conference</source>
          <year>2016</year>
          (to appear).
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>