Abstract: A computer-implemented method, implemented, at least in part, by hardware in combination with software, the method includes (A) obtaining text from a document; (B) parsing said text using at least one parallel sentence parsing process to obtain sentence data from said text; (C) parsing said sentence data using at least one parallel noun parsing process to obtain text data from said sentence data; (D) scoring said text data using at least one term scorer process and a known word list to obtain scored terms corresponding to said text data; and (E) determining known word scores corresponding to said text data, using said known word list, wherein said known word scores comprise base scores and category penetration scores; wherein steps (B), (C), (D), and (E) operate in parallel for at least some of the text from the document.

Abstract: A device maintains multiple signatures, including at least one signature for each of a plurality of data items. At least corresponding signature for a data item is based at least in part on a given function of at least some of the contents of that data item. The device receives a particular sequence of bits and determines at least one signature for that particular sequence of bits, based at least in part on the given function of at least some of the particular sequence of bits. The device determines, based at least in part on the signature for the particular sequence of bits, and using the multiple signatures, whether the device may access the particular sequence of bits.

Abstract: A first data item is split into one or more parts. A corresponding name is determined for each of the one or more parts, each part name being determined using a message digest function or hash function of all of the data in the corresponding part. A second file is created to include the part names of the one or more parts of the first data item. Each of the one or more parts is caused to be distributed to at least one location in a computer network. In response to a request for the first data item, the second file is provided. The name of the second file may be published as a name for the first data item. The network may be a peer-to-peer network.

Abstract: Access to data items uses names based on the data in the data items; the name of a data item may be based, at least in part, on a function of some or all of the bits that comprise the data item. A data item may comprise an arbitrary sequence of bits. The function may include a hash function or a message digest function. The name of a data item may be compared to a list of names of other data items.

Abstract: A plurality of data items are distributed across a plurality of computers, some of which may form a peer-to-peer network. A first computer receives a request for a data item from a requesting computer. The request includes a True Name of the data item. The first computer causes the requesting computer to obtain the data item from a second computer, distinct from the first computer. The first computer may not have a copy of the requested data item. The first computer may know the location of the data item. The first computer may forward the request for the data item to at least one other computer.