Patent classifications
H03M5/00
Detect annotation error by segmenting unannotated document segments into smallest partition
An approach is provided in which a knowledge manager detects an annotation error while attempting to annotate a document and, as such, segments the document into multiple document segments. The knowledge manager then detects another annotation error while attempting to annotate the multiple document segments, resulting in a set of unannotated document segments. In turn, the knowledge manager generates a notification that identifies the set of unannotated document segments.
Systematic tuning of text analytic annotators with specialized information
A data structure is generated containing enumerators for data types of a domain, text forms of the enumerators and context patterns for the text forms. The data structure also includes information extraction rules that are associated with the enumerators. The data structure is updated with additional context patterns and text forms that are identified within a set of documents to which text analytic annotators are to be tuned. The set of documents are analyzed against the updated data structure and additional extraction rules are generated based on the analysis.
Segmenting and interpreting a document, and relocating document fragments to corresponding sections
A system, comprising an input device configured to receive a first item and a second item, and a processor communicably coupled to the input device and configured to determine that the first item is a fragment matching a lexicon, and place the fragment in a section of a document, the section selected based on the matching lexicon, wherein the processor is configured to perform the determination and the placement after it receives the first item but before it receives the second item.
DATA TRANSMITTER
A data transmitter includes an encoder configured to encode first data to be transmitted, in accordance with an encoding rule and a transmitter configured to transmit the encoded first data. The encoder makes a change to the encoding rule, encodes the first data in accordance with the change in the encoding rule, and incorporates second data having content corresponding to the change in the encoding rule, into the first data.
Error detection constants of symbol transition clocking transcoding
Apparatus, systems and methods for error detection in transmissions on a multi-wire interface are disclosed. A method for transmitting data on the multi-wire interface includes transmitting data on a multi-wire interface includes obtaining a plurality of bits to be transmitted over a plurality of connectors, converting the plurality of bits into a sequence of symbols, and transmitting the sequence of symbols on the plurality of connectors. A predetermined number of least significant bits in the plurality of bits may be used for error detection. The predetermined number of least significant bits may have a constant value that is different from each of a plurality of error values. A symbol error affecting one or two symbols in the sequence of symbols may cause a decoded version of the predetermined number of least significant bits to have value that is one of a plurality of error values.
Error detection constants of symbol transition clocking transcoding
Apparatus, systems and methods for error detection in transmissions on a multi-wire interface are disclosed. A method for transmitting data on the multi-wire interface includes transmitting data on a multi-wire interface includes obtaining a plurality of bits to be transmitted over a plurality of connectors, converting the plurality of bits into a sequence of symbols, and transmitting the sequence of symbols on the plurality of connectors. A predetermined number of least significant bits in the plurality of bits may be used for error detection. The predetermined number of least significant bits may have a constant value that is different from each of a plurality of error values. A symbol error affecting one or two symbols in the sequence of symbols may cause a decoded version of the predetermined number of least significant bits to have value that is one of a plurality of error values.
Hybrid comparison for unicode text strings consisting primarily of ASCII characters
Comparing text strings with Unicode encoding includes receiving two text strings S.sub.1 and S.sub.2. The process computes, for the first text string S.sub.1, a first weight according to a weight function that computes an ASCII prefix .sub.A(S.sub.1), computes a Unicode weight suffix .sub.U(S.sub.1), and concatenates the weights to form the first weight (S.sub.1)=.sub.A(S.sub.1)+.sub.U(S.sub.1). Computing the ASCII prefix for the first string applies bitwise operations to n-byte contiguous blocks of the first string to determine whether each block contains only ASCII characters, and replaces accented Unicode characters with equivalent unaccented ASCII characters when comparison is designated as accent-insensitive. When there is a first block containing a non-replaceable non-ASCII character, the Unicode weight suffix is computed by performing a character-by-character Unicode weight lookup beginning with the first block. The same process is applied to the second string. The text string are compared by comparing their computed weights.
Hybrid approach to collating unicode text strings consisting primarily of ASCII characters
Collating text strings having Unicode encoding includes receiving two text strings S=s.sub.1s.sub.2 . . . s.sub.n and T=t.sub.1t.sub.2 . . . t.sub.m. When the two text strings are not identical, there is a smallest positive integer p for which the two text strings differ. The process looks up the characters s.sub.p and t.sub.p in a predefined lookup table. If either of these characters is missing from the lookup table, the collation of the text strings is determined using the standard Unicode comparison of the text strings s.sub.ps.sub.p+1 . . . s.sub.n and t.sub.pt.sub.p+1 . . . t.sub.m. Otherwise, the lookup table assigns weights v.sub.p and w.sub.p for the characters s.sub.p and t.sub.p. When v.sub.pw.sub.p, these weights define the collation order of the strings S and T. When v.sub.p=w.sub.p, the collation of S and T is determined recursively using the suffix strings s.sub.p+1 . . . s.sub.n and t.sub.p+1 . . . t.sub.m.
Managing a display of results of a keyword search on a web page by modifying attributes of a DOM tree structure
An approach is provided for managing a display of a keyword search result. First Document Object Model (DOM) element(s) in a DOM of a web page are identified as specifying first content that is relevant to the keyword. Second DOM element(s) in the DOM are identified as specifying second content that is irrelevant to the keyword. The display of the result of the search is generated to include the first content and paragraph(s) for viewing according to modified first attribute(s). The paragraph(s) had been hidden previously in a prior display of the web page. The display hides from view the second content according to modified second attribute(s).
SYSTEM AND A METHOD FOR A LINE ENCODED DATA STREAM
A system that receives a line encoded data stream from a source. The system has a de-serializer for de-serializing a line encoded data stream to generate a raw parallel data stream. The system has a serializer for serializing the raw parallel data stream. The system has a parallel data generator configured to generate another raw parallel data stream. The system has reconfigurable circuitry for communicating the raw parallel data stream to the serializer in a configuration and communicating the other parallel data stream in another configuration.