A finite switchboard state machine is a specialized finite state machine. It is built by binding the concepts of switching state machines and commutative state machines. The main purpose of this paper is to give a specific algorithm for fuzzy finite switchboard state machine and also, investigates the concepts of switching relation, covering, restricted cascade products and wreath products of f...

This paper examines techniques that allow a well-trained source system built on one task to be rapidly adapted, or ported, to another target task. The two tasks considered in this paper are Hub5, or Switchboard, as the source system and VoiceMail as the target task. The two tasks are acoustically similar, both being telephonebandwidth speech tasks, but differ in speaking style. SwitchBoard is c...

Junction is an application-level communication protocol and library designed for writing mobile applications for ad hoc groups without centralized application servers. We propose that applications be built using a generic switchboard service for communication. Each dynamic instance can designate a unique switchboard, hosted by a peer or by a third-party, for the session. Our convention of namin...

Disfluencies (“um,” repeats, self-repairs) are prevalent in spontaneous speech, and are relevant to both human speech communication and speech processing by machine. Although disfluencies have commonly been viewed as ‘noisy’ events, results from a large descriptive study indicate that disfluencies show regularities in a number of dimensions [9]. This paper reports selected results on Switchboar...

The SWITCHBOARD (SWB) corpus is one of the most important benchmarks for recognition tasks involving large vocabulary conversational speech (LVCSR). The high error rates on SWB are largely attributable to an acoustic model mismatch, the high frequency of poorly articulated monosyllabic words, and large variations in pronunciations. It is imperative to improve the quality of segmentations and tr...