Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for determining word boundary likelihoods in potentially incomplete text. In one aspect, a method includes selecting query sequences from the query, each query sequence being at least a portion of a word n-gram, the word n-gram being a subsequence of up to n words selected from the second sequence of words of the query, and for each query sequence: determining one or more query sequence keys for the query sequence; determining at least one of a word boundary count and a non-word boundary count for each query sequence key, each word-boundary count and non-word boundary count being dependent on the context of the query sequence; and associating, in a data storage device, the at least one word boundary count and non-word boundary counts with each query sequence key.

Abstract: A system and a method of retrieving information is described. In a system according to the invention, software modules may be used to provide the user with information that is most likely to be the information desired.

Abstract: Methods and systems and machine readable media for managing data. In one exemplary embodiment, an initial search query is received and examined to determine whether elements within the initial search query are within the same category of data, and a machine interpreted search query is derived in response to the determining. Other methods and systems and media are also described.

Abstract: Processing switch database operations may include receiving a database selection message from a database client, transmitting an unconditional acknowledgement to the database client in response to the database selection message, accessing a database query from a queue of queries from the a database client where the database query includes a user identifier and a database identifier, determining whether a matching backend database connection exists, and if a matching backend database connection exists, forwarding the database query to the matching backend database connection. In some embodiments, a matching backend database connection may be a backend database connection having a user identifier equivalent to the user identifier of the database query, and a database identifier that is equivalent to the database identifier the database query.

Abstract: Processing repetitive database queries may include receiving a database query having a connection identifier, determining whether a queue for database queries contains an earlier database query matching the received database query, identifying the second database query as matching the first database query if the queue contains an earlier matching database query, receiving query results for the earlier matching database query from a database server, and forwarding query results to the clients associated with both database queries using corresponding connection identifiers.

Abstract: Systems and methods are provided for identifying unsolicited or unwanted electronic communications, such as spam. The disclosed embodiments also encompass systems and methods for selecting content items from a content item database. Consistent with certain embodiments, computer-implemented systems and methods may use a clustering based statistical content matching anti-spam algorithm to identify and filter spam. Such a anti-spam algorithm may be implemented to determine a degree of similarity between an incoming e-mail with a collection of one or more spam e-mails stored in a database. If the degree of similarity exceeds a predetermined threshold, the incoming e-mail may be classified as spam. Further, in accordance with other embodiments, systems and methods may be provided to determine a degree of similarity between a query or search string from a user and content items stored in a database.

Abstract: A method of analyzing customer behavior, where customers are engaged in customer-to-customer transactions in a third-party network, includes a transformation of data representing the customer-to-customer transactions from a data representation to a network representation, and then analyzing the network representation. The network representation includes a set of nodes and a set of links where each node represents a customer and each link represents a transaction between two of the customers.

Abstract: One or more techniques and/or systems are disclosed for matching entity names. A matching analysis is performed between a first entity name (e.g., business entity name) and a second entity name. The matching analysis comprises comparing a first entity category descriptor that has been amended into the first entity name with a second entity category descriptor that has been amended into the second entity name. If a match is identified in the category descriptors, the first and second entity names may comprise the same entity.

Abstract: The present disclosure describes an apparatus and methods for performing data analysis, in particular network analysis. Specifically it provides a framework and user interface whereby raw data may be imported into a data model with entities, attributes, and relationships between the entities and multiple data analysis algorithms may be pipelined into a larger data analysis model and applied to the data model. Offline and online data visualization and data exploration techniques, may be applied to the results of the data analysis enabling real-time and near real-time interactive online analysis. Extensibility models and market transaction models are also provided.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for distributed nearest-neighbor search for image retrieval are disclosed. An example distributed image retrieval system includes a root server and a plurality of leaf servers. The root server controls the clustering of images in the image corpus, and determines the assignment of image clusters to a collection of leaf servers. Each leaf server is independently configured to perform a two-stage nearest-neighbor search in a locality-sensitive hash space for a received query image within the leaf server's assigned images clusters. Thus, the distributed image retrieval system is modular and amendable to tuning, modifications, duplication, and replacement on a per-server basis. In addition, the design of the image retrieval system allows flexible load balancing among the leaf servers.

Abstract: In some embodiments, a media guidance application may automatically generate a media guidance profile. Attributes from the media guidance profile may be compared with attributes from a plurality of partner profiles received from a remote provider. A set of recommended partner profiles may be displayed. In response to a selection of one of the recommended partner profiles, a user may have the opportunity to register with the service provider.

