Articles

This paper describes POS tagging exper- iments with semi-supervised training as an extension to the (supervised) averaged perceptron algorithm, first introduced for this task by (Collins, 2002). Experiments with an iterative training on standard-sized supervised (manually annotated) dataset (106 tokens) combined with a relatively modest (in the order of 108 …...

We propose an unsupervised method for distinguishing literal and non-literal us- ages of idiomatic expressions. Our method determines how well a literal inter- pretation is linked to the overall cohesive structure of the discourse. If strong links can be found, the expression is classified as literal, otherwise as idiomatic. We …...

This paper describes a fully incremental dia- logue system that can engage in dialogues in a simple domain, number dictation. Be- cause it uses incremental speech recognition and prosodic analysis, the system can give rapid feedback as the user is speaking, with a very short latency of around 200ms. Be- …...

Multi-source statistical machine transla- tion is the process of generating a single translation from multiple inputs. Previous work has focused primarily on selecting from potential outputs of separate transla- tion systems, and solely on multi-parallel corpora and test sets. We demonstrate how multi-source translation can be adapted for multiple monolingual …...

Model of Incremental Dialogue Processing David Schlangen Department of Linguistics University of Potsdam, Germany das@ling.uni-potsdam.de Gabriel Skantze∗ Dept. of Speech, Music and Hearing KTH, Stockholm, Sweden gabriel@speech.kth.se Abstract We present a general model and concep- tual framework for specifying architec- tures for incremental processing in dia- logue systems, in particular …...

We present and evaluate a new model for Natural Language Generation (NLG) in Spoken Dialogue Systems, based on statis- tical planning, given noisy feedback from the current generation context (e.g. a user and a surface realiser). We study its use in a standard NLG problem: how to present information (in …...

We present an extensive study on the prob- lem of detecting polarity of words. We consider the polarity of a word to be ei- ther positive or negative. For example, words such as good, beautiful, and won- derful are considered as positive words; whereas words such as bad, ugly, and …...

Automatic image annotation is an attrac- tive approach for enabling convenient ac- cess to images found in a variety of docu- ments. Since image captions and relevant discussions found in the text can be useful for summarizing the content of images, it is also possible that this text can be …...

This paper presents the results of a series of experiments which examine the impact of two information status categories (given and new) and frequency of occurrence on pitch accent realisations. More specifi- cally the experiments explore within-type similarity of pitch accent productions and the effect information status and frequency of …...

We present several algorithms for assign- ing heads in phrase structure trees, based on different linguistic intuitions on the role of heads in natural language syntax. Start- ing point of our approach is the obser- vation that a head-annotated treebank de- fines a unique lexicalized tree substitution grammar. This allows …...

In this paper we introduce the notion of “frame relatedness”, i.e. relatedness among prototypical situations as repre- sented in the FrameNet database. We first demonstrate the cognitive plausibility of that notion through an annotation experi- ment, and then propose different types of computational measures to automatically assess relatedness. Results show …...

An important part of question answering is ensuring a candidate answer is plausi- ble as a response. We present a flexible approach based on discriminative prefer- ence ranking to determine which of a set of candidate answers are appropriate. Dis- criminative methods provide superior per- formance while at the same …...

Current approaches to the prediction of associations rely on just one type of in- formation, generally taking the form of either word space models or collocation measures. At the moment, it is an open question how these approaches compare to one another. In this paper, we will investigate the performance …...

A set of labeled classes of instances is ex- tracted from text and linked into an exist- ing conceptual hierarchy. Besides a signif- icant increase in the coverage of the class labels assigned to individual instances, the resulting resource of labeled classes is more effective than similar data derived from …...

This article presents empirical evaluations of aspects of annotation for the linguis- tic property of animacy in Swedish, rang- ing from manual human annotation, auto- matic classification and, finally, an exter- nal evaluation in the task of syntactic pars- ing. We show that a treatment of animacy as a lexical …...

Named entity recognition (NER) for En- glish typically involves one of three gold standards: MUC, CoNLL, or BBN, all created by costly manual annotation. Recent work has used Wikipedia to automatically cre- ate a massive corpus of named entity an- notated text. We present the first comprehensive cross- corpus evaluation …...

Many methods are available for comput- ing semantic similarity between individ- ual words, but certain NLP tasks require the comparison of word pairs. This pa- per presents a kernel-based framework for application to relational reasoning tasks of this kind. The model presented here com- bines information about two distinct types …...

Automatic detection of general relations between short texts is a complex task that cannot be carried out only relying on lan- guage models and bag-of-words. There- fore, learning methods to exploit syntax and semantics are required. In this pa- per, we present a new kernel for the repre- sentation of …...

Many parsing techniques including pa- rameter estimation assume the use of a packed parse forest for efficient and ac- curate parsing. However, they have sev- eral inherent problems deriving from the restriction of locality in the packed parse forest. Deterministic parsing is one of solutions that can achieve simple and …...

We present a novel graph-based algo- rithm for the automated disambiguation of glosses in lexical knowledge resources. A dictionary graph is built starting from senses (vertices) and explicit or implicit relations in the dictionary (edges). The approach is based on the identification of edge sequences which constitute cycles in the …...