International Business Machines Corporation

Dafna Sheinwald

Julian Satran

David Angelo Ferrucci

Eric William Brown

Anthony Tom Levas

Youssef Drissi

Branimir Konstantinov Boguraev

Paul Turquand Keyser

Israel Gold

Shmuel Gal

Michael Edward Factor

Haggai Roitman

David Carmel

Oded Margalit

Ariel Farkash

David Konopnicki

Noam Slonim

Ido Guy

Doron Cohen

Brent Alan Miller

Yosi Mass

Kenneth Nagin

Zvi Yosef Yehudai

Oded Cohn

Ilya Shnayderman

Mila Keren

John Michael Marberg

Michal Shmueli-Scheuer

Ohad Greenshpan

Sivan Yogev

Benjamin Sznajder

Ksenya Kveler

Itai Turbahn

Amir Menczel

Gadi Aleksandrowicz

Julien Satran

Efri Zeidner

Benny Rochberger

John M Marberg

Alan Hartmann

Yona Hollander

A method comprising: operating at least one hardware processor for: receiving, as input, at least one named entity, modifying said named entity based on a plurality of modification rules to generate a set of candidate named entities corresponding to said named entity, and identifying, for at least one candidate named entity in said set of candidate named entities, an article in a knowledge base of articles, wherein a title of said article matches said candidate named entity.

Automated entity disambiguation

A method includes associating, in a graph including graph nodes connected via of edges, a respective node weight with each of the graph nodes, and organizing the graph nodes into ancestor nodes, each of the ancestor nodes having one or more descendent nodes so that the ancestor and the descendent nodes include all the graph nodes. For a given descendent node, a respective path to one or more of the ancestor nodes is identified, each of the respective paths including one or more edges, and a given ancestor node having a shortest of the identified paths is determined. A respective edge weight is assigned to each of the one or more edges in the shortest path, and, for the given descendent node, a node loss value is calculated based on the node weight and the respective edge weight of the each of the one or more edges.

Large taxonomy categorization

A semantic query over a corpus of data is constructed using a graphical user interface to create an aggregation of graphical representations of annotations associated with a plurality of data elements contained within the corpus of data and graphical representations of search terms contained within the plurality of data elements. The aggregation includes at least one annotation and at least one search term. The relative positions of the graphical representations of the annotations and the search terms are manipulated within the aggregation within the graphical user interface to express relationships among the annotations and search terms, yielding a visual spatial representation of the semantic query. The annotations, search terms and expressed relationships define the semantic query that is used to search the corpus of data.

Method and process for semantic or faceted search over unstructured and annotated data

Method, system, and computer program product are provided for scoring of crowd-computing inputs. A group of data is provided to crowd-computing participants and the participants are requested to provide candidate members or the group of data. The computer-implemented method performed includes: receiving an input by a participant, wherein the input is a candidate member; counting multiple inputs of the same candidate member by participants; validating a candidate member; rewarding the participants inputting the candidate member, with a higher reward for participants who input the candidate member earlier than other participants; and supplying the rewards to participants once the candidate member has been validated.

Scoring of crowd-computing inputs

A method and system for searching using contextual data are provided. The method includes receiving one or more areas of data captured by a user from a display, the data including content and context or structure. The method converts the area of captured data to one or more extensible markup language (XML) representations of the content and context or structure. The method provides multiple hierarchical textual instances with formatting (for example, as hypertext markup language instances) corresponding to the XML representations. A query is generated for searching in a search engine for each textual instance. The one or more areas of data captured by a user include an indication of whether the area of data is selected for content, context, or both.

Method and system for searching using contextual data

A computer-implemented method for searching a corpus of documents includes defining a query as a twig including a root annotation operator having an associated tag specifying a span and having an associated expression indicative of one or more terms whose occurrence within the span will satisfy the query. An object is recursively selected from a group of objects that consists of the tag and the expression, and is used in advancing through the corpus until a candidate document is found that contains the tag and satisfies the expression. The candidate document is evaluated to determine whether the one or more terms indicated by the expression occur within the span in the candidate document so as to satisfy the annotation operator.

Object-oriented twig query evaluation

