We propose a novel algorithm to detect disfluency in speech by reformulating the problem as phrase-level statistical machine translation using weighted finite state transducers. We approach the task as translation of noisy speech to clean speech. We simplify our translation framework such that it does not require fertility and alignment models. We tested our model on the Switchboard disfluency-...

This paper presents a method for automatically transforming faithful transcripts or ASR results into clean transcripts for human consumption using a framework we label speaking style transformation (SST). We perform a detailed analysis of the types of corrections performed by human stenographers when creating clean transcripts, and propose a model that is able to handle the majority of the most...

We propose a new approach to the pricing and hedging of contingent claims under transaction costs in a general incomplete market in discrete time. Under the assumptions of a bounded mean-variance tradeoff, substantial risk and a nondegeneracy condition on the conditional variances of asset returns, we prove the existence of a locally risk-minimizing strategy inclusive of transaction costs for e...

introduction: in this paper, a novel complexity measure is proposed to detect dynamical changes in nonlinear systems using ordinal pattern analysis of time series data taken from the system. epilepsy is considered as a dynamical change in nonlinear and complex brain system. the ability of the proposed measure for characterizing the normal and epileptic eeg signals when the signal is short or is...

In this paper, we propose a method for diagnostic test derivation when the system specification and implementation are given in the form of two communicating finite state machines and at most a single component machine can be faulty. The method enables to decide if it is possible to identify the faulty machine in the system, once faults have been detected in a system implementation. If this is ...

In this paper, we define the “correctness” of a state machine based on a discussion of the “result” yielding from its final states. For simplicity, we define a state machine called a “calculating type state machine” that can calculate a simple issue and show some examples of correct calculating type state machines.

In this paper, a system consisting of single multi-state element (MSE) with performance rates and transition intensities presented as fuzzy values is introduced. Due to the lack, inaccuracy or fluctuation of collected data, it is often too difficult to evaluate the performance rates and transition intensities of multi-state element/system with precise value, especially in the continuous degrada...

Dubois. D. , Prade. H. 1980. Fuzzy Sets and Systems. Mathematics in Science and Engineering, Academic Press, New York, 144. Jun. Y. B. , Kavikumar. J. 2011. Bipolar Fuzzy Finite State Machines. Bull. Malays. Sci. Soc. 34 no. 1: 181-188. Kandel. A. , Lee. S. C. Fuzzy Switching and Automata Theory Applications. Edward Arnold Publishers Ltd, London. Lee. K. J. 2000. Bipolar-valued fuzzy sets and t...

Dubois. D. , Prade. H. 1980. Fuzzy Sets and Systems. Mathematics in Science and Engineering, Academic Press, New York, 144. Jun. Y. B. , Kavikumar. J. 2011. Bipolar Fuzzy Finite State Machines. Bull. Malays. Sci. Soc. 34 no. 1: 181-188. Kandel. A. , Lee. S. C. Fuzzy Switching and Automata Theory Applications. Edward Arnold Publishers Ltd, London. Lee. K. J. 2000. Bipolar-valued fuzzy sets and t...