Cited By
View all- Krieger HSchäfer UJoshi AHuang CJurafsky D(2010)DL meet FLProceedings of the 23rd International Conference on Computational Linguistics: Posters10.5555/1944566.1944633(588-596)Online publication date: 23-Aug-2010
Integrating information extraction and automatic hyperlinking
Authors: 
Stephan Busemann, Witold Drożdżyński, Hans-Ulrich Krieger, Jakub Piskorski, 
Ulrich Schäfer, Hans Uszkoreit, Feiyu XuAuthors Info & Claims
Pages 117 - 120
Abstract
This paper presents a novel information system integrating advanced information extraction technology and automatic hyper-linking. Extracted entities are mapped into a domain ontology that relates concepts to a selection of hyperlinks. For information extraction, we use SProUT, a generic platform for the development and use of multilingual text processing components. By combining finite-state and unification-based formalisms, the grammar formalism used in SProUT offers both processing efficiency and a high degree of decalrativeness. The ExtraLink demo system show-cases the extraction of relevant concepts from German texts in the tourism domain, offering the direct connection to associated web documents on demand.
References
[1]
J. Allen, J. Davis, D. Krafft, D. Rus, and D. Subramanian. Information agents for building hyperlinks. J. Mayfield and C. Nicholas: Proceedings of the Workshop on Intelligent Hypertext, 1993.
[2]
M. Asahara and Y. Matsumoto. Extended models and tools for high-performance part-of-speech tagger. Proceedings of COLING, 21-27, 2000.
[3]
M. Becker, W. Drożdżyński, H.-U. Krieger, J. Piskorski, U. Schäfer, F. Xu. SProUT--Shallow Processing with Typed Feature Structures and Unification. In Proceedings of ICON, 2002.
[4]
J. Hajič. Disambiguation of rich inflection--computational morphology of Czech. Prague Karolinum, Charles University Press, 2001.
[5]
H.-U. Krieger and U. Schäfer. TDL-A Type Description Language for Constraint-Based Grammars. Proceedings of COLING, 893--899, 1994.
[6]
H.-U. Krieger and J. Piskorski. Speed-up methods for complex annotated finite state grammars. DFKI Report, 2003.
[7]
K. Liu. Research of automatic Chinese word segmentation. Proceedings of ILT&CIP, 2001.
[8]
D. Petitpierre and G. Russell. MMORPH-the Multext morphology program. Multext deliverable report 2.3.1. ISSCO, University of Geneva, 1995.
[9]
J. Piskorski, W. Drożdżyński, F. Xu and O. Scherf. A flexible XML-based regular compiler for creation and converting linguistic resources. Proceedings of LREC 2002, Las Palmas, Spain, 2002.
[10]
A. Przepiórkowski and M. Wolinski. The Unbearable Lightness of Tagging: A Case Study in Morphosyntactic Tagging of Polish. Proceedings of the Workshop on Linguistically Interpreted Corpora, 2003.
- Integrating information extraction and automatic hyperlinking
Recommendations
Improved Automatic Keyphrase Extraction by Using Semantic Information
ICICTA '08: Proceedings of the 2008 International Conference on Intelligent Computation Technology and Automation - Volume 01Keyphrases provide semantic metadata producing an overview of the content of a document, they are used in many text-mining applications. This paper proposes a new method that improves automatic keyphrase extraction by using semantic information of ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Publisher
Association for Computational Linguistics
United States
Publication History
Published: 07 July 2003
Qualifiers
- Article
Acceptance Rates
Overall Acceptance Rate 85 of 443 submissions, 19%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 283Total Downloads
- Downloads (Last 12 months)37
- Downloads (Last 6 weeks)5
Reflects downloads up to 10 Dec 2024
Other Metrics
Citations
Cited By
View all- Krieger HSchäfer UJoshi AHuang CJurafsky D(2010)DL meet FLProceedings of the 23rd International Conference on Computational Linguistics: Posters10.5555/1944566.1944633(588-596)Online publication date: 23-Aug-2010
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in