This work presents a grapheme-based approach of English-to-Chinese (E2C) transliteration, which consists of many-to-many (M2M) alignment and conditional random fields (CRF) using accessor variety (AV) as an additional feature to approximate local context of source graphemes. Experiment results show that the AV of a given English named entity generally improves effectiveness of E2C transliteration.

The functioning of a multimodal integration system requires metadata, such as ontologies, that describe media resources and media components. Such metadata are generally application and domain dependent, which causes difficulties when media need to be shared across domains. Thus, there is a need for a mechanism that can relate the key terms and/or media components in data from different sources...

Learning Decompositional Shape Models from Examples Alex Levinshtein Master of Science Graduate Department of Computer Science University of Toronto 2005 We present an algorithm for automatically constructing a decompositional shape model from examples. Unlike current approaches to structural model acquisition, in which one-to-one correspondences among appearance-based features are used to cons...

We show that the full version of the so-called ‘rural hospital theorem’ (Roth, 1986) generalizes to many-to-many matching where agents on both sides of the market have separable and substitutable preferences.

We count the number of alignments of N ≥ 1 sequences when match-up types are from a specified set S ⊆ N . Equivalently, we count the number of nonnegative integer matrices whose rows sum to a given fixed vector and each of whose columns lie in S. We provide a new asymptotic formula for the case S = {(s1, . . . , sN ) | 1 ≤ si ≤ 2}.