Abstract: A two-stage, very fast symbol string matching mechanism measures the similarity of content between data sources, allowing for efficient detection and evaluation of exact as well as inexact matches. The disclosed approach pairs complementary encoding technique comprising a first fast lookup that identifies regions of possible similarity, and a second, more computationally intensive analysis that evaluates metrics of similarity and delimits copy boundaries. The original content remains private (encrypted) during processing.

Abstract: A two-stage, very fast symbol string matching mechanism measures the similarity of content between data sources, allowing for efficient detection and evaluation of exact as well as inexact matches. The disclosed approach pairs complementary encoding technique comprising a first fast lookup that identifies regions of possible similarity, and a second, more computationally intensive analysis that evaluates metrics of similarity and delimits copy boundaries. The original content remains private (encrypted) during processing.

Abstract: A two-stage, very fast symbol string matching mechanism measures the similarity of content between data sources, allowing for efficient detection and evaluation of exact as well as inexact matches. The disclosed approach pairs complementary encoding technique comprising a first fast lookup that identifies regions of possible similarity, and a second, more computationally intensive analysis that evaluates metrics of similarity and delimits copy boundaries. The original content remains private (encrypted) during processing.

Abstract: A two-stage, very fast symbol string matching mechanism measures the similarity of content between data sources, allowing for efficient detection and evaluation of exact as well as inexact matches. The disclosed approach pairs complementary encoding technique comprising a first fast lookup that identifies regions of possible similarity, and a second, more computationally intensive analysis that evaluates metrics of similarity and delimits copy boundaries. The original content remains private (encrypted) during processing.

Abstract: In one embodiment, a new method enables an individual to selectively preserve the integrity of potentially private data such as identity, current location and the like while using a mobile communications device (e.g., a cell phone) for media access. In one embodiment, the method receives a request for media content from the user in the form of a verbal command. The method then determines whether execution of the command would require the revelation of any potentially private user information. If execution would require such a revelation, the method prompts the user to either permit revelation of the information or to reformulate the request in a way that would not require the information to be revealed. Once data integrity has been resolved, the method searches for and retrieves the requested content.

Abstract: In one embodiment, a new method enables an individual to selectively preserve the integrity of potentially private data such as identity, current location and the like while using a mobile communications device (e.g., a cell phone) for media access. In one embodiment, the method receives a request for media content from the user in the form of a verbal command. The method then determines whether execution of the command would require the revelation of any potentially private user information. If execution would require such a revelation, the method prompts the user to either permit revelation of the information or to reformulate the request in a way that would not require the information to be revealed. Once data integrity has been resolved, the method searches for and retrieves the requested content.

Abstract: A natural language information querying system includes an indexing facility configured to automatically generate indices of updated textual sources based on one or more predefined grammars and a database coupled to the indexing facility to store the indices for subsequent searching.