To navigate many-to-many mappings between referents and linguistic expressions, listeners need to calibrate likelihood estimates for different referential expressions taking into account both the context and speaker-specific variation. Focusing on speaker variation, we present three experiments. Experiment 1 establishes that listeners generalize speakerspecific patterns of pre-nominal modificat...

Software review text fragments have considerably valuable information about users’ experience. It includes a huge set of properties including the software quality. Opinion mining or sentiment analysis is concerned with analyzing textual user judgments. The application of sentiment analysis on software reviews can find a quantitative value that represents software quality. Although many software...

One of the bottlenecks of current recognition (and graph matching) systems is their assumption of one-to-one feature (node) correspondence. This assumption breaks down in the generic object recognition task where, for example, a collection of features at one scale (in one image) may correspond to a single feature at a coarser scale (in the second image). Generic object recognition therefore req...

Semantic matching is a fundamental step in implementing data sharing applications. Most systems automating this task however limit themselves to finding simple (one-to-one) matching. In fact, complex (many-to-many) matching raises a far more difficult problem as the search space of concept combinations is often very large. This article presents Indigo, a system discovering complex matching in t...

In this paper, we address the problem of planning the textual organization of instructions. We take the view that natural language generation (NLG) is a mapping process of diierent levels of conceptual and textual representations. Within this framework , we consider the mapping between the text's semantic representation and its rhetorical structure. We argue that such a mapping is not direct, b...

A many-to-many k-disjoint path cover of a graph joining two disjoint vertex subsets S and T of equal size k is a set of k vertex-disjoint paths between S and T that altogether cover every vertex of the graph. It is classified as paired if each source in S is required to be paired with a specific sink in T , or unpaired otherwise. In this paper, we develop Ore-type sufficient conditions for the ...

This paper aims to introduce the issues related to the syntactic alignment of a dependency-based multilingual parallel treebank, ParTUT. Our approach to the task starts from a lexical mapping and then attempts to expand it using dependency relations. In developing the system, however, we realized that the only dependency relations between the individual nodes were not sufficient to overcome som...

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.