Abstract: A real-time interactive document summarization system which allows the user to continuously control the amount of detail to be included in a document summary.

Abstract: A real-time interactive document summarization system which allows the user to continuously control the amount of detail to be included in a document summary.

Abstract: A distributed network search mechanism may be provided for consumers coupled to a network to search information providers coupled to the network. Consumers may make search requests according to a query routing protocol. A network hub may be configured to receive search requests from consumers. The hub may also receive registration requests from information providers according to the query routing protocol. Information providers register with the hub to indicate search queries in which they are interested in receiving. When a query request is received, the hub resolves the query request with a provider registration index. The hub matches search query information from the query request with provider registrations to determine which providers have registered to receive search queries like the current search query. The hub then routes the search query to matching providers according to the query routing protocol.

Abstract: A system and method for providing a distributed search mechanism in a network. Network nodes operating as consumer or requesting nodes generate the search requests. Nodes operating as hubs are configured to route the search requests in the network. Individual nodes operating as provider nodes receive the search request and in response may generate results according to their own procedures and return them. Communication between nodes in the network may use a common query protocol. Hub nodes may resolve the search requests to a subset of the provider nodes in the network, for example by matching search requests with registration information from nodes. Provider nodes results may be may customize at various stages.

Abstract: Systems and methods for resolving search queries to information providers in a distributing search network. In a network including nodes generating search requests and nodes providing information, a node may operate as hub to route search requests from requesting nodes to provider nodes. Providers may register with a network hub. Registration information may include address information and data indicating the queries or type of queries for which that provider may have relevant data. A hub may resolve search queries against provider registrations to determine a set of providers to which to route each search query. Several systems and methods of selecting some of the providers are described, including the use of bidding, ranking, and statistical data.

Abstract: A system and method for distributing search requests in a network. The system and method may also route search responses. Network nodes operating as consumer or requesting nodes generate the search requests. Nodes operating as hubs are configured to route the search requests in the network. Individual nodes operating as provider nodes receive the search request and in response may generate search results according to their own procedures and return them. Communication between nodes in the network may use a common query protocol. Hub nodes may resolve the search requests to a subset of the provider nodes in the network, for example by matching search requests with registration information from nodes. Search results may be customized at various stages in the network.

Abstract: A distributed network search mechanism may be provided for consumers coupled to a network to search information providers coupled to the network. Consumers may make search requests according to a query routing protocol. A network hub may be configured to receive search requests from consumers. The hub may also receive registration requests from information providers according to the query routing protocol. Information providers register with the hub to indicate search queries in which they are interested in receiving. When a query request is received, the hub resolves the query request with a provider registration index. The hub matches search query information from the query request with provider registrations to determine which providers have registered to receive search queries like the current search query. The hub then routes the search query to matching providers according to the query routing protocol.

Abstract: A system and method for distributing search requests in a network. The system and method may also route search responses. Network nodes operating as consumer or requesting nodes generate the search requests. Nodes operating as hubs are configured to route the search requests in the network. Individual nodes operating as provider nodes receive the search request and in response may generate search results according to their own procedures and return them. Communication between nodes in the network may use a common query protocol. Hub nodes may resolve the search requests to a subset of the provider nodes in the network, for example by matching search requests with registration information from nodes. Search results may be customized at various stages in the network.

Abstract: A system and method for providing a distributed search mechanism in a network. Network nodes operating as consumer or requesting nodes generate the search requests. Nodes operating as hubs are configured to route the search requests in the network. Individual nodes operating as provider nodes receive the search request and in response may generate results according to their own procedures and return them. Communication between nodes in the network may use a common query protocol. Hub nodes may resolve the search requests to a subset of the provider nodes in the network, for example by matching search requests with registration information from nodes. Provider nodes results may be may customize at various stages.

Abstract: Systems and methods for resolving search queries to information providers in a distributing search network. In a network including nodes generating search requests and nodes providing information, a node may operate as hub to route search requests from requesting nodes to provider nodes. Providers may register with a network hub. Registration information may include address information and data indicating they queries or type of queries for which that provider may have relevant data. A hub may resolve search queries against provider registrations to determine a set of providers to which to route each search query. Several systems and methods of selecting some of the providers are described, including the use of bidding, ranking, and statistical data.

