Abstract: A method of making a flavoured sweetener or food product by incubating an unrefined plant extract containing sucrose as the main solute with a microorganism or microorganisms to form a modified unrefined plant extract; evaporating water from the modified sucrose-based plant extract to form a concentrate; and cooking the concentrate to develop colour and flavour to produce the flavoured sweetener is disclosed. The flavoured sweetener can serve as a coconut sugar substitute. In a preferred embodiment the unrefined plant extract comprises sugarcane juice or sugar beet juice, and the microorganisms may be selected from Stenotrophomonas maltophilia, Bacillus subtilis, Bacillus flexus, or a Klyveromyces species. The flavoured sweetener can be used to make a range of food and beverage ingredients and also food products including sauces, natural flavour extracts and flavour molecules, chocolate, health foods and convenience forms of the various forms of flavoured sweeteners.

Abstract: A method of making a flavoured sweetener or food product by incubating an unrefined plant extract containing sucrose as the main solute with a microorganism or microorganisms to form a modified unrefined plant extract; evaporating water from the modified sucrose-based plant extract to form a concentrate; and cooking the concentrate to develop colour and flavour to produce the flavoured sweetener is disclosed. The flavoured sweetener can serve as a coconut sugar substitute. In a preferred embodiment the unrefined plant extract comprises sugarcane juice or sugar beet juice, and the microorganisms may be selected from Stenotrophomonas maltophilia, Bacillus subtilis, Bacillus flexus, or a Klyveromyces species. The flavoured sweetener can be used to make a range of food and beverage ingredients and also food products including sauces, natural flavour extracts and flavour molecules, chocolate, health foods and convenience forms of the various forms of flavoured sweeteners.

Abstract: An automated name searching system incorporates an automatic name classifier and a multi-path architecture in which different algorithms are applied based on cultural identity of the query name. The name classifier operates with a preemptive list, analysis of morphological elements, length, and linguistic rules. A name regularizer produces a character based computational representation of the name. A pronunciation equivalent representation such as an IPA language representation, and language specific rules to generate name searching keys, are used in a first pass to eliminate database entries which are obviously not matches for the query name. The methods can also be implemented as a callable set of library routines including an intelligent preprocessor and a name evaluator that produces a score comparing a query name and database name, based on a variety of user-adjustable parameters. The user-controlled parameters permit tuning of the search methodologies for specific custom applications.

Abstract: An automated name searching system incorporates an automatic name classifier and a multi-path architecture in which different algorithms are applied based on cultural identity of the query name. The name classifier operates with a preemptive list, analysis of morphological elements, length, and linguistic rules. A name regularizer produces a character based computational representation of the name. A pronunciation equivalent representation such as an IPA language representation, and language specific rules to generate name searching keys, are used in a first pass to eliminate database entries which are obviously not matches for the query name. The methods can also be implemented as a callable set of library routines including an intelligent preprocessor and a name evaluator that produces a score comparing a query name and database name, based on a variety of user-adjustable parameters. The user-controlled parameters permit tuning of the search methodologies for specific custom applications.

Abstract: An automated name searching system incorporates an automatic name classifier and a multi-path architecture in which different algorithms are applied based on cultural identity of the query name. The name classifier operates with a preemptive list, analysis of morphological elements, length, and linguistic rules. A name regularizer produces a character based computational representation of the name. A pronunciation equivalent representation such as an IPA language representation, and language specific rules to generate name searching keys, are used in a first pass to eliminate database entries which are obviously not matches for the query name. The methods can also be implemented as a callable set of library routines including an intelligent preprocessor and a name evaluator that produces a score comparing a query name and database name, based on a variety of user-adjustable parameters. The user-controlled parameters permit tuning of the search methodologies for specific custom applications.

Abstract: A system and method for formulating reasonable spelling variations of name. The system, according to one embodiment, includes a user interface that enables a user to input a name. The system also includes a set of rules (also referred to as “rule set”) and a storage unit that stores a list of names (also referred to as “name database”). The system includes a computer software module (“rules engine”) that implements an algorithm that takes as input the name supplied by the user and the set of rules and, from that input, generates an intermediate representation of the query name, wherein the intermediate representation represents a broad set of possible spelling variations of the name. Next, the system determines the set of names included in the name database that match the intermediate representation. This matching set of names are the names that the system determines to be reasonable spelling variations of the query name.