Abstract: Methods, systems, and computer program products for semantic search are provided. Aspects include receiving a query, the query comprising one or more search concepts, determining a semantic type from a plurality of semantic types for each of the one or more search concepts, analyzing the one or more search concepts to determine one or more relationships associated with the one or more search concepts, and determining one or more search results from a corpus based at least in part on the one or more relationships and the one or more search concepts.

Abstract: A pattern validation method can include retrieving a value for a form based input field from a form defined in markup rendered in a content browser. The retrieved value along with a validation pattern for the form based input field can be passed to a validation process disposed within a lightweight validation library coupled to the rendered markup. Subsequently, the retrieved value can be validated in the content browser according to the validation pattern. Notably, each step of retrieving, passing and validating can be repeated for at least one additional value for at least one additional form based input field disposed in the markup rendered in the content browser. In this regard, the retrieving, passing, and validating steps can be performed in a validation shell function disposed in the markup rendered in the content browser.

Abstract: The Binding Mismatch Mapper (BMM) responds to reference lookup errors by searching for the mismatched binding and mapping the reference in an XML file. The Binding Mismatch Mapper (BMM) comprises a URL cache generator (UCG), a lookup error monitor (LEM), a search component (SC), and a mapping component (MC). The UCG stores all URLs accessed by applications on the server in an XML file. The LEM monitors the naming interface for reference lookup errors. When the LEM detects a lookup error, the LEM starts the SC. The SC first searches for previously mapped mismatches for the reference. If the reference is not already mapped, the SC performs a lookup on other contexts listed in the URL cache file. When the SC finds the reference, the MC maps the reference to the proper name space in the mapping cache file. The mapping cache file is in an XML format so that other applications can easily use the data to correct the name space bindings.

Abstract: A system and method for reverse engineering of pattern string validation scripts is presented. A pattern engine receives an input string from a developer or a database, and generates a pattern string based upon the input string and strictness preferences. The strictness preferences identify how much to constrain generated pattern elements that are included in the pattern string. Once the pattern engine generates the pattern string, the pattern engine creates a user-friendly format string that is used by a developer to assess pattern string adjustments. The pattern engine may operate in a single mode or a multi-mode. In a single mode, the pattern engine uses a single input string to generate a pattern string. In a multi-mode, the pattern engine uses multiple input strings, typically from a database, to generate a pattern string.

Abstract: A pattern validation method can include retrieving a value for a form based input field from a form defined in markup rendered in a content browser. The retrieved value along with a validation pattern for the form based input field can be passed to a validation process disposed within a lightweight validation library coupled to the rendered markup. Subsequently, the retrieved value can be validated in the content browser according to the validation pattern. Notably, each step of retrieving, passing and validating can be repeated for at least one additional value for at least one additional form based input field disposed in the markup rendered in the content browser. In this regard, the retrieving, passing, and validating steps can be performed in a validation shell function disposed in the markup rendered in the content browser.

Abstract: Under the present invention user data corresponding to a user requiring an electronic address, and a sequence of address generation scripts is provided. An electronic address is generated according to the user data and the first address generation script in the sequence. After generation, the electronic address is tested for validity. Specifically, it is determined whether the electronic address is both unique, and complies with a predetermined addressing standard (e.g., RFC 2822). If the electronic address is valid, it is assigned to the user. However, if the electronic address is not valid, a new electronic address is generated according to the next address generation script in the sequence. The new address is then tested for validity. This process continues until a valid electronic address is generated, or all of the address generation scripts in the sequence have been exhausted.