Abstract: By way of example only, in various embodiments, the present system and system is designed to reduce the size of data on a computer through compression, to improve hash, message digest, and checksum technology and their application to information and data storage, to improve uniqueness by using mutual exclusion in hash and checksum tests, to improve checksum tests providing better computer security, to create an XML compression format and to move binary compression formats to XML or other markup language, to utilize variable length hashes and message digests, and to create an XML based checksum that can be used to verify the integrity of files.

Abstract: Disclosed herein are systems and methods for linking items into common matters. Some embodiments of the systems and/or methods may retrieve an electronic document from a source, determine whether the electronic document is associated with a predetermined first matter, and in response to determining that the electronic document is associated with the predetermined first matter, link the electronic document to the predetermined first matter. Similarly, in some embodiments, the systems and methods may further create a second matter and may link the electronic document to the second matter, such that accessing the electronic document can provide other documents linked to the second matter, receive a request for the electronic document, and in response to receiving the request for the electronic document, provide a user option to provide access to the other documents linked to the predetermined first matter.

Abstract: Systems and methods for providing a validation tool may be configured to identify a plurality of words within a document, the document being provided in a first window within a user interface. Additionally, the systems and methods may be configured to determine, from a predetermined list that includes terms of interest, whether the words are matching words with terms of interest. The systems and methods may, in response to determining that the plurality of words are matching words with the terms of interest, highlight matching words in a document and access pieces of related data for matching words.

Abstract: A visualization-based interactive legal research tool that generates from a multi-dimensional citation network a semantics-constrained citation sub-network that focuses on one individual issue in which a user is interested, and puts the sub-network on an interactive user interface (“UT”), which allows the researcher to browse, navigate, and jump over to start new sub-networks on different issues that are relevant to original issues.

Abstract: In one aspect, the invention comprises a computer system for searching databases and displaying search results, comprising databases storing information regarding publications and authors comprising author, title, date of publication, cited references, and citing references data; and Internet servers in communication with those databases; wherein at least one of those Internet servers is in communication with and operable to transmit data to a Web browser resident on a user's computer, and wherein the data is sufficient to enable the browser to display a citation overview page comprising: (a) a list of one or more titles of publications or names of authors, and (b) one or more displayed numerals representing how many publications in one or more specified categories cite to each of the publications, or, for author names, how many publications in one or more specified categories cite to publications on which those names are listed as authors.

Abstract: A fact extraction tool set (“FEX”) finds and extracts targeted pieces of information from text using linguistic and pattern matching technologies, and in particular, text annotation and fact extraction. Text annotation tools break a text, such as a document, into its base tokens and annotate those tokens or patterns of tokens with orthographic, syntactic, semantic, pragmatic and other attributes. A user-defined “Annotation Configuration” controls which annotation tools are used in a given application. XML is used as the basis for representing the annotated text. A tag uncrossing tool resolves conflicting (crossed) annotation boundaries in an annotated text to produce well-formed XML from the results of the individual annotators. The fact extraction tool is a pattern matching language which is used to write scripts that find and match patterns of attributes that correspond to targeted pieces of information in the text, and extract that information.

Abstract: In one aspect, the invention comprises a computer system for searching databases and displaying search results, comprising databases storing information regarding publications and authors comprising author, title, date of publication, cited references, and citing references data; and Internet servers in communication with those databases; wherein at least one of those Internet servers is in communication with and operable to transmit data to a Web browser resident on a user's computer, and wherein the data is sufficient to enable the browser to display a citation overview page comprising: (a) a list of one or more titles of publications or names of authors, and (b) one or more displayed numerals representing how many publications in one or more specified categories cite to each of the publications, or, for author names, how many publications in one or more specified categories cite to publications on which those names are listed as authors.

Abstract: A method and system for linking documents with multiple topics to related documents employs two distinct processes: a fabrication process to pre-establish candidate target document links within a case law or other document for discrete topics, for example, points of law and landmark cases, that represent related documents that are relevant to one or more headnotes within the case law document; and an on-line process to analyze the search request, the candidate links, and available landmark cases during a retrieval of a document to dynamically select the candidate target document links that are relevant to the point of law of interest to a searcher who retrieved the case law document via a search request.

Abstract: A visualization-based interactive legal research tool that generates from a multi-dimensional citation network a semantics-constrained citation sub-network that focuses on one individual issue in which a user is interested, and puts the sub-network on an interactive user interface (“UI”), which allows the researcher to browse, navigate, and jump over to start new sub-networks on different issues that are relevant to original issues.