Abstract: An example method for mapping of medical code schemes includes processing a plurality of coded concepts to determine a potential match between a code from a first code scheme in the plurality of coded concepts and a code from a second code scheme in the plurality of coded concepts. The method includes assigning a probability to each potential match of a code from the first code scheme and a code from the second code scheme. The method includes generating an alphanumeric indication of the probability of each potential match between the first code scheme and the second code scheme from the plurality of coded concepts and generating a graphical representation of the plurality of coded concepts. The method includes outputting the alphanumeric indication and the graphical representation to a user and accepting user input to select a match between the first code scheme and the second code scheme.

Abstract: A model for mapping the raw text representation of a text object to a vector space is disclosed. A function is defined for computing a similarity score given two output vectors. A loss function is defined for computing an error based on the similarity scores and the labels of pairs of vectors. The parameters of the model are tuned to minimize the loss function. The label of two vectors indicates a degree of similarity of the objects. The label may be a binary number or a real-valued number. The function for computing similarity scores may be a cosine, Jaccard, or differentiable function. The loss function may compare pairs of vectors to their labels. Each element of the output vector is a linear or non-linear function of the terms of an input vector. The text objects may be different types of documents and two different models may be trained concurrently.

Abstract: A multimedia system configured to receive user input in the form of a spelled character sequence is provided. In one implementation, a spell mode is initiated, and a user spells a character sequence. The multimedia system performs spelling recognition and recognizes a sequence of character representations having a possible ambiguity resulting from any user and/or system errors. The sequence of character representations with the possible ambiguity yields multiple search keys. The multimedia system performs a fuzzy pattern search by scoring each target item from a finite dataset of target items based on the multiple search keys. One or more relevant items are ranked and presented to the user for selection, each relevant item being a target item that exceeds a relevancy threshold. The user selects the indented character sequence from the one or more relevant items.

Abstract: False positive match rates between query content and content in a collection may be reduced with a minimum content region test and/or a minimum features per scale test. The quality of correlations between query descriptors and content descriptors may be improved with a modified sub-region descriptor construction. Content regions associated with detected content features may be partitioned into disjoint sets of sub-regions that cover the content regions, the sub-regions modified so as to at least partially overlap, and descriptor components generated for the modified sub-regions. Matching of feature-sparse content may be improved by adding blurred versions to the collection.

Abstract: In one general aspect, a computer system can include instructions stored on a non-transitory computer-readable storage medium. The computer system can include a upgrade portion identifier configured to identify a plurality of databases of an original system for upgrade, and a parameter module configured to calculate a plurality of parameter values representing aspects of the plurality of databases. The computer system can also include a fuzzy logic module configured to calculate, using fuzzy logic, a relative ranking of each database from the plurality of databases based on the plurality of parameter values, and a selection module configured to select at least a portion of the plurality of databases for upgrade during uptime of the original system based on a limitation of an upgrade resource and the relative ranking of each database from the plurality of databases.

Abstract: Multidimensional search capabilities are enabled on a non-PC (personal computer) device being utilized by a user. An original query submitted by the user via the non-PC device is received. A structured data repository is accessed to extract structured data that is available for the original query, where the extracted structured data represents attributes of the original query. The extracted structured data is provided to the user in the form of a hierarchical menu which allows the user to interactively modify the original query, such modification resulting in a revised query.

Abstract: An input feature vector is computed from an input text record, the input feature vector comprising one or more features, each feature including a subsequence of characters and a frequency of occurrence of the associated subsequence. A input fingerprint is generated out of the input feature vector by choosing one or more features with non-zero frequencies and alphabetizing the features chosen. One or more input indices are generated by alphabetizing features in the input fingerprint and concatenating features occurring in subsequent locations of the input fingerprint. The input text record is matched against a target text record if (1) one or more of the input indices match a target index corresponding to the target text record and (2) the corresponding input fingerprint matches a target fingerprint corresponding to the target text record. The target text record is outputted as a search result if it matches the input text record.

Abstract: In one embodiment, a description of a product design is received. The description is analyzed to determine terms describing the product design. The determined terms are compared to a plurality of stored records. A subset of the stored records is determined based on the comparison. The stored records are considered relevant to the description of the product design. A set of recommended contacts associated with the subset of stored records is then determined. The recommended contacts are considered to have knowledge relevant to the description of the product design. At least one of the subset of stored records and the set of recommended contacts is output. For example, at least one of the subset of stored records and the list of recommended contacts may be displayed on an interface that is being used to input the description of the product design.

