International Business Machines Corporation

Keyur D Dalal

John Michael Ganci, Jr

James Edward Bostick

Craig M Trim

Rick A Hamilton, Ii

Galina Grunin

Alan W Newman

Kyle Gene Brown

Mark Douglas Weitzel

In an approach for sending a media list to a transportation vehicle for a user, a processor determines a media list for travel for a user, wherein the media list includes at least one media content item, and wherein the media list has associated access credentials that are set by the user. A processor receives a travel reservation for the user, wherein the travel reservation includes, at least, a departure location and a destination location. A processor determines a transportation vehicle associated with the travel reservation. A processor receives the access credentials to the media list. A processor uses the access credentials to access the media list. A processor send the media list to the transportation vehicle, wherein the media list is associated with the user, and wherein the media list is accessible to the user.

Media list for travel

A computer receives a query including a plain text word. The computer determines whether at least one performance optimization parameter is configured. The computer identifies syllables within the plain text word that have a high probability of spelling errors. The computer selects each character in the syllables identified. The computer identifies a group of characters from a confusion matrix that are commonly confused with the character selected. For each character selected, the computer generates a set of characters including characters from the confusion matrix. The computer determines probabilities of omitting the selected characters and associates tags with one or more sets of characters based on the determined probabilities. The computer generates a regular expression by concatenating the sets of characters. The computer searches for a spelling of the plain text word that omits at least one character in the regular expression that is associated with a tag.

Optimizing generation of a regular expression

A computer determines whether performance optimization parameters are configured to optimize performance of generating a regular expression. In response to the computer determining the one or more performance optimization parameters are configured to optimize performance of generating the regular expression, the computer identifies syllables within a plain text word that have a high probability of spelling errors. The computer selects each character in the syllables identified. The computer identifies a group of characters from a confusion matrix that are commonly confused with the character selected. The computer generates a set of characters for each character selected, wherein the set of characters begin with one of the each character selected followed by and ending with the group of characters from the confusion matrix. The computer generates a regular expression by concatenating each of the set of characters.

A computer receives a formatted query having a plain text word. The computer selects each character in the plain text word. The computer identifies a group of characters from a confusion matrix that are commonly confused with the character selected. The computer generates a set of characters for each character selected, wherein the set of characters begin with one of the each character selected followed by and ending with the group of characters from the confusion matrix. The computer generates a regular expression by concatenating each of the set of characters.

Generating a regular expression for entity extraction

Under the present invention, a set of filters (e.g., one or more) is associated with a hierarchical tree, which includes sets of namespace nodes, element nodes and variable nodes. Once the set of filters is associated with the hierarchical tree, a network document is parsed and compared to the hierarchical tree to identify a set of corresponding filters. Each corresponding filter is then evaluated based on the network document to determine which, if any, are 'satisfied.' The network document is then communicated to the user(s) that correspond to the satisfied filter(s).

Growing community of inventors

Johns Creek, GA, United States of America

Keyur D Dalal