Abstract: A computer system user interface provides a document summary which allows the user to more easily identify the contents and subject matter of the document.

Abstract: A computer system user interface provides a document summary which allows the user to more easily identify the contents and subject matter of the document.

Abstract: A method and system for retrieving information in response to a query by a user. The method includes the steps of receiving a signal s having a value corresponding to a relevance-ranking algorithm score of a retrieved document, receiving a signal q having a value corresponding to the number of words in the query and a signal v having a value corresponding to the coordination level of the retrieved document and query (i.e., the degree of overlap between the document terms and the query terms), and generating an adjusted score s1 dependent on the signal s, the signal q and the signal v. The adjusted score s1 takes the coordination level into account for small values of q and gradually decreases the importance of the coordination level as q increases. The system of this invention includes a computer-based system for carrying out the method of this invention.

Abstract: A real-time interactive document summarization system which allows the user to continuously control the amount of detail to be included in a document summary.

Abstract: A computer system user interface provides a document summary which allows the user to more easily identify the contents and subject matter of the document.

Abstract: The present invention solves a number of problems in using stems (canonical indicators of word meanings) in full-text retrieval of natural language documents, and thus permits recall to be improved without sacrificing precision. It uses various arrangements of finite-state transducers to accurately encode a number of desirable ways of mapping back and forth between words and stems, taking into account both systematic aspects of a language's morphological rule system and also the word-by-word irregularities that also occur. The techniques described apply generally across the languages of the world and are not just limited to simple suffixing languages like English. Although the resulting transducers can have many states and transitions or arcs, they can be compacted by finite-state compression algorithms so that they can be used effectively in resource-limited applications.

Abstract: Arbitrarily large document collections are processed by expanding a focus set having at least one initial metadocument into a plurality of subsequent metadocuments. The number of subsequent metadocuments is approximately equal to a predetermined maximum number. The subsequent metadocuments are then clustered into a predetermined number of new metadocuments, which are summarized and presented to a user. The focus set is redefined to include only user-selected new metadocuments.

Abstract: Scatter-Gather is a computer based document browsing method which operates in time proportional to a number of documents in a target corpus. The Scatter-Gather method includes: preparing an initial ordering of the corpus using, for example, an off-line computational method; determining a summary of the initial ordering of the corpus for interactive utility; and providing a further ordering of the corpus using, for example, an on-line non-deterministic method. The step of an off-line preparation of an initial ordering of a corpus is non-time-dependent, thus an accurate initial ordering is prepared. The step of determining a summary includes determining a summary for presentation to a user without scrolling on a CRT. The step of providing a further ordering includes truncated group average agglomerate clustering, merging disjointed document sets, center finding, assign-to-nearest and other refinement methods.

Abstract: A method and apparatus for processing a document image, using a programmed general or special purpose computer, includes forming the image into image units, and at least one image unit classifier of at least one of the image units is determined, without decoding the content of the at least one of the image units. The classifier of the at least one of the image units is then compared with a classifier of another image unit. The classifier may be image unit length, width, location in the document, font, typeface, cross-section, the number of ascenders, the number of descenders, the average pixel density, the length of the top line contour, the length of the base contour, the location of image units with respect to neighboring image units, vertical position, horizontal inter-image unit spacing, and so forth. The classifier comparison can be a comparison with classifiers of image units of words in a reference table, or with classifiers of other image units in the document.

Abstract: A summary is automatically formed by selecting regions of a document. Each selected region includes at least two members of a seed list. The seed list is formed from a predetermined number of the most frequently occurring complex expressions in the document that are not on a stop list. If the summary is too long, the region-selection process is performed on the summary to produce a shorter summary. This region-selection process is repeated until a summary is produced having a desired length. Each time the region selection process is repeated, the seed list members are added to the stop list and the complexity level used to identify frequently occurring expressions is reduced.