Abstract: A method of automatically generating metadata for association with a collection of content items accessible to a system (1) for processing data included in the content items, includes obtaining sets of metadata associated with the content items individually, each set of metadata including at least one attribute value associated with the content item. At least one distribution of values of an attribute over the sets of metadata associated with the respective content items is analyzed. At least one attribute value is selected in dependence on the analysis. The selected attribute value(s) are processed to generate the metadata for association with the collection, and the generated metadata are made available to the system (1) for processing data included in the content items in connection with an identification of the collection of content items.

Abstract: Disclosed is a system for, and method of, determining whether records and entity representations should be linked. The system and method include assigning to each pair of entity references a match value reflecting the likelihood that the entity references are related. Based on the match values, each entity reference may then associated with a preferred entity reference. Pairs of entity references that are mutually preferred may then be identified and linked. The process may be iterated to generate further links.

Abstract: Generating a playlist may include designating a seed track in an audio library; identifying audio tracks in the audio library having constructs that are within a range of a corresponding construct of the seed track, where the constructs for the audio tracks are derived from frequency representations of the audio tracks, and the corresponding construct for the seed track is derived from a frequency representation of the seed track; and generating the playlist using at least some of the audio tracks that were identified.

Abstract: Techniques for sentiment and factor-based analysis in contextually-relevant user-generated data management are described, including evaluating data associated with a review displayed on an interface associated with a computing device, the data being retrieved by a crawler before being displayed on the interface, extracting a keyword from the review, performing an analysis of the review to identify one or more factors, and generating a landing page to aggregate content based on the keyword and the analysis of the one or more factors, and a pointer to the landing page, the pointer being configured to include the keyword and the one or more factors.

Abstract: Systems and methods are disclosed for identifying a new set of media items in response to an input set (or “query set”) of media items and knowledge base metrics. The system uses a knowledge base consisting of a collection of mediasets. Various metrics among media items are considered by analyzing how the media items are grouped to form the mediasets in the knowledge base. Such association or “similarity” metrics are preferably stored in a matrix form that allows the system to efficiently identify a new set of media items that complements the input set of media items.

Abstract: Methods, systems, and computer media implement a statistical spell checker for extracting suggested spell-check candidates for a query containing an unrecognized word. Vocabulary statistics are maintained, including recording a plurality of adjacent word sequences found in a document corpus. When a user query is received that contains a word not in the vocabulary database, i.e., an unrecognized word, the vocabulary statistics are consulted to find word sequences containing the same preceding word and/or succeeding word. The found word sequences may be returned in order based upon the conditional probability that given the recognized preceding and/or succeeding word(s), the unrecognized word is meant to be the suggested spell-checked word.

Abstract: A method of message distribution, the method performed in a computer system having one or more processors accessing one or more databases comprising user account records, the one or more databases being stored in at least one storage device accessible by the one or more processors, the method including receiving a first message from a sender of a first client system, retrieving a first user credential of a first social media user account and a second user credential of a second social media user account stored in the one or more databases, packaging the first message and the first user credential into a first message package and the first message and the second user credential into a second message package, transmitting the first message package to a first social media system, the first social media system automatically distributing the first message to predetermined recipients of the first social media user account, and transmitting the second message package to the first social media system, the first socia

Abstract: Systems, methods and computer-storage media are provided for identifying low-match search queries and determining comparable item matches to suggest to the user in response to a low-match query. “Low-match queries” are queries for which an insufficient number of exact item matches are available. In embodiments, exact and/or comparable item matches may be determined via semantic analysis. Also provided are systems, methods and computer-storage media for informing the user, by way of a presented indicator, or the like, that a presented item was selected for presentation based upon a similarity metric rather than being determined an exact match for the input query.

Abstract: Systems and methods consistent with the invention may include receiving a navigation query including input text, determining, via a processor, whether the input text is satisfies a predetermined criteria, generating a response including data representing a screen associated with the input text when the input text satisfies the predetermined criteria, selecting a language preference when the input text fails to satisfy the predetermined criteria, performing a fuzzy search based on the input text, the language preference, and usage history, and generating a response to the navigation query based on a result of the fuzzy search.

Abstract: The present disclosure relates generally to determining influencers in a Web 2.0 environment. More specifically, in some implementations, an influence of an electronically-accessed content on an involvement between an accessor and a third party is determined. In further implementations, a provider of the electronically accessed content is rewarded based on the assessed influence.

