In this work, we try a hybrid methodology for language modeling where both morphological decomposition and factored language modeling (FLM) are exploited to deal with the complex morphology of Arabic language. At the end, we are able to obtain from 3.5% to 7.0% relative reduction in word error rate (WER) with respect to a traditional full-words system, and from 1.0% to 2.0% relative WER reducti...

JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact [email protected].. FLM Publishing Association is collaborating with JSTOR to...

Panagiotis A. Adamidis, Frank Wrona, Uwe Iben, Rolf Rabenseifner and Claus-Dieter Munz High-Performance Computing-Center Stuttgart, Allmandring 30, D-70550 Stuttgart, Germany Robert Bosch GmbH, Dept. FV/FLM, P.O. Box 106050, D-70059 Stuttgart Institute for Aeroand Gasdynamics (IAG), Pfaffenwaldring 21, D-70550 Stuttgart, Germany Published in the proceedings of the Parallel Computing 2003 Confer...

first we show that the cosets of a fuzzy ideal μ in a bck-algebrax form another bck-algebra  x/μ (called the fuzzy quotient bck-algebra of x by μ). also we show thatx/μ is a fuzzy partition of x and we prove several some isomorphism theorems. moreover we prove that if the associated fuzzy similarity relation of a fuzzy partition p of a commutative bck-algebra iscompatible, then p is a fuzzy quo...

In genome-wide association studies (GWAS), efficient incorporation of linkage disequilibria (LD) among densely typed genetic variants into analysis is a critical yet challenging problem. Functional linear models (FLM), which impose smoothing structure on the coefficients correlated covariates, are advantageous in mapping multiple with high LD. Here we propose novel constrained generalized FLM (...

We present some connections between the max-min general fuzzy automaton theory and the hyper structure theory. First, we introduce a hyper BCK-algebra induced by a max-min general fuzzy automaton. Then, we study the properties of this hyper BCK-algebra. Particularly, some theorems and results for hyper BCK-algebra are proved. For example, it is shown that this structure consists of different ty...

First we show that the cosets of a fuzzy ideal μ in a BCK-algebraX form another BCK-algebra  X/μ (called the fuzzy quotient BCK-algebra of X by μ). Also we show thatX/μ is a fuzzy partition of X and we prove several some isomorphism theorems. Moreover we prove that if the associated fuzzy similarity relation of a fuzzy partition P of a commutative BCK-algebra iscompatible, then P is a fuzzy quo...

In this note first we define a BCK‐algebra on the states of a deterministic finite automaton. Then we show that it is a BCK‐algebra with condition (S) and also it is a positive implicative BCK‐algebra. Then we find some quotient BCK‐algebras of it. After that we introduce a hyper BCK‐algebra on the set of all equivalence classes of an equivalence relation on the states of a deterministic finite...

In this paper, we introduce a notion of generalized states from an EQ-algebra E1 to another EQ-algebra E2, which is a generalization of internal states (or state operators) on an EQ-algebra E. Also we give a type of special generalized state from an EQ-algebra E1 to E1, called generalized internal states (or GI-state). Then we give some examples and basic properties of generalized (internal) st...

A C *-algebra A is called an ideal C * -algebra (or equally a dual algebra) if it is an ideal in its bidual A**. M.C.F. Berglund proved that subalgebras and quotients of ideal C*-algebras are also ideal C*-algebras, that a commutative C *-algebra A is an ideal C *-algebra if and only if it is isomorphicto C (Q) for some discrete space ?. We investigate ideal J*-algebras and show that the a...