Regular expression learning for information extraction
Yunyao Li, Rajasekar Krishnamurthy, Sriram Raghavan et al. · Conference on Empirical Methods in Natural Language Processing (EMNLP) · 2008
Regular expressions have served as the dominant workhorse of practical information extraction for several years.However, there has been little work on reducing the manual effort involved in building high-quality, complex regular expressions for information extraction tasks.In this paper, we propose Re-LIE, a novel transformation-based algorithm for learning such complex regular expressions.We evaluate the performance of our algorithm on multiple datasets and compare it against the CRF algorithm.We show that ReLIE, in addition to being an order of magnitude faster, outperforms CRF under conditions of limited training data and cross-domain data.Finally, we show how the accuracy of CRF can be improved by using features extracted by ReLIE.
Cited by 165 works. doi:10.3115/1613715.1613719 Open-access PDF
Authors
References
- Maximum Entropy Markov Models for Information Extraction and Segmentation
- Learning Information Extraction Rules for Semi-Structured and Free Text
- Toward information extraction: identifying protein names from biological papers.
- Named entity recognition with character-level models
- Tagging gene and protein names in biomedical text
- Adaptive information extraction from text by rule induction and generalisation
- An effective two-stage model for exploiting non-local dependencies in named entity recognition
- XTRACT
- Self-supervised relation extraction from the Web
- The common pattern specification language