CC BY
74
Automatic Recognition of Domain-Specific Terms: an Experimental Evaluation
D. Fedorenko <fedorenko@ispras.ru> N. Astrakhantsev <astrakhantsev@ispras.ru> D. Turdakov <turdakov@ispras.ru> ISP RAS, 25 Alexander Solzhenitsyn Str., Moscow, 109004, Russian Federation
Abstract. This paper presents an experimental evaluation of the state-of-the-art approaches for automatic term recognition based on multiple features: machine learning method and voting algorithm. We show that in most cases machine learning approach obtains the best results and needs little data for training; we also find the best subsets of all popular features.
Keywords: automatic term recognition, term extraction, machine learning, experimental evaluation, feature selection.
1. Introduction
Automatic term recognition (ATR) is an actual problem of text processing. The task is to recognize and extract terminological units from different domain-specific text collections. Resulting terms can be useful in more complex tasks such as semantic search, question-answering, ontology construction, word sense induction, etc. There are a lot of studies of ATR. Most of them split the task into three common steps:
• Extracting term candidates. At this step special algorithm extracts words and word sequences admissible to be terms. In most cases researches use predefined or generated part-of-speech patterns to filter out word sequences that do not match such the patterns. The rest of word sequences becomes term candidates.
• Extracting features of term candidates. Feature is a measurable characteristic of a candidate that is used to recognize terms. There are a lot of statistical and linguistic features that can be useful for term recognition.
• Extracting final terms from candidates. This step varies depending upon the way in which researches use features to recognize terms. In some studies authors filter out non-terms by comparing feature values with thresholds: if feature values lies in specific ranges, then candidate is considered
to be a term. Others try to rank candidates and expect the top-N ones to be terms. At last, few studies apply supervised machine learning methods in order to combine features effectively. There are several studies comparing different approaches for ATR. In [1] authors compare different single statistical features by their effectiveness for term candidates ranking. In [2] the same comparison is extended by voting algorithm that combines multiple features. Studies [3], [4] compare supervised machine learning method with the approach based on single feature again.
In turn, the present study experimentally evaluates the ranking methods combining multiple features: supervised machine learning approach and voting algorithm. We pay most of the attention to the supervised method in order to explore its applicability to ATR.
The purposes of the study are the following:
• To compare results of machine learning approach and voting algorithm;
• To compare different machine learning algorithms applied to ATR;
• To explore how much training data is needed to rank terms;
• To find the most valuable features for the methods;
This study is organized as follows. At the beginning we describe the approaches more detailed. Section 3 is devoted to the performed experiments: firstly, we describe evaluation methodology, then report the obtained results, and, finally, discuss them. In Section 4 we conclude the study and consider the further research.
2. Related Work
In this section we describe some of the approaches to ATR. Most of them have the same extracting algorithm but consider different feature sets, so the final results depend only on the used features. We also briefly describe features used in the task. For more detailed survey of ATR see [5], [6].
2.1 Extracting Term Candidates Overview
Strictly, all of the word sequences, or n-grams, occurring in text collections can be term candidates. But in most cases researchers consider only unigrams and bigrams [1]. Of course, only the little part of such the candidates are terms, because the candidates' list mainly consists of sequences like "a", "the", "some of', "so the", etc. Hence such the noise should be filtered out.
One of the first methods for such the filtering was described in [7]. The algorithm extracts term candidates by matching the text collection with predefined Part-of-Speech (PoS) patterns, such as:
• Noun
• Adjective Noun
• Adjective Noun Noun
As was reported in [7], such the patterns cut off much of the noise (word sequences that are not terms) but retain real terms, because in most cases terms are noun phrases [8]. Filtering of term candidates that do not satisfy some of the morphological properties of word sequences is known as linguistic step of ATR. In work [3] the authors do not use predefined patterns appealing to the fact that PoS tagger can be not precise enough on some texts; they instead generate patterns for each text collection. In study [9] no linguistic step is used: the algorithm considers all n-grams from text collection.
2.2 Features overview
Having a lot of term candidates, it is necessary to recognize domain specific ones among them. It can be done by using the statistical features computed on the basis of the text collection or some another resource, for example general corpus [7], domain ontology [10] or Web [11]. This part of ATR algorithm is known as statistical step.
Term Frequency is a number of occurrences of the word sequence in the text collection. This feature is based on the assumption that if the word sequence is specific for some domain, then it often occurs in such domain texts. In some studies frequency is also used as an initial filter of term candidates [1 2 ]: if a candidate has a very low frequency, then it is filtered out. It helps to reduce much of the noise and improves precision of the results.
TF*IDF has high values for terms that often occur only in few documents: TF is a term frequency and IDF is an inversed number of documents, where the term occurs:
\Docs\
TF ■ IDF(t) = TF(t) • log—-——
w w &\Doc-.t £ Doc\
To find domain-specific terms that are distributed on the whole text collection, in [7] IDF is considered as an inversed number of documents in reference corpus, where the term occurs. Reference corpus is a some general, i.e. not specific, text collection.
The described features shows how the word sequence is related to the text collection, or termhood of a candidate. There is another class of features that show inner strength of words cohesion, or unithood [5]. One of the first features of this class is T-test.
T-test [7] is a statistical test that was initially designed for bigrams and checks the hypothesis of independence of words constituting a term:
TF(t)
T - stat(t) =
~N--P
pQ- - v)
N
where p - hypothesis of independence, TV - a number of bigrams in the corpus.
The assumption of this feature is that the text is a Bernoulli process, where meeting of bigram t is a "success", while meeting of other bigrams is a "failure". Hypothesis of independence is usually expressed as follows: p=P(w1w2)=P(w1) • P(m>2), where Pfwt) - a probability to encounter the first word of the bigram, Pi\v2j - a probability to encounter the second one. This expression can be assessed by replacing the probabilities of words to their normalized frequencies within a text:
p=TF(w i)/N • TF(w2)/N, where TV - an overall number of words in the text.
If words are independently distributed in text collection, then they do not form persistent collocation. It is assumed that any domain-specific term is a collocation, while not any collocation is a specific term. So considering features like T-test, we can increase the confidence in that candidate is a collocation, but not necessarily specific term.
There are much more features that are used in ATR.
C-Value [13] has higher values for candidates that are not parts of other word sequences:
C-yaZue(0 = log2|t|-7-F(0- ^ • £ TF(seq)
tEseq
Domain Consensus [14] recognizes terms that are uniformly distributed on the whole dataset:
ZTFd (t)
TFd(t) TFd(t) TF(t) ' °g2 TF(t)
dEDocs
Domain Relevance [15] compares frequencies of the term in two datasets - target and general:
= _TFtarget{t)_
"^target (0 "t" TFreference (t)
Lexical Cohesion [16] is the unithood feature that compares frequency of term and frequency of words from which it consists:
\t\ • 7T(t) • log107T(t)
LC{t) = ■
ZwetTF(w)
Loglikelihoocl [7] is the analogue of T-test but without assumption about how words in a text are distributed:
r , 6(ci2;c1(p)-&(c2-c12;N-c1(p)
LogL(t) = log-
'b(c12; Ci.pO ■ b(c2 — c12; N — cltp2)
where c,2 - a frequency of bigram t. c, - a frequency of the bigram's first word, c2 -a frequency of the second one, p=c2/N, p1=c12/c1, p2=(c2-c12)/(N-ci), b(';',') - binomial distribution.
Relevance [17] is the more sophisticated analogue of Domain Relevance: R(t) - 1 1
, sn . TFtarqet(t)-DFtarqet(t) l0§2(2 +-fp-Try-)
1 1 reference \LJ
Weirdness [18] compares frequencies in different collections but also takes into account their sizes:
TFtarqet{t) • Corpusreference
W(t) = --T--L-7~
' "reference ' \ target]
The described feature list includes termhood, unithood and hybrid features. The termhood features are Domain Consensus, Domain Relevance, Relevance, and Weirdness. The unithood features are Lexical Cohesion and Loglikelihood. The hybrid feature, or feature that shows both termhood and unithood, is C-Value. A lot of works still concentrate on feature engineering, trying to find more informative features. Nevertheless, recent trend is to combine all these features effectively.
2.3 Recognizing terms overview
Having feature values, final results can be produced. The studies [13], [7], [18] use ranking algorithm to provide the most probable terms, but this algorithm considers only one feature. The studies [15], [16] describe the simplest way of how multiple features can be considered: all values are simply reduced in a one weighted average value that then is used during ranking.
In work [19] authors introduce special rules based on thresholds for feature values. An example of such a rule is the following:
Ruleiit) = Fiit) > aandFj(t) < b
where /•', is a i-th feature; a, b are thresholds for feature values
Note that the thresholds are selected manually or computed from the marked-up corpora, so this method can not be considered as purely automatic and unsupervised.
Effective way of combining multiple features was introduced in [2]. It combines the features in a voting manner using the following formula:
Li rank(Fi(t))
I
where n is a number of considered features, rankfFft)) is a rank of the term t among values of other terms considering feature /•',.
Table 1: Results of cross-validation without frequency filter
Dataset Algorithm AvP
GF.NTA Random Forest 0 54
GENIA Logistic Regression 0.55
GENIA Voting 0.53
Riol Random Forest 0 35
Biol Logistic Regression 0.40
Biol Voting 0.23
Table 2: Results of cross-validation with frequency filter
Dataset Algorithm AvP
GF.NTA Random Forest 0 66
GENIA Logistic Regression 0.70
GENIA Voting 0.65
Biol Random Forest 0.52
Biol Logistic Regression 0.58
Biol Voting 0.31
In addition, study [2] shows that the described voting method in general outperforms most of the methods that consider only one feature or reduce them in a weighted average value. Another important advantage of the voting algorithm is that it does not require normalization of feature values.
There are several studies that apply supervised methods for term recognition. In [3] authors apply AdaBoost meta-classifier, while in [9] Ripper system is used. The study [20] describes hybrid approach including both unsupervised and supervised methods.
3. Evaluation
For our experiments we implemented two approaches for ATR. We used voting algorithm as the first one, while in supervised case we trained two classifiers: Random Forest and Logistic Regression from WEKA library1. These classifiers were chosen because of their effectiveness and good generalization ability of the resulting model. Furthermore, these classifiers are able to produce classification confidence -a numeric score that can be used to rank an example in overall test set. It is an important property of the selected algorithms that allows to compare their results with results produced by other ranking methods.
1 Official website of the project: http://www.cs.waikato.ac.nz/ml/weka/ 60
3.1 Evaluation methodology
The quality of the algorithms is usually assessed by two common metrics: precision and recall [21]. Precision is the fraction of retrieved instances that are relevant:
I correct returned results I
P =-
I all returned results I
Recall is the fraction of relevant instances that are retrieved:
Icorrect returned resultsl ^ —_
I all correct resultsl
In addition to precision and recall scores, Average Precision (AvP) [7] is commonly used [2] to assess ranked results. It defines as:
N
AvP = ^P(i)AR(i)
i=1
where P(i) is the precision of top-i results, AR(i) change in recall from top-(i-l) to top-i results.
Obviously, this score tends to be higher for algorithms that print out correct terms on top positions of the result.
In our experiments we considered only the AvP score, while precision and recall are omitted. For voting algorithm it is no simple way to compute recall, because it is not obvious what number of top results should be considered as correct terms. Also in a general case the overall number of terms in dataset is unknown.
3.2 Features
For our experiments we implemented the following features: C-Value, Domain Consensus, Domain Relevance, Frequency, Lexical Cohesion, Loglikelihood, Relevance, TF*IDF, Weirdness and Words Count. Words Count is the simple feature that shows a number of words in a word sequence. This feature may be useful for the classifier since values of other features may have different meanings for single-and multi-word terms [6].
Most of these features are capable to recognize both single- and multi-word terms, except T-test and Loglikelihood that are designed to recognize only two-word terms (bigrams). We generalize them to the case of n-grams according to the study [22]. Some of the features consider information from the collection of general-domain texts (reference corpus), in our case these features are Domain Relevance, Relevance, Weirdness. For this purpose we use statistics from Corpus of Contemporary American English2.
2 Statistics available at http://www.ngrams.info
For extracting term candidates we implemented simple approach based on predefined part-of-speech patterns. For simplicity, we extracted only unigrams, bigrams and trigrams by using patterns such as:
• Noun
• Noun Noun
• Adjective Noun
• Noun Noun Noun
• Adjective Noun Noun
• Noun Adjective Noun
3.3 Datasets
Evaluation of the approaches was performed on two datasets of medical and biological domains consisting of short English texts with marked-up specific terms:
Corpus Documents Words Terms
GENIA Biol 2000 100 400000 20000 35000 1200
The last one (Biol) has common texts with the first (GENIA), so we filtered out the texts that occur in both the corpora. We left GENIA without any modifications, while 20 texts were removed from Biol as common texts of the corpora.
Table 3: Results of evaluation on separated train and test sets without frequency filter
Trainset Testset Algorithm AvP
GENIA Biol Random Forest 0.30
GENIA Biol Logistic Regression 0.35
- Biol Voting 0.25
Biol GENIA Random Forest 0.44
Biol GENIA Logistic Regression 0.42
- GENIA Voting 0.55
3.4 Experimental results
3.4.1 Machine learning method versus Voting algorithm. We considered two test scenarios in order to compare quality of the implemented algorithms. For each scenario we performed two kinds of tests: with and without filtering of rare term candidates.
In the following tests the whole feature set was considered and the overall ranked result was assessed.
Cross-validation. We performed 4-fold cross-validation of the algorithms on both the corpora. We extracted term candidates from the whole dataset and divided them
on train and test sets. In other words, we considered the case when having some marked-up examples (train set) we should recognize terms in the rest of data (test set) extracted from the same corpus. So in case of voting algorithm the training set was simply omitted.
The results of cross-validation are shown in the Tables 1, 2. The Table 2 presents results of cross-validation on term candidates that appears at least two times in the corpus.
As we can see, in both the cases machine learning approach outperformed voting algorithm. Moreover, in the case without rare terms a difference of scores is higher. It can be explained by the following: feature values of rare terms (especially Frequency, Domain Consensus) are useless for the classification and add a noise to the model. When such the terms are omitted, the model becomes more clear. Also in most cases Logistic Regression algorithm outperformed Random Forest, so in most of further tests we used only the best one.
Separate train and test datasets. Having two datasets of the same field, the idea is to check how the model trained on the one can predict the data from the other. For this purpose we used GENIA as a training set and Biol as a test one, then visa versa.
The results are shown in the Tables 3, 4. In the case when Biol was used as a training set, voting algorithm outperformed trained classifier. It could happen due to the fact that the training data from Biol does not fully reflect properties of terms in GENIA.
3.4.2 Dependency of average precision from number of top results.
In previous tests we considered overall results produced by the algorithms. Descending from the top to the bottom of the ranked list, AvP score can significantly change, so one algorithm can outperform another one on top-100 results but lose on top-1000. In order to explore this dependency, we measured AvP for different slices of the top results.
The Figure 1 shows the dependency of AvP from number of top results given by 4-fold cross-validation.
We also considered a scenario when GENIA was used for training and Biol for testing. The results are presented on the Figure 2.
3.4.3 Dependency of classifier performance from training set size.
In order to explore dependency between the amount of data used for training and average precision, we considered three test scenarios.
At first, we trained the classifier on GENIA dataset and tested it on Biol. At each step the amount of training data was being decreased, while the test data remained without any modifications. The results of the test are presented on the Figure 3.
Table 4: Results of evaluation on separated train and test sets with frequency filter
Trainset Testset Algorithm AvP
GENIA Biol Random Forest 0.34
GENIA Biol Logistic Regression 0.48
- Biol Voting 0.31
Biol GENT A Random Forest 0.60
Biol GENIA Logistic Regression 0.62
- GENIA Voting 0.65
To p. count
Figure 1: Dependency ofAvP from top results given by cross-validation
Next, we started with 10-fold cross-validation on GENIA and at each step decreased the number of folds used for training of Logistic Regression and did not change the number of folds used for testing. The results are shown on the Figures 4-8. The last test is the same as the previous one, except that the number of test folds was being increased at each step. So we started with nine folds used for training and one fold used for the test. At the next step we moved one fold from training set to the test set and evaluated again. The results are presented on the Figures 9-13. The interesting observation is that higher values of AvP correspond to the bigger sizes of the test set. It could happen because with increasing of the test set the number of high-confident terms is also growing: such the terms take most of the top positions of the list and improve AvP. In case of GENIA and Biol the top of the list mainly consists from the highly domain-specific terms that take high values for the features like Domain Relevance, Relevance, Weirdness: such the terms occur in the corpora frequently enough.
As we can see, in all of the cases the gain of AvP stopped quickly. So, in case of GENIA, it is enough to train on 10% of candidates to rank the rest 90% with the same performance. It could happen because of the relatively small number of fea-64
tures are used and their specificity: most of them designed to have high magnitude for terms and low for non-terms. So, the data can be easily separated by the classifier having few training examples.
Figure 2: Dependency ofAvP from top results on separated train and test sets
Figure 3: Dependency ofAvP from train set size on separated train and test sets
3.5 Feature selection
Feature selection (FS) is the process of finding the most relevant features for the task. Having a lot of different features, the goal is to exclude redundant and irrelevant ones from the feature set. Redundant features provide no useful information as compared with the current feature set, while irrelevant features do not provide information in any context.
There are different algorithms of FS. Some of them rank separate features by relevance to the task, while others search subsets of features that get the best model for
the predictor [23]. Also the algorithms differ by their complexity. Because of big amount of features used in some tasks, it is not possible to do exhaustive search, so features are selected by greedy algorithms [24].
In our task we concentrated on searching the subsets of features that get the best results for the task. For such purpose we ran quality tests for all possible feature subsets, or, in other words, performed the exhaustive search. Having 10 features, we check 210-1 different combinations of them. In case of the machine learning method, we used 9 folds for test and one fold for train. The reason of such the configuration is that the classifier needs little data for training to rank terms with the same performance (see the previous section). For voting algorithm, we simply ranked candidates and then assessed overall list. All of the tests were performed on GENIA corpus and only the Logistic Regression was used as the machine learning algorithm. The AvP score was computed for different slices of the top terms: 100, 1000, 5000, 10000, and 20000. The same slices are used in [2]. The best results for the algorithms are presented in the Tables 5, 6. This table shows that voting algorithm has better scores then machine learning method, but such the results are not fully comparable: FS for voting algorithm was performed on the whole dataset, while Logistic Regression was trained on 10% of term candidates. The average performance gain for voting algorithm is about 7%; while for machine learning it is only about 3%. The best features for voting algorithm:
• Top-100: Relevance, TF*IDF
• Top-1000: Relevance, Weirdness, TF*IDF
• Top-5000: Weirdness
• Top-10000: Weirdness
• Top-20000: CValue, Frequency, Domain Relevance, Weirdness The best features for the machine learning approach:
• Top-100: Words Count, Domain Consensus, Normalized Frequency, Domain Relevance, TF*IDF
• Top-1000: Words Count, Domain Relevance, Weirdness, TF*IDF
• Top-5000: Words Count, Frequency, Lexical Cohesion, Relevance, Weirdness
• Top-10000: Words Count, CValue, Domain Consensus, Frequency, Weirdness, TF*IDF
• Top-20000: Words Count, CValue, Domain Relevance, Weirdness, TF*IDF
As we can see, most of the subsets contain features based on a general domain. The reason can be that the target corpus has high specificity, so the most of terms do not occur in a general corpus.
The next observation is that in case of the machine learning algorithm, Words Count feature occurs in all of the subsets. This observation confirms an assumption that
this feature is useful for algorithms that recognize both the single- and multi-word terms.
Table 5: Results ofFS for voting algorithm
Top count All features The best features
100 0.9256 0.9915
1000 0.8138 0.8761
5000 0.7128 0.7885
10000 0.667 0.7380
20000 0.6174 0.6804
Table 6: Results ofFS for Logistic regression
Top count All features Supervised AvP
100 0.8997 0.9856
1000 0.8414 0.8757
5000 0.7694 0.7875
10000 0.7309 0.7329
20000 0.6623 0.6714
3.6 Discussion
Despite the fact that filtering of the candidates occurring only once in the corpus improves average precision of the methods, it is not always a good idea to exclude such the candidates. The reason is that a lot of specific terms can occur only once in a dataset: for example, in GENIA there are 50% of considered terms that occur only once. Of course, omitting such the terms extremely affects recall of the result. Thus such the cases should be considered for the ATR task.
One of the interesting observations is that the amount of training data is needed to rank terms without sufficient performance drop is extremely low. It leads to the idea of applying the bootstrapping approach for ATR:
• Having few marked-up examples, train the classifier
• Use the classifier to extract new terms
• Use the most confident terms as initial data at step 1.
• Iterate until all of confident terms will be extracted
This is a semi-supervised method, because only little marked-up data is needed to run the algorithm. Also the method can be transformed into fully unsupervised, if initial data will be extracted by some unsupervised approach (for example, by voting algorithm). The similar idea is implemented in study [20].
4. Conclusion and Future work
In this paper we have compared the performance of two approaches for ATR: machine learning method and voting algorithm. For this purpose we implemented the
set of features that include linguistic, statistical, termhood and unithood feature types. All of the algorithms produced ranked list of terms that then was assessed by average precision score.
In most tests machine learning method outperforms voting algorithm. Moreover it was explored that for the supervised method it is enough to have few marked-up examples, about 10% in case of GENIA dataset, to rank terms with good performance.
It leads to the idea of applying bootstrapping to ATR. Furthermore, initial data for bootstrapping can be obtained by voting algorithm because its top results are precise enough (see the Figure 1)
The best feature subsets for the task were also explored. Most of these features are based on a comparison between domain-specific documents collection and a reference general corpus. In case of the supervised approach, the feature Words Count occurs in all of the subsets, so this feature is useful for the classifier, because values of other features may have different meanings for single- and multi-word terms. In cases when one dataset is used for training and another to test, we could not get stable performance gain using machine learning. Even the datasets are of the same field, a distribution of terms can be different. So it is still unclear if it is possible to recognize terms from unseen data of the same field having the once-trained classifier.
For our experiments we implemented the simple method of term candidates extraction: we filter out ngrams that do not match predefined part-of-speech patterns. This step of ATR can be performed in other ways, for example by shallow parsing, or chunking3, generating patterns from the dataset [3] or recognizing term variants. Another direction of further research is related to the evaluation of the algorithms on more datasets of different languages and researching the ability of cross-domain term recognition, i.e. using a dataset of one domain to recognize terms from others. Also of particular interest is the implementation and evaluation of semi- and unsupervised methods that involve machine learning techniques.
References
[1]. Pazienza M., Pennacchiotti M., Zanzotto F. Terminology extraction: an analysis of linguistic and statistical approaches // Knowledge Mining. — 2005. — P. 255-279.
[2]. Zhang Z, Brewster C, Ciravegna F. A comparative evaluation of term recognition algorithms // Proceedings of the Sixth International Conference on Language Resources and Evaluation (LREC08), Marrakech, Morocco. — 2008.
[3]. Patry A., Langlais P. Corpus-based terminology extraction // Terminology and Content Development-Proceedings of 7th International Conference On Terminology and Knowledge Engineering, Litera, Copenhagen. — 2005.
[4]. Nokel M, Bolshakova E, Loukachevitch N. Combining multiple features for singleword term extraction. — 2012.
3 Free chunker can be found in OpenNLP project: http://opennlp.apache.org 68
[5]. Kageura K., Umino B. Methods of automatic term recognition: A review // Terminology.—1996.—V. 3,No2. —P. 259-289.
[6]. Ahrenberg L. Term extraction: A review draft version 091221. — 2009.
[7]. Manning C, Schutze H. Foundations of statistical natural language processing. — MIT press, 1999.
[8]. Empirical observation of term variations and principles for their description / B. Daille, B. Habert, C. Jacquemin, J. Royaute // Terminology. — 1996,— V. 3, No 2. — P. 197-257.
[9]. Foo J. Term extraction using machine learning. — 2009.
[10]. Zhang W, Yoshida T., Tang X. Using ontology to improve precision of terminology extraction from documents // Expert Systems with Applications. — 2009. — V. 36, No 5. — P. 9333-9339.
[11]. Dobrov B., Loukachevitch N. Multiple evidence for term extraction in broad domains // Proceedings of the 8th Recent Advances in Natural Language Processing Conference (RANLP 2011). Hissar, Bulgaria. —2011. —P. 710-715.
[12]. Church K., Hanks P. Word association norms, mutual information, and lexicography // Computational linguistics. — 1990. — V. 16, No 1. — P. 22-29.
[13]. Frantzi K., Ananiadou S. Extracting nested collocations // Proceedings of the 16th conference on Computational linguistics-Volume 1 / Association for Computational Linguistics. — 1996. — P. 41-46.
[14]. Navigli R., Velardi P. Semantic interpretation of terminological strings // Proc. 6th IntBATMl Conf. Terminology and Knowledge Eng. — 2002. — P. 95-100.
[15]. Sclano F, Velardi P. Termextractor: a web application to learn the shared terminology of emergent web communities // Enterprise Interoperability II. — 2007. — P. 287-290.
[16]. Park Y, Byrd R., Boguraev B. Automatic glossary extraction: beyond terminology identification // Proceedings of the 19th international conference on Computational linguistics-Volume 1 / Association for Computational Linguistics. — 2002. — P. 1-7.
[17]. Corpus-based terminology extraction applied to information access / A. Penas, F. Verdejo, J. Gonzalo et al. // Proceedings of Corpus Linguistics / Citeseer. — V. 2001. — 2001.
[18]. University of surrey participation in trec8: Weirdness indexing for logical document extrapolation and retrieval (wilder) / K. Ahmad, L. Gillam, L. Tostevin et al. // The Eighth Text REtrieval Conference (TREC-8). — 1999.
[19]. Velardi P., Missikoff M., Basili R. Identification of relevant terms to support the construction of domain ontologies // Proceedings of the workshop on Human Language Technology and Knowledge Management-Volume 2001 / Association for Computational Linguistics. — 2001. — P. 5.
[20]. Fault-tolerant learning for term extraction / Y. Yang, H. Yu, Y. Meng et al. — 2011.
[21]. Manning C, Raghavan P. Introduction to information retrieval.—V. 1.
[22]. Daille B. Study and implementation of combined techniques for automatic extraction of terminology // The balancing act: Combining symbolic and statistical approaches to language. — 1996. — V. 1,—P. 49-66.
[23]. Guy on I., Elisseeff A. An introduction to variable and feature selection // The Journal of Machine Learning Research. — 2003. — V. 3. — P. 1157-1182.
[24]. Molina L., Belanche L., Nebot A. Feature selection algorithms: A survey and experimental evaluation // Data Mining, 2002. ICDM 2003. Proceedings. 2002 IEEE International Conference on/IEEE. —2002. —P. 306-313.
Figure 4: Dependency ofAvP from number Figure 9: Dependency ofAvP from number
of excluded folds with fixed testset size: 10- of excluded folds with changing testset size: fold cross-validation with 1 test fold and 9 10-fold cross-validation with 1 to 9 test
to 1 train folds: Top-lOOterms folds and 9 to 1 train folds:Top-100 terns
Figure 5: Dependency ofAvP from number of excluded folds with fixed testset size: Top-1000 terns
Figure 6: Dependency ofAvP from number of excluded folds with fixed testset size: Top-5000 terns
Figure 10: Dependency ofAvP from number of excluded folds with changing testset size: Top-1000 terns
Figure 11: Dependency ofAvP from number of excluded folds with changing testset size: Top-5000 terns
т ; г
Кил
Figure 12: Dependency ofAvP from number of excluded folds with changing testset size: Top-10000 terns
Figure 7: Dependency ofAvP from number of excluded folds with fixed testset size: Top-10000 terms
"I ! V
Figure 8: Dependency ofAvP from number of excluded folds with fixed testset size: Top-20000 terms
i— — ; -r
Figure 13: Dependency ofAvP from number of excluded folds with changing testset size: Top-20000 terms
Автоматическое распознавание предметно-специфичных терминов: экспериментальная проверка
Д.Г. Федоренко <fedorenko@ispras.ru > НА. Астраханцев <astrakhantsev@ispras.ru> Д.Ю. Турдаков <turdakov@ispras.ru> ИСП РАН, 109004, Россия, г. Москва, ул. А. Солженицына, дом 25.
Аннотация. В статье приводятся результаты экспериментальной проверки современных подходов распознавания предметно-специфичных терминов: подхода на основе машинного обучения и подхода на основе алгоритма голосования. Показывается, что в большинстве случаев подход на основе машинного обучения показывает лучшие результаты и требует мало данных для обучения; также для обоих методов производится поиск наиболее информативных признаков.
Ключевые слова: автоматическое распознавание терминов, извлечение терминов, машинное обучение, экспериментальная проверка, поиск информативных признаков.
