Abstract: The present teaching relates to entity linking. In one example, a text string is received. The text string is segmented to obtain a segmentation with a set of one or more segments of the text string. A set of entities are identified, with respect to the one or more segments, from a plurality of entities as linked to the one or more segments. The identifying is in accordance with a probabilistic model based on surface form information associated with the plurality of entities.

Abstract: In one embodiment, a method includes receiving a search query, searching a reverse index to identify one or more objects having one or more tokens that match the search query, and accessing a forward index that has several records that each correspond to an object posted to an online social network. Each record may comprise a first field of tokens, and one or more second fields corresponding to metadata associated with each of the tokens. The method may further include scoring each identified object based on its respective record. The score for each identified object may be calculated based on the metadata associated with each of the tokens. The method may also include sending, to the client system in response to the received search query, instructions for presenting one or more search results corresponding to the identified objects having a score greater than a threshold score.

Abstract: Path-decomposed trie data structures are described, for example, for representing sets of strings in a succinct manner while still enabling fast operations on the string sets such as string retrieval or looking up a string with a specified identifier. A path-decomposed trie is a trie (tree data structure for storing a set of strings) where each node in the path decomposed trie represents a path in the trie. In various embodiments a path-decomposed trie data structure is represented succinctly by interleaving node labels and node degrees in an array and optionally by compressing the node labels using a static dictionary. Node labels may be string characters and a node degree may be a number of children of a node. In some embodiments a path-decomposed hollow trie data structure is used to provide a hash function for string sets.

Abstract: The present teaching relates to entity linking. In one example, a text string is received. The text string is segmented to obtain a segmentation with a set of one or more segments of the text string. A set of entities are identified, with respect to the one or more segments, from a plurality of entities as linked to the one or more segments. The identifying is in accordance with a probabilistic model based on surface form information associated with the plurality of entities.

Abstract: Compressing motion fields is described. In one example video compression may comprise computing a motion field representing the difference between a first image and a second image, the motion field being used to make a prediction of the second image. In various examples of encoding a sequence of video data the first image, motion field and a residual representing the error in the prediction may be encoded rather than the full image sequence. In various examples the motion field may represented by its coefficients in a linear basis, for example a wavelet basis, and an optimization may be carried out to minimize the cost of encoding the motion field and maximize the quality of the reconstructed image while also minimizing the residual error. In various examples the optimized motion field may quantized to enable encoding.

Abstract: Path-decomposed trie data structures are described, for example, for representing sets of strings in a succinct manner whilst still enabling fast operations on the string sets such as string retrieval or looking up a string with a specified identifier. A path-decomposed trie is a trie (tree data structure for storing a set of strings) where each node in the path decomposed trie represents a path in the trie. In various embodiments a path-decomposed trie data structure is represented succinctly by interleaving node labels and node degrees in an array and optionally by compressing the node labels using a static dictionary. Node labels may be string characters and a node degree may be a number of children of a node. In some embodiments a path-decomposed hollow trie data structure is used to provide a hash function for string sets.

Abstract: Systems and methods for presenting news information and personalizing presentation of news information are disclosed. Users are presented with a selectable, visual representation of the news information. Users can access additional news information and/or a personalized newspaper by selecting a visual representation of the news information. Systems and methods for monitoring user selection and modifying the personalized newspaper are also disclosed.