![]() |
![]() |
![]() |
@inproceedings{DBLP:conf/widm/YiS99, author = {Jeonghee Yi and Neel Sundaresan}, editor = {Cyrus Shahabi}, title = {Mining the Web for Acronyms Using the Duality of Patterns and Relations}, booktitle = {ACM CIKM'99 2nd Workshop on Web Information and Data Management (WIDM'99), Kansas City, Missouri, USA, November 5-6, 1999}, publisher = {ACM}, year = {1999}, pages = {48-52}, ee = {db/conf/widm/YiS99.html, http://doi.acm.org/10.1145/319759.319782}, crossref = {DBLP:conf/widm/99}, bibsource = {DBLP, http://dblp.uni-trier.de} }BibTeX
The Web is a rich source of information, but this information is scattered and hidden in the diversity of web pages. Search engines are windows to the web. However, the current search engines, designed to identify pages with specified phrases, have very limited power. For example, they cannot search for phrases related in a particular way (e.g. books and their authors).
In this paper we present a solution for identifying a set of inter-related information on the web using the duality concept. Duality problems arise when one tries to identify a pair of inter-related phrases such as (book, author), (name, email) or (acronym, expansion) relations. We propose a solution to this problem that iteratively refines mutually dependent approximations to their identifications. Specifically, we iteratively refine i) pairs of phrases related in a specic way, and ii) the patterns of their occurrences in web pages, i.e. the ways in which the related phrases are marked in the pages. We cast light on the general solution of the duality problems in the web by concentrating on one paradigmatic duality problem, i.e. identifying (acronym, expansion) pairs in terms of the patterns of their occurrences in the web pages. The solution to this problem involves two mutually dependent duality problems of 1) the duality between the related pairs and their patterns, and 2) the duality between the related pairs and the acronym formulation rules.
Copyright © 1999 by the ACM, Inc., used by permission. Permission to make digital or hard copies is granted provided that copies are not made or distributed for profit or direct commercial advantage, and that copies show this notice on the first page or initial screen of a display along with the full citation.