A method for compressing a target string of symbols includes identifying a set of reference strings stored by a computer, and matching a plurality of successive substrings in the target string to respective segments found in one or more of the reference strings. Respective segment specifiers are assigned to the substrings that identify the respective segments to which they are matched, and an ordered list of the specifiers is output.

Compression in the presence of shared data

Apparatus for performing a data transaction, including at least one storage device which is adapted to receive data as a succession of data blocks for storage at respective physical locations therein and control circuitry. The control circuitry is configured to convey the succession of data blocks to the at least one storage device while writing to the at least one storage device, together with at least some of the data blocks, parameters indicative of the identity of the data transaction, the identity of the recorder of the transaction state, and a location of a subsequent data block in the succession. The control circuitry is also configured to transform a state of the data so as to complete (commit or abort) the data transaction using some of the indicative parameters. In the event of a failure of the apparatus before a transaction is completed, i.e., committed or aborted, the apparatus facilitates complete recovery using data stored in the data blocks.

Transaction support on logical disks

Apparatus for electronic data storage, including a non-volatile memory, adapted to receive a succession of data blocks for storage at respective locations therein. The apparatus includes a controller which is configured to convey the succession of data blocks to the non-volatile memory, while writing to the non-volatile memory, together with at least some of the data blocks, a pointer value to the location of a subsequent data block in the succession. The apparatus preferably includes services that are usually performed by higher level file systems, such as allocation and deletion of blocks. Furthermore, the apparatus facilitates stable storage operations so that block contents are maintained intact in case of a write failure.

Enhanced stable disk storage

Data communication system for transmitting data codewords of n bytes length over a communication channel (,) from a transmitter (,) comprising a hardware encoder (,) capable of receiving as input an information sequence of n&minus;2t bytes and emitting as output a codeword of n bytes including n&minus;2t information bytes and 2t redundant bytes to a receiver (,) comprising a hardware decoder (,) capable of detecting up to 2t byte-errors and correcting up to t byte errors; the transmitter (,) further comprising a software encoder (,) transforming, in combination with the hardware encoder (,), an information sequence of n&minus;2s bytes with t<s&lE;2t into a modified sequence, the transmitter (,) emitting encoded codewords including n&minus;2s information bytes and 2s redundant bytes, and the receiver (,) further comprising a software decoder (,) for correcting up to s byte-errors when the hardware decoder (,) has detected errors in the encoded codeword received from the communication channel (20).

Software enhanced error correction mechanism in a data communication system

A method is described for operating a data processing system having a plurality of processors to sort a set of data records each having an associated key for governing the sort process. The method comprises determining a range for the key values by sampling the key values. The range is divided into a plurality of quantiles, one for each processor, each quantile having a respective index. At each processor, a plurality of buckets are defined, each bucket corresponding to a respective one of a plurality M.sub.p of subintervals in the quantile, each subinterval having a respective index. The index of the quantile in which the key value lies and the index of the subinterval in which the key value lies are determined directly from the key values using fast operations. Each key is distributed to the processor corresponding to the quantile in which the key value lies. At each processor, the keys falling in the quantile corresponding to the processor are distributed into the buckets according to the indices of the subintervals in which the key values lie, the buckets being processed in sequence in order to sort the records and the keys in each bucket sorted if the bucket contains more than one key. Finally, the sorted keys from each processor are concatenated.

Data sorting

A computer system such as a mobile client system in which provision is made for management of flash memory. Flash memory management is done using variable block length and supports data compression. Blocks are allocated contiguously in each erase unit and each block starts with a header that contains the length of the block. Blocks are tracked using a single-level virtual address map which resides in random access memory (RAM). The mobile computer system may also include a housing, processor, random access memory, display and an input digitizer such as a touchscreen.

Mobile client computer system with flash memory management utilizing a

A computer implemented method for speeding up the recursive most significant digit radix sorting of a set of record keys in which the keys are scanned for a shared or common prefix, coded according to the point in the key where they differ and the value of the differing digit, and processed such that during each dispersion phase the code words are used to speed processing by avoiding comparison matching of the prefixes, the recursive dispersion and collection phases continuing until singletons are reached. In the absence of shared prefixes the keys are normally recursively radix sorted.

Radix sorting method and means for minimizing movement of elements

Growing community of inventors

Nofit, Israel

Dafna Sheinwald