This paper describes TAO, a system for sound synthesis by physical modelling based on a new technique called cellular sound synthesis (CSS). The system provides a general mechanism for constructing an infinite variety of virtual instruments, and does so by providing a virtual acoustic material, elastic in nature, whose physical characteristics can be fine-tuned to produce different timbres. A wide variety of sounds such as plucked, hit, bowed and scraped sounds can be produced, all having natural physical and spacial qualities. Some of the musical and philosophical issues considered to be most important during the design and development of the system are touched upon, and the main features of the system are explained with reference to practical examples. Advantages and disadvantages of the synthesis technique and the prototype system are discussed, together with suggestions for future improvements.

'Organised sound' - the term coined by Edgard Varèse for a new definition of musical constructivism - denotes for our increasingly technologically dominated culture an urge towards the recognition of the human impulse behind the 'system'. Such is the diversity of activity in today's computer music, we need to maintain a balance between technological advances and musically creative and scholarly endeavour, at all levels of an essentially educative process. The model of 'life-long learning' makes a special kind of sense when we can explore our musical creativity in partnership with the computer, a machine now capable of sophisticated response from a humanly embedded intelligence.

We describe new applications of the theory of automata to natural language processing: the representation of very large scale dictionaries and the indexation of natural language texts. They are based on new algorithms that we introduce and describe in detail. In particular, we give pseudocodes for the determinisation of string to string transducers, the deterministic union of p-subsequential string to string transducers, and the indexation by automata. We report on several experiments illustrating the applications.

This paper addresses the problem of distribution of words and phrases in text, a problem of great general interest and of importance for many practical applications. The existing models for word distribution present observed sequences of words in text documents as an outcome of some stochastic processes; the corresponding distributions of numbers of word occurrences in the documents are modelled as mixtures of Poisson distributions whose parameter values are fitted to the data. We pursue a linguistically motivated approach to statistical language modelling and use observable text characteristics as model parameters. Multi-word technical terms, intrinsically content entities, are chosen for experimentation. Their occurrence and the occurrence dynamics are investigated using a 100-million word data collection consisting of a variety of about 13,000 technical documents. The derivation of models describing word distribution in text is based on a linguistic interpretation of the process of text formation, with the probabilities of word occurrence being functions of observable and linguistically meaningful text characteristics. The adequacy of the proposed models for the description of actually observed distributions of words and phrases in text is confirmed experimentally. The paper has two focuses: one is modelling of the distributions of content words and phrases among different documents; and another is word occurrence dynamics within documents and estimation of corresponding probabilities. Accordingly, among the application areas for the new modelling paradigm are information retrieval and speech recognition.

We discuss the random generation of strings using the grammatical formalism AGFL. This formalism consists of context-free grammars extended with a parameter mechanism, where the parameters range over a finite domain. Our approach consists in static analysis of the combinations of parameter values with which derivations can be constructed. After this analysis, generation of sentences can be performed without backtracking.