Abstract: A computer implemented method and system is provided for classifying a document. A classifier is trained using training documents. A list of first words is obtained from the training documents. A prior probability is determined for each class of multiple classes. Conditional probabilities are calculated for the first words for each class. Confidence thresholds are determined. Confidence grades are defined for the classes using the confidence thresholds. A list of second words is obtained from the document. Conditional probabilities for the list of second words are determined from the calculated conditional probabilities for the list of first words. A posterior probability is calculated for each of the classes and compared with the determined confidence thresholds. Each class is assigned to one of the defined confidence grades based on the comparison. The document is assigned to one of the classes based on the posterior probability and the assigned confidence grades.

Abstract: A procurement system permits routine purchases through approved vendors in a catalog as well as off-catalog purchases via the web, the latter using a web access program that captures product information from the web to invoke the approval process normally used for catalog purchases.

Abstract: Disclosed herein is a method of grouping similar supplier names together in a database. The syntactical errors in the supplier names are corrected. The supplier names are grouped after correcting the syntactical errors. The abbreviations in the supplier names are captured. The ordering, pronunciation and stemming errors in the supplier names are corrected. A matching algorithm that matches and compares two supplier names is applied that comprises the steps of grouping supplier names based on first set of characters in the supplier names and calculating a matching score between the two supplier using Levenshtein distance between the two supplier names, along with the supplier names' sound codes obtained from a modified metaphone algorithm, length of each word, position of matching and mismatching characters, and stem of words in the supplier names. The matching scores are compared with set thresholds in order to further group the supplier names into clusters.

Abstract: Disclosed herein is a computer implemented method and system for grouping spend items in a list of said spend items, and for detecting outliers. The spend items entered into the spend database are phonetically sorted and grouped into second level clusters by the spend data clustering engine. In the first level of clustering, first level clusters are created by matching the spend items using generated word tokens and sorted sound codes. The unique spend items, in the list generated after first level clustering, are further matched to create second level clusters. The first level clusters are updated based on the second level of clustering. In order to determine discrepancies in clustering and spend, statistically deviating outliers are detected in each second level cluster. This engine provides clustering at configurable levels of accuracy. The engine's specific combination of word token and sound code matching provides accurate results for spend items.

Abstract: Disclosed herein is a method and system for isolating business logic from system operations by attaching and organizing a set of java interceptor components, using XML configuration and java dynamic proxy functionality, around an existing standard software java business component. The interceptor components are configured by pre-configuring a set of interceptor classes in an XML configuration file. An interceptor framework is provided which configures, initializes and maintains the interceptor classes. A proxy of the business component is created and returned to a calling client program. The interceptor framework parses the XML configuration file for initializing all the interceptor classes. An interceptor chain is created associated with the business component, when the client program invokes the methods on the proxy business component. Each interceptor acts as a proxy to a previous interceptor in the interceptor chain.