A supervised machine learning approach for taxonomic relation recognition through non-linear enumerative structures
Pages 423 - 425
Abstract
Improving relation extraction process requires to have a better insight of the proper text or to use external resources. Our work lies in the first term of this alternative, and aim at extending works about semantic relation identification in texts for building taxonomies which constitute the backbone of ontologies on which Semantic Web applications are built. We consider a specific discursive structure, the enumerative structure, as it bears explicit hierarchical knowledge. This structure is expressed with the help of lexical or typo-dispositional markers whose role is to introduce hierarchical levels between its components. Typo-dispositional markers are unfortunately not integrated into most parsing systems used for information extraction tasks. In order to extend the taxonomic relation identification process, we thus propose a method for recognizing this relation through enumerative structures which benefit from typo-dispositional markers (we called them non-linear enumerative structures). Our method is based on supervised machine learning. Two strategies have been applied: a linear classification with a MaxEnt and a non-linear one with a SVM. The results obtained in each of these approaches are close, with respectively an F1 of 81.25% and of 81.77%.
References
[1]
A. Berger, V. Pietra, and S. Pietra. A maximum entropy approach to natural language processing. Computational linguistics, 22(1):39--71, 1996.
[2]
B. E. Boser, I. M. Guyon, and V. N. Vapnik. A training algorithm for optimal margin classifiers. In Proceedings of the fifth annual workshop on Computational learning theory, pages 144--152. ACM, 1992.
[3]
P. Cimiano, A. Hotho, and S. Staab. Learning concept hierarchies from text corpora using formal concept analysis. J. Artif. Intell. Res.(JAIR), 24:305--339, 2005.
[4]
M. A. Hearst. Automatic acquisition of hyponyms from large text corpora. In Proceedings of the 14th conference on Computational linguistics, volume 2, pages 539--545. Association for Computational Linguistics, 1992.
[5]
M. Kamel, B. Rothenburger, and J.-P. Fauconnier. Identification de relations sémantiques portées par les structures énumératives paradigmatiques. Revue d'Intelligence Artificielle, Ingénierie des Connaissances, 2014.
[6]
J.-H. Oh, K. Uchimoto, and K. Torisawa. Bilingual co-training for monolingual hyponymy-relation acquisition. In Proceedings of the 47th Annual Meeting of the ACL and the 4th IJCNLP of the AFNL, pages 432--440. Association for Computational Linguistics, 2009.
[7]
S. Ravi and M. Paşca. Using structured text for large-scale attribute extraction. In Proceedings of the 17th ACM conference on Information and knowledge management, pages 1183--1192. ACM, 2008.
[8]
A. Sumida and K. Torisawa. Hacking wikipedia for hyponymy relation acquisition. In IJCNLP, volume 8, pages 883--888. Citeseer, 2008.
[9]
A. Urieli. Robust French syntax analysis: reconciling statistical methods and linguistic knowledge in the Talismane toolkit. PhD thesis, Université de Toulouse, 2013.
Index Terms
- A supervised machine learning approach for taxonomic relation recognition through non-linear enumerative structures
Recommendations
Eliciting hierarchical structures from enumerative structures for ontology learning
K-CAP '11: Proceedings of the sixth international conference on Knowledge captureSome discourse structures such as enumerative structures have typographical, punctuational and laying out characteristics which (1) make them easily identifiable and (2) convey hierarchical relations which provide ontology fragments clues. This study ...
Learning Relation Ties with a Force-Directed Graph in Distant Supervised Relation Extraction
Relation ties, defined as the correlation and mutual exclusion between different relations, are critical for distant supervised relation extraction. Previous studies usually obtain this property by greedily learning the local connections between ...
REKER: Relation Extraction with Knowledge of Entity and Relation
Natural Language Processing and Chinese ComputingAbstractRelation Extraction (RE) is an important task to mine knowledge from massive text corpus. Existing relation extraction methods usually purely rely on the textual information of sentences to predict the relations between entities. The useful ...
Comments
Information & Contributors
Information
Published In
April 2015
2418 pages
ISBN:9781450331968
DOI:10.1145/2695664
- Conference Chairs:
- Roger L. Wainwright,
- Juan Manuel Corchado,
- Program Chairs:
- Alessio Bechini,
- Jiman Hong
Copyright © 2015 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 13 April 2015
Check for updates
Author Tags
Qualifiers
- Short-paper
Conference
SAC 2015
Sponsor:
Acceptance Rates
SAC '15 Paper Acceptance Rate 291 of 1,211 submissions, 24%;
Overall Acceptance Rate 1,650 of 6,669 submissions, 25%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 96Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 10 Nov 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in