Abstract: Techniques for comparing a first document to one or more second documents are provided. At least one weight is assigned to one or more elements in the first document. A weighted document is generated in accordance with the at least one assigned weight. One or more comparison scores are computed by comparing each of the one or more elements in the first document to each of one or more elements in a given second document in accordance with one or more comparison rules. The one or more comparison rules determine if a given element in the first document and a given element in the given second document are compared using one or more language hierarchies and/or one or more similarity ranges. A similarity score is generated in accordance with the generated weighted document and the one or more computed comparison scores. The one or more second documents are retrieved in accordance with the generated similarity score.

Abstract: Methods and systems for performing a query over joined tables in the context of inexact matching provide efficient search engine functionality. The systems and methods are used to perform an efficient query on a parent table and joined child tables. Search grams are determined based on the query and parent records and child records are scanned for the search grams. Gram scores are computed based on a degree of matching between the parent and child records and the search grams.

Abstract: In accordance with an example embodiment, there is an apparatus that has a headset, a contactless proximity sensor arranged to be supported by the headset in the proximity of a face of a user, and a sensor circuitry configured to cause output of a signal indicative of temporal variations in the distance between the contactless proximity sensor and the face of the user.

Abstract: A content recommendation apparatus and method gives users a peer-to-peer, highly personal way to discover new content by being introduced to one or more similar users. A similar user is a user that has a correlation to another user based on their preferences and behaviors (e.g., downloaded content, frequency of use, content currently have on device, browsing behaviors, content organizational habits, etc.). A catalog of content, or a designated portion thereof, can be used at least in part for finding matches and for identifying content to suggest to another. Data about user behavior can serve to connect the user to similar individuals for the purpose of discovering new content.

Abstract: A system for determining dynamically any given input numeric sequence potential match against all available numeric sequences from a database, whereby the dynamic method reports the match or matches with the highest matching digits. The input numeric sequence(s) and the numeric sequences from databases can be of any length and therefore the input numeric sequence may be different in length to those numeric sequences from databases, yet the method will detect and report those database numeric sequences that provided the highest number of digits matching against any given input numeric sequence.

Abstract: Data searching performed by a server system. A query is received to search data stored in an organizing system in which data has been organized from a highest confidence quality tier to a lowest confidence quality tier. Data of the highest confidence quality tier of the organizing system is searched to satisfy the query, wherein searching the data of the highest confidence quality tier is performed before searching data of a lower confidence quality tier of the organizing system.

Abstract: A computer-implemented method for facilitating placement of health care order entry is provided. The method includes receiving input indicative of a desired healthcare order. The order has certain terms therein that are normalized. The method also finds possible order matches for the normalized terms, and calculates a rough score for the possible order matches. The method refines the rough score with a rough score adjustment, and then ranks the found possible order matches from the most-likely to match the desired order to the least-likely based upon the refined rough score. These possible order matches can then be displayed to the user for selection.

Abstract: The apparatus, methods and systems for a smart address parser (hereinafter, “SAP”) described herein implement a text parser whereby users may enter a text string, such as manually via an input field. The SAP processes the input address string to extract address elements for storage, display, reporting, and/or use in a wide variety of back-end applications. In various embodiments and implementations, the SAP may facilitate: separation and identification of address components regardless of the order in which they are supplied in the input address string; supplementation of missing address information; correction and/or recognition of misspelled terms, abbreviations, alternate names, and/or the like variants of address elements; recognition of unique addresses based on minimal but sufficient input identifiers; and/or the like.

Abstract: Searching electronic items stored in memory may include receiving search query terms, compiling a list of electronic items containing at least one instance of each query term, and sorting the list of electronic items based on one or more criteria. From the sorted list, search results may be determined and displayed.

Abstract: A meta classification section assigns the degree of accuracy capable of identifying an individual to person feature information containing a face, color, shape, etc., and person passage information and stores the metadata of the person feature information and the person passage information for each degree of accuracy, a discrete retrieval section retrieves the person to be retrieved in the high accuracy metadata stored by the meta classification section, a dependence determination section determines a person having a dependence on the person to be retrieved using a plurality of retrieval results hit in the discrete retrieval and the high accuracy metadata, a query generation section regenerates a retrieval key from the identifier of the person having a dependence and the identifier of the person to be retrieved, and a discrete candidate-to-candidate retrieval section retrieves the person corresponding to the regenerated retrieval key in the low accuracy metadata.

Abstract: In an example embodiment, signals are collected from one or more first channels in a communication network. The one or more first channels may include at least one of organic search, paid search, or social media. Based on the collected signals, a recommendation is made with respect to a campaign within a second channel.