Abstract: A computer-automated system and method identify text in a first “citing” court case, near a “citing instance” (in which a second “cited” court case is cited), that indicates the reason(s) for citing (RFC). The automated method of designating text, taken from a set of citing documents, as reasons for citing (RFC) that are associated with respective citing instances of a cited document, has steps including: obtaining contexts of the citing instances in the respective citing documents (each context including text that includes the citing instance and text that is near the citing instance), analyzing the content of the contexts, and selecting (from the citing instances' context) text that constitutes the RFC, based on the analyzed content of the contexts. A related computer-automated system and method selects content words that are highly related to the reasons a particular document is cited, and gives them weights that indicate their relative relevance.

Abstract: A “More Like This Headnote” search relates online headnotes intelligently so that users have the means to retrieve related headnotes quickly and easily. This is achieved by using a tailored search type in the search engine, which is designed to handle the text of a headnote as a search string. Retrieval logic then presents the search results to the user in a “Virtual Digest” view comprising related headnotes and case materials, sorted by user-selected options.

Abstract: A relationship management system uses a database to store contact information related to a number of contacts and to store a number of folders, each of which reference one or more of the contacts within the database. The relationship management system also stores a set of contact-user pairs defining known relationships between users of the relationship management system and the contacts stored in the database. For each contact-user pair, an opt-in field indicating if the contact-user relationship is to be available for use in determining which users know a specified user is stored. If the opt-in flag is set, information pertaining to the nature of the relationship between the user and the contact, such as a relationship description, an indication of the type or strength of the relationship, etc. is also stored. At any desired time, a user may implement a user-contact reference routine to determine which users know a specified contact.

Abstract: A relationship management system stores multiple versions of contact information for a particular contact by storing the contact information that is available to all of the users of system that know a particular contact in a firm collection and by storing information about the particular contact that is available to a limited number of users that know the particular contact in one or more user collections. When changes are made to the firm collection for a particular contact, which can occur automatically when any user changes the contact file for that contact within his or her user collection, the change is reflected back to each of the users a having contact file for that contact within their user collection. The same change may be automatically made to each of the contact files within the user collections or may be reported to the users and allow the users to accept or reject the same change to the user collections owned by those users.

Abstract: A system and method for multilingual spelling corrections employs a lexicon builder, which uses a metadata build process that extracts all words from the data source, along with their frequencies, to build a lexicon file using the data source with which a user will be working; and a spell checker algorithm, which determines the correct spelling of words used as input for a search of the data source by calculating a score value for words in the lexicon file according to a formula that distinguishes similarity between the input word from the user's search request and words contained in the lexicon file; and then rates the frequency of the input word against the words contained in the lexicon file. When a user inputs a word, words in the lexicon file are scored against the input word to determine a correct spelling or other spelling variant for the user to select.

Abstract: A software utility navigation aid for hierarchical structures such as file managers, taxonomies, or tables of contents that displays a dynamic menu when the mouse cursor is hovered over an activator used to swap the expanded/collapsed state of a node displayed in a hierarchical structure. The menu contains entries that identify in which display level of expansion the node resides based on the structure's fully collapsed condition (from the root node), the number of display levels to which this branch of the hierarchy can be expanded, and the number of nodes that will be exposed when this branch is expanded to each of those levels. Each displayed entry in this menu, positioned both below and above the identified node, can be clicked to cause the hierarchical structure to expand or collapse to that display level.

Abstract: In one aspect, the invention comprises software stored in a computer readable medium, comprising: (a) software for receiving a user-specified file naming convention; (b) software for electronically storing said file naming convention; (c) software for detecting whether a file has been selected for download; and (d) software for displaying a default file name for said file, wherein said default file name is constructed based on said file naming convention.

Abstract: An associative text search and retrieval system uses one or more front end processors to interacting with a network having one or more user terminals connected thereto to allow a user to provide information to the system and receive information from the system. The system also includes storage for a plurality of text documents, and at least one processor, coupled to the front end processors and the document storage. The processor(s) search the text documents according to a search request provided by the user and provide to the front end processor a predetermined number of retrieved documents containing at least one term of the search request. The retrieved documents have higher ranks than documents not provided to the front end processor. The ranks are calculated using a formula that varies according to the square of the frequency in each of the text documents of each of the search terms.

Abstract: An associative text search and retrieval system uses one or more front end processors to interacting with a network having one or more user terminals connected thereto to allow a user to provide information to the system and receive information from the system. The system also includes storage for a plurality of text documents, and at least one processor, coupled to the front end processors and the document storage. The processor(s) search the text documents according to a search request provided by the user and provide to the front end processor a predetermined number of retrieved documents containing at least one term of the search request. The retrieved documents have higher ranks than documents not provided to the front end processor.

Abstract: An associative text search and retrieval system uses one or more front end processors to interacting with a network having one or more user terminals connected thereto to allow a user to provide information to the system and receive information from the system. The system also includes storage for a plurality of text documents, and at least one processor, coupled to the front end processors and the document storage. The processor(s) search the text documents according to a search request provided by the user and provide to the front end processor a predetermined number of retrieved documents containing at least one term of the search request. The retrieved documents have higher ranks than documents not provided to the front end processor. The ranks are calculated using a formula that varies according to the square of the frequency in each of the text documents of each of the search terms.

Abstract: A printer control apparatus includes a modem for receiving text data in the EBCDIC protocol and generic printer control codes from a host data base and a converter for converting the received information to drive a non-standard printer. A preprogrammed EPROM in cooperation with a CPU, converts the EBCDIC protocol language to the ASCII language. An EEPROM is remotely programmed to store printer control codes which are peculiar to the specific printer being supported.