Chakrabarti, Soumen (2004) Breaking Through the Syntax Barrier: Searching with Entities and Relations ECML 2004: Machine Learning: ECML 2004, 3201 . pp. 9-16. ISSN 0302-9743
Full text not available from this repository.
Official URL: http://doi.org/10.1007/978-3-540-30115-8_3
Related URL: http://dx.doi.org/10.1007/978-3-540-30115-8_3
Abstract
The next wave in search technology will be driven by the identification, extraction, and exploitation of real-world entities represented in unstructured textual sources. Search systems will either let users express information needs naturally and analyze them more intelligently, or allow simple enhancements that add more user control on the search process. The data model will exploit graph structure where available, but not impose structure by fiat. First generation Web search, which uses graph information at the macroscopic level of inter-page hyperlinks, will be enhanced to use fine-grained graph models involving page regions, tables, sentences, phrases, and real-world-entities. New algorithms will combine probabilistic evidence from diverse features to produce responses that are not URLs or pages, but entities and their relationships, or explanations of how multiple entities are related.
Item Type: | Article |
---|---|
Source: | Copyright of this article belongs to Springer Nature Switzerland AG |
Keywords: | Natural Language Processing;Information Extraction;Pointwise Mutual Information;Unstructured Text;Coreferent Resolution |
ID Code: | 130951 |
Deposited On: | 01 Dec 2022 10:30 |
Last Modified: | 01 Dec 2022 10:30 |
Repository Staff Only: item control page