Abstract: The technology provides content about a user to a currently executing instance of an application which uses the provided content to personalize and make its processing contextually relevant for a user. When the application instance is launched, a message requesting data related to categories for a user is sent to a context relevant, content aggregation and distribution system. The service executes within a cloud computing system, and provides the application instance with content derived from sources like other applications and data stored on devices the application instance is not or cannot communicate with. The service gathers content from many different types of online resources such as e-mail, social networking sites, websites, and other data accessible over communication networks with different communication protocols.

Abstract: A system and method for receiving an initial search entry to search text data. The text data may be, for example, an N word lattice, transcribed by a text to speech engine. The difference between the initial search entry and one or more entries in the dictionary may be measured. One or more similar entries may be selected from the dictionary that have the smallest measures of difference to the initial search entry. The text data may be searched for the one or more selected similar entries. Each of the searched similar entries found in the text data may be displayed as a search result.

Abstract: Maintaining a plurality of search contexts and selecting one of the search contexts based on graphical properties of a user interface. Each of the search contexts is provided by and corresponds to one of a plurality of executing application programs. Responsive to an event, one of the search contexts is selected. In some embodiments, the search context provided by the application program having a window displayed in the foreground of the user interface is selected. Search results based on the selected search context are obtained and provided to the user.

Abstract: A system for providing answers questions presented in the form of electronic signals representing natural language words conveyed to said system by way of a network connected to a computer. The system includes a plurality of search indexes relating to a field of knowledge each in a specific natural language. A store house of natural words is associated with each one of the search indexes, and in which a list of natural words is maintained in an order reflecting the usage frequency of said words in that list. In addition, a language storehouse of natural words common to each of the search indexes associated each with a specific natural language. The search index includes a list of score ordered keywords, indexed answer items each associated with an internal list of references (ILOR) pointing to it, and a list of ordered numerical references associated with every one of the ordered keywords. Each such reference represents quantitatively an association between the keyword and an indexed answer item.

Abstract: To provide a technique for accurately and efficiently generating Boolean search formulas that serve as a basis of similarity search. A Boolean search formula generation apparatus according to the present invention establishes Boolean search formulas expressed in a standard sum of products form connecting products of search terms by a sum and evaluates the Boolean search formulas based on a recall and a precision. The Boolean search formula generation apparatus repeats connecting the products of the search terms with maximum evaluation values by a sum to establish a Boolean search formula.

Abstract: A terminal to store various types of data in a clipboard allows a user to combine some or all of the various stored data for performing a search. A method includes performing a search using a combination of search keywords stored in a storing unit. The terminal includes: an input unit to receive a region selecting instruction; a storing unit to store data; and a control unit to determine a type of the selected region, to extract a search keyword corresponding to the type of the region, to store the extracted search keyword, and to perform a search using the search keyword. If more than one search keyword is stored in the storing unit, a user may select a combination of search keywords to be used for performing the search, and may set search parameters for the search keywords according to icons in the search keyword list.

Abstract: A data processing system and method are provided to index, search and present information about defined, “fuzzy” concepts across language, chemical and product identity, composition, biological classification and legal reference. The database system and method permits the use of combinations of concepts, such as labeling, health claims and/or nutritional claims, across linguistic, scientific and legal usages. The user is able to search for concepts in a defined way across any language or means of reference. The definition of the concepts used in the database is accepted as a standard by the database system (user(s). Such standardization then permits one user to pass the results of a search to another user with common meaning, and permits value-added services, such as the capability to provide news services about changes in worldwide regulation of goods and services, i.e., changes in information applicable to the concepts of interest to specific users.

Abstract: An aspect of the present invention relates to systems and methods for indexing mobile content, wherein the indexing is based at least in part on compatibility between the content and a mobile communication facility.

Abstract: System deconstruction systems and methods for component substitution. An example method is carried out by program code stored on non-transient computer-readable medium and executed by a processor. The method includes deconstructing a system tree in computer-readable medium, the system tree deconstructing into a plurality of constituent nodes, each node in the system tree representing a characteristic of a component of a system under consideration. The method also includes searching within a band of variability in other trees for similar nodes. The method also includes qualifying the other trees based on a frequency of the similar nodes in the other trees. The method also includes selecting most relevant nodes from the other trees by at least one of: prioritizing the similar nodes, terminating nodes, and searching nodes hierarchically.

Abstract: A system and method for an entropy-based near-match analysis identifies target files that are almost, but not identical, to a reference file. A computing processor computes entropies of the reference and target files, and determines the likeness of the target files to the references file based on the computed entropies. The computing processor determines a near match between the target file and the reference file if the likeness of the two files is within a user-defined tolerance level. According to one embodiment of the invention, the information entropy is a weighted value that takes into account the size of the file.