Albert Weichselbraun

is a Professor of Information Science at the University of Applied of the Grisons.

Redundancy-based information extraction

less than 1 minute read

The notion of redundancy-based information extraction utilizes the fact that many information on the Web is redundand, which leads to the consequences that

  • it is sufficient to focus on simple sentences (because data "hidden" in complicated constructs is expected to reappear in simpler form)
Literature:

  • [etzioni2004, ontology-linktype.bib] Etzioni, O., Cafarella, M., Downey, D., Kok, S., Popescu, A.M., Shaked, T., Soderland, S., Weld, D.S. and Yates, A. (2004). ''Web-scale information extraction in knowitall:(preliminary results)'', Proceedings of the 13th international conference on World Wide Web, ISBN: 1-58113-844-X, ACM, pages 100--110
  • [kwok2001, ontology-linktype.bib] Kwok, Cody C.T, Etzioni, Oren and Weld, Daniel S. (2001). ''Scaling Question Answering to the Web'', World Wide Web, pages 150-161
  • [banko2002, ontology-linktype.bib] Banko, Michele, Brill, Eric, Dumais, Susan and Lin, Jimmy (2002). ''AskMSR: Question Answering Using the Worldwide Web'', Proceedings of 2002 AAAI Spring Symposium on Mining Answers from Texts and Knowledge Bases

You may also enjoy

Suffix array

1 minute read

The suffix array is a memory-efficient alternative to the suffix tree which provides a sorted list of string indices indicating the string’s suffixes.