No abstract

An early release software product for the rapid development of spoken dialog systems (SDS's), known as Lyrebird TM [1][2] [3], will be demonstrated that makes use of grammatical inference to build natural language, mixed initiative, speech recognition applications.The demonstration will consist of the presenter developing a spoken dialog system using Lyrebird TM , and will include a demonstration of some features that are still in the prototype phase.Using Lyrebird TM , developers build a spoken dialog system with the following steps: 1. Firstly the dialog is specified. This is typically developed using a drag and drop GUI that defines a computer directed menu driven application (See Figure. 1). Alternatively a wizard can be used whereby the developer defines the application in terms of slots that need to be filled. 2. The dialog description is then generalised to include mixed initiative input.Starting grammars are automatically created that cover computer directed input. 3. The developer is then prompted for text describing selected phrases that a speaker would use when interacting with the developed SDS (See Figure 2.) Mixed-initiative natural-language grammars suitable for use with a speechrecognition system are then inferred, using grammatical inference.If desired, the developer can subsequently improve the system under development, using a range of interfaces. For instance:1. The developer can teach Lyrebird how the speaker will behave using a tool known as the simulator. The simulator enables the user to interact with the application under development using text. (See Figure 3.) Out of grammar phrases are tagged using either robust parsing, or manual input from the developer. 2. The developer can teach Lyrebird how the system should behave using a tool known as the scenario editor (See Figure 4.) Using the scenario editor sample interactions are presented to the developer in a text format similar to that used

No abstract

Vautherin's results relating the behaviour of classes of coloured (high-level) Petri nets t o ordinary Petri nets (skeletons for the classes are examined, and theirThe feasibility of using skeletons for the purpose of Y r s t estimate' verifications of nets (in particular, for the early detection of deadlocks, i.e. reachable dead is considered. It is found that because th.e relations marking? ip established b y Vautherin bet,weelz the dead markings of a coloured net and those of the corresponding skeleton does not differentiate between reach,-able and unreachable markings, deadlock-freeness of a coloured net and deadlock-freeness of its skeletons are essentially independent properties. usefulness and ease of app / ication are investigated.