科技前沿 ppt课件

background
INTRODUCTION
With the continuous development of commercial web search engine, more and more presents for the center with the user ers more and hope to get the most honest answers, or entity needs to satisfy their information.A key step in the process is mentioned in the query entity can be linked to the reference of the knowledge base (KB). This link must be finished in the limited time and space under the budget and prior to the actual search is carried out.Free text links to entities known as entity links usually includes three steps: (1) determine the link which is mentioned in the text. (2) identify candidate entity for each mentioned text query (3) to eliminate ambiguities of candidate entities.
ABSTRACT
2.we leverage hashing and compression techniques to reduce the memory footprint.
1.The linking process ignores any dependencies between the different entity candidates, which allows for a O(k2) implementation in the number of query terms.
2. Anchor text Personal website links, anchor text for "search engine" page to add links in general should be directly related with the page link, search engine can be according to point to a web page link anchor text description to determine the content of web pages.
Keywords: Entity Linking; Wikipedia; Queries; Web Search
Three key Ingredients:
3.To equip the algorithm with contex-tual knowledge without sacrificing speed, we facstributional semantics of the query words and entities into the model.
The main idea
Entity linking deals with identifying entities from a knowledgebase in a given piece of text and has become a fundamental building block for web search engines, enabling numerous downstream improvements from better document ranking to enhanced search results pages. A key problem in the context of web search queries is that this process needs to run under severe time constraints as it has to be performed before any actual retrieval takes place, typically within milliseconds.
3. Entity linking
Fast Entity Linker
MODELING ENTITY LINKING
We begin by introducing our model, which we describe using the following random variables, assuming as an event space S E where S is the set of all sequences and E the set of all entities known to the system: s is a sequence of terms t∈s s represents a segmentation where s∈s is drawn from the set S e represents a set of entities e ∈ e, where each e is drawn from the set E
Fast and Space-Efficient Entity Linking in Queries
CONTENTS
1
MODELING ENTITY
LINKING
RELATED
TECHNOLOGY
INTRODUCTION
ABSTRACT
RESULTS AND DISCUSSION
ABSTRACT
RELATED WORK
1.Search engine It refers to automatically from the Internet to collect information, after a certain after finishing, provided to the user‘s query system.