861 research outputs found

    A Sub-Character Architecture for Korean Language Processing

    Full text link
    We introduce a novel sub-character architecture that exploits a unique compositional structure of the Korean language. Our method decomposes each character into a small set of primitive phonetic units called jamo letters from which character- and word-level representations are induced. The jamo letters divulge syntactic and semantic information that is difficult to access with conventional character-level units. They greatly alleviate the data sparsity problem, reducing the observation space to 1.6% of the original while increasing accuracy in our experiments. We apply our architecture to dependency parsing and achieve dramatic improvement over strong lexical baselines.Comment: EMNLP 201

    The regularized monotonicity method: detecting irregular indefinite inclusions

    Full text link
    In inclusion detection in electrical impedance tomography, the support of perturbations (inclusion) from a known background conductivity is typically reconstructed from idealized continuum data modelled by a Neumann-to-Dirichlet map. Only few reconstruction methods apply when detecting indefinite inclusions, where the conductivity distribution has both more and less conductive parts relative to the background conductivity; one such method is the monotonicity method of Harrach, Seo, and Ullrich. We formulate the method for irregular indefinite inclusions, meaning that we make no regularity assumptions on the conductivity perturbations nor on the inclusion boundaries. We show, provided that the perturbations are bounded away from zero, that the outer support of the positive and negative parts of the inclusions can be reconstructed independently. Moreover, we formulate a regularization scheme that applies to a class of approximative measurement models, including the Complete Electrode Model, hence making the method robust against modelling error and noise. In particular, we demonstrate that for a convergent family of approximative models there exists a sequence of regularization parameters such that the outer shape of the inclusions is asymptotically exactly characterized. Finally, a peeling-type reconstruction algorithm is presented and, for the first time in literature, numerical examples of monotonicity reconstructions for indefinite inclusions are presented.Comment: 28 pages, 7 figure

    Convergence and regularization for monotonicity-based shape reconstruction in electrical impedance tomography

    Get PDF
    The inverse problem of electrical impedance tomography is severely ill-posed, meaning that, only limited information about the conductivity can in practice be recovered from boundary measurements of electric current and voltage. Recently it was shown that a simple monotonicity property of the related Neumann-to-Dirichlet map can be used to characterize shapes of inhomogeneities in a known background conductivity. In this paper we formulate a monotonicity-based shape reconstruction scheme that applies to approximative measurement models, and regularizes against noise and modelling error. We demonstrate that for admissible choices of regularization parameters the inhomogeneities are detected, and under reasonable assumptions, asymptotically exactly characterized. Moreover, we rigorously associate this result with the complete electrode model, and describe how a computationally cheap monotonicity-based reconstruction algorithm can be implemented. Numerical reconstructions from both simulated and real-life measurement data are presented

    On injective homomorphisms for pure braid groups, and associated Lie algebras

    Get PDF
    The question of whether a representation of Artin's pure braid group is faithful is translated to certain properties of the Lie algebra arising from the descending central series of the pure braid group, and thus the Vassiliev invariants of pure braids via work of T. Kohno \cite{kohno1,kohno2}. The main result is a Lie algebraic condition which guarantees that a homomorphism out of the classical pure braid group is faithful. However, it is unclear whether the methods here can be applied to any open cases such as the Gassner representation.Comment: Change in Contex
    • …
    corecore