Patent application number | Description | Published |
20120005202 | Method for Acceleration of Legacy to Service Oriented (L2SOA) Architecture Renovations - A method, system, and program product are presented for identifying similar functional segments of code to a service oriented architecture transition team. The method, system and program product comprise identifying, by a processor of a computer, a number of functionally equivalent segments in a number of lines of code by analyzing tag files associated with each of a number of functional segments in the number of lines of code. | 01-05-2012 |
20120096375 | SYSTEM FOR ADJUSTING SEARCH LEVEL DETAIL - A method, data processing system, and computer program product for managing search results. The data processing system displays search results in a graphical user interface. The data processing system displays, concurrent with the display of the search results, a moveable graphical control in the graphical user interface. The data processing system changes a level of detail for the search results in response to a user moving the moveable graphical control. | 04-19-2012 |
20120131109 | HIDING EMAIL IDENTIFICATION USING A CONFIGURABLE SET OF DOMAINS - A method of delivering an electronic mail message. A mail server receives and stores a rule from a first user. Thereafter the mail server receives the electronic mail message from a second user comprising a sender. The mail server compares the rule with an email address in a field of the electronic mail message. Responsive to the rule being satisfied the email server takes an action with respect to the email address or the field to form a modified electronic mail message. Thereafter, the email server delivers the modified electronic mail message to a third user comprising a recipient. The first, second, and third users may all be different from each other. | 05-24-2012 |
20120136987 | MANAGING TAG CLOUDS - A method, data processing system, and computer program product for managing tags. A computer system identifies one or more groups of similar tags from a multiplicity of tags proposed for inclusion in a tag cloud. The computer system identifies one or more representative tags to represent the respective one or more groups of similar tags. The computer system displays the one or more representative tags in the tag cloud instead of all the similar tags in the one or more groups of similar tags, and concurrently displays other tags in the multiplicity of tags that are not included in the one or more groups of similar tags. | 05-31-2012 |
20120311048 | INSTANT MESSAGING ASSOCIATION METHOD AND SYSTEM - A messaging method and system. The method includes enabling by a computing apparatus for a user, an instant messaging software application and all associated contacts to communicate with the user via the instant messaging software application. The computing apparatus enables a software application for the user and presents an option for allowing only a first group of contacts of the associated contacts to communicate with said user. The first group of contacts are associated with the software application. In response, the computing apparatus receives a command associated with the option from the user. The computing apparatus performs functions associated with the first command. | 12-06-2012 |
20130110730 | INTEGRATION OF COMPUTERIZED PROJECT PLANNING AND PROJECT DIAGRAMMING | 05-02-2013 |
20130110852 | INTERMEDIATE DATA FORMAT FOR DATABASE POPULATION | 05-02-2013 |
20130297290 | AUTOMATIC ACCURACY ESTIMATION FOR AUDIO TRANSCRIPTIONS - Embodiments of the present invention provide an approach for estimating the accuracy of a transcription of a voice recording. Specifically, in a typical embodiment, each word of a transcription of a voice recording is checked against a customer-specific dictionary and/or a common language dictionary. The number of words not found in either dictionary is determined. An accuracy number for the transcription is calculated from the number of said words not found and the total number of words in the transcription. | 11-07-2013 |
20130297291 | CONFIDENCE LEVEL ASSIGNMENT TO INFORMATION FROM AUDIO TRANSCRIPTIONS - Embodiments of the present invention provide an approach for automatically assigning a confidence level to information extracted from a transcription of a voice recording. Specifically, in a typical embodiment, an axiom is extracted from a source associated with the text of the transcription. A confidence level of the source is determined. A confidence level is assigned to the axiom based on the confidence level of the source. | 11-07-2013 |
20130332145 | ONTOLOGY DRIVEN DICTIONARY GENERATION AND AMBIGUITY RESOLUTION FOR NATURAL LANGUAGE PROCESSING - A computer implemented method and system for natural language processing ambiguity resolution includes storing an ontology specifying a set of grammatical rules. A phrase comprising at least one current word to be processed is retrieved. A current word from the phrase is annotated with possible ontological classes according to the ontology. Any ontological rules associated with the possible ontological classes are retrieved. Ontological classes are eliminated based on the ontological rules. A surviving possible ontological class is determined to be an accurate ontological class for the current word. In another aspect of this disclosure, an ontology is stored in computer memory, the ontology having multiple ontological classifications, and word instances, each word instance associated with at least one of the ontological classifications. All word instances belonging to the selected ontological classification are retrieved. | 12-12-2013 |
20140059011 | AUTOMATED DATA CURATION FOR LISTS - A processor-implemented method, system, and/or computer program product identifies errant data in an initial data list. An initial data list is composed of multiple data entries, where each of the data entries is associated with a parent hypernym from a group of multiple parent hypernyms. The parent hypernym describes a common attribute of data entries in the initial data list that have a same parent hypernym. A plurality parent hypernym is identified as a parent hypernym that is common to more data entries in the initial data list than any other parent hypernym. Any datum entry in the initial data list that is not associated with the plurality parent hypernym is then flagged for eviction from the initial data list. | 02-27-2014 |
20140101061 | CORRELATING SOFTWARE LICENSES TO SOFTWARE INSTALLATIONS - Embodiments of the present invention provide a system, method, and program product to correlate a plurality of software licenses for a computer program to a plurality of installations of a computer program, two or more of the plurality of software licenses licensing respective sets of program components of the computer program that differ from each other, and two or more of the plurality of installations having respective sets of program components of the computer program that differ from each other. The computer determines an amount of match between each of the plurality of installations having the respective sets of program components of the computer program, and each of the plurality of software licenses licensing the respective sets of program components of the computer program, and the computer identifies the match amount having the greatest amount of match. | 04-10-2014 |
20140122514 | CATEGORY-BASED LEMMATIZING OF A PHRASE IN A DOCUMENT - A processor-implemented method, system, and/or computer program product lemmatizes a phrase for a specific category. An initial phrase, which is associated with a specific category, is received by a processor. The processor removes a last letter or set of letters from a word in the initial phrase to form an initial truncated version of the phrase, and then runs a term frequency-inverse document frequency (TF-IDF) algorithm on the initial truncated version of the phrase. The processor lemmatizes subsequent truncated versions of the initial phrase, and then runs the TF-IDF algorithm until a highest TF-IDF value is identified for a specific truncated version of the initial phrase when compared to TF-IDF values of other truncated versions of the initial phrase. The specific truncated version of the initial phrase that is associated with the highest TF-IDF value is then associated with the specific category. | 05-01-2014 |
20140196011 | AUTOMATIC REGRESSION TESTING BASED ON CYCLOMATIC COMPLEXITY - A processor-implemented method, system, and/or computer program product automates regression testing based on cyclomatic complexity of changed code. A base code change to a software program is identified as having a particular cyclomatic complexity. Multiple different software test routines are mapped to the base code change. A specific quantity of the different software test routines are then run to test the base code change, where the quantity of test routines that is run is based on the cyclomatic complexity of the base code change. | 07-10-2014 |
20140207779 | MANAGING TAG CLOUDS - A method, data processing system, and computer program product for managing tags. A computer system identifies one or more groups of similar tags from a multiplicity of tags proposed for inclusion in a tag cloud. The computer system identifies one or more representative tags to represent the respective one or more groups of similar tags. The computer system displays the one or more representative tags in the tag cloud instead of all the similar tags in the one or more groups of similar tags, and concurrently displays other tags in the multiplicity of tags that are not included in the one or more groups of similar tags. | 07-24-2014 |
20140258314 | CACHING OF DEEP STRUCTURES FOR EFFICIENT PARSING - A parsing method and system. The method includes generating an n-gram model of a domain and computing a tf-idf frequency associated with n-grams of the n-gram model. A list including a frequently occurring group of n-grams based on the tf-idf frequency is generated. The frequently occurring group of n-grams is transmitted to a deep parser component and a deep parse output from the deep parser component is generated. The deep parse output is stored within a cache and a processor verifies if a specified text word sequence of the deep parse output is available in the cache. | 09-11-2014 |
20140280008 | Axiomatic Approach for Entity Attribution in Unstructured Data - The present specification relates to Ontology modeling, and, more specifically, to systems and methods for populating a triple store (RDF Graph) data structure from a parse tree diagram and producing a measurable increased degree of confidence in the reliability of the inferences based on the matched axioms derived from the ontology model. The steps of populating and producing can be performed automatically. | 09-18-2014 |
20140289173 | AUTOMATICALLY GENERATING AN ONTOLOGY AND AXIOMS FROM A BUSINESS-PROCESS MODEL - A method and associated systems for automatically generating an ontology and a set of axioms from a business-process model that represents the operations of a business. This ontology and set of axioms may be used to create the knowledgebase of an artificially intelligent expert system that emulates the business operations. A processor parses a representation of business processes stored in the business-process model, deriving a set of axioms and a set of entity classes from the parsed data. The processor uses these axioms and classes to identify concept nodes and process nodes, which it organizes into the ontology of the knowledgebase. The processor further identifies information derived from the parsed data to create a set of triple data items, each of which represents the information represented by one or more of the derived axioms. These triples are stored in the knowledgebase as a triple store data structure. | 09-25-2014 |
20140309984 | GENERATING A REGULAR EXPRESSION FOR ENTITY EXTRACTION - 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. | 10-16-2014 |
20140309985 | 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. | 10-16-2014 |
20140337383 | PARTIAL MATCH DERIVATION USING TEXT ANALYSIS - A natural language processing system and method resolves partial matches when a natural language input query does not fully specify an entity. The input query is tokenized into a set of query tokens, which are compared to contents of a searchable index, the contents representing entities, each of which is tokenized into a set of entity tokens associated with the tokenized entity. A plurality of partial match query tokens are identified from the set of query tokens, each partial match query token matching at least one entity token in the index. The entity(s) corresponding to each partial match query token are selected if a sequential break exists in the input query between the partial match query tokens and there is no intersection between the entity(s) corresponding to each partial match query token. | 11-13-2014 |
20140372630 | SERVICE ORIENTED ARCHITECTURE SERVICE DEPENDENCY DETERMINATION - Service dependency is determined for services in a service oriented architecture (SOA) environment. The steps in determining service dependency include: recording a first triple describing a first service call where the first service calls the second service, and determining the first service is dependent upon the second service based, at least in part, upon the first triple. The recording action is performed dynamically, the recording occurring when the first service call is made. Other related steps include recording the first triple to a timestamp indicating when the first service call is made. | 12-18-2014 |
20150032609 | CORRELATION OF DATA SETS USING DETERMINED DATA TYPES - A computer receives a data set and determines the data type of the column data within. The computer identifies a second data set with columns of the same data type. The computer compares the contents of the columns and the formatting of the contents to determine a score representative of the relevancy of the data sets to one another. Responsive to the score exceeding a threshold, the computer suggests the second data set to a user. | 01-29-2015 |
20150088484 | DOMAIN SPECIFIC SALIENT POINT TRANSLATION - A computer generates a target language text phrase from a source language text phrase. The computer receives a text phrase in a source language. The computer then determines one or more salient points of the received source language text phrase. The computer determines one or more salient points in a target language that correspond to the one or more source language salient points. The computer then generates a target language text phrase based on the one or more salient points in the target language. | 03-26-2015 |
20150088598 | CROSS-RETAIL MARKETING BASED ON ANALYTICS OF MULTICHANNEL CLICKSTREAM DATA - A method and associated system of cross-retail marketing based on analysis of multichannel clickstream data that comprises a client application capturing, aggregating, and analyzing multiple clickstreams of a user. These clickstreams may be captured from multiple unrelated or competing sales or distribution channels and from multiple electronic platforms. The analysis may use methods of artificial intelligence, text analytics, semantic analytics, or other analytical methods to infer characteristics of the user, of the user's online commercial behavior and other commercial activities, and of products or services that the user may be interested in purchasing. The output of this analysis is forwarded to other channels or platforms visited by the user in order to allow those other channels or platforms to perform targeted commercial marketing functions related to the user's prior activities. In preferred embodiments, this method may be require an active consent or other authorization from the user. | 03-26-2015 |
20150089494 | VIRTUAL MACHINE TEMPLATE OPTIMIZATION - In an approach for optimizing a virtual machine (VM) operating system (OS) template, one or more processors obtain a list of packages in an existing VM template. The processors obtain a list of packages required to be included in the existing VM template. The processors determine differences between the list of packages in the existing VM template and the list of packages required to be included in the existing VM template. The processors update the existing VM template based on the determined differences between the list of packages in the existing VM template and the list of packages required to be included in the existing VM template. | 03-26-2015 |