We address the problem of unsupervised and language-pair independent alignment of symmetrical and asymmetrical parallel corpora. Asymmetrical parallel corpora contain a large proportion of 1-to-0/0-to-1 and 1-to-many/many-to-1 sentence correspondences. We have developed a novel approach which is fast and allows us to achieve high accuracy in terms of F1 for the alignment of both asymmetrical an...

let $g$ be a finite group‎. ‎a subgroup‎ ‎$h$ of $g$ is called an $mathcal h $ -subgroup in‎ ‎$g$ if $n_g (h)cap h^gleq h$ for all $gin‎ ‎g$. a subgroup $h$ of $g$ is called a weakly‎ $mathcal h^ast $-subgroup in $g$ if there exists a‎ ‎subgroup $k$ of $g$ such that $g=hk$ and $hcap‎ ‎k$ is an $mathcal h$-subgroup in $g$. we‎ ‎investigate the structure of the finite group $g$ under the‎ ‎assump...

In this paper we enumerate fuzzy subgroups, up to a natural equivalence, of some finite abelian p-groups of rank two where p is any prime number. After obtaining the number of maximal chains of subgroups, we count fuzzy subgroups using inductive arguments. The number of such fuzzy subgroups forms a polynomial in p with pleasing combinatorial coefficients. By exploiting the order, we label the s...

In this paper we provide explicit formulas for the number of elements/subgroups/cyclic subgroups of a given order and for the total number of subgroups/cyclic subgroups in a finite Hamiltonian group. The coverings with three proper subgroups and the principal series of such a group are also counted. Finally, we give a complete description of the lattice of characteristic subgroups of a finite H...