Articles

This paper presents an unsupervised rela- tion extraction method for discovering and enhancing relations in which a specified concept in Wikipedia participates. Using respective characteristics of Wikipedia ar- ticles and Web corpus, we develop a clus- tering approach based on combinations of patterns: dependency patterns from depen- dency analysis of …...

Creating labeled training data for rela- tion extraction is expensive. In this pa- per, we study relation extraction in a spe- cial weakly-supervised setting when we have only a few seed instances of the tar- get relation type we want to extract but we also have a large amount of …...

This paper investigates the class of Tree- Tuple MCTAG with Shared Nodes, TT- MCTAG for short, an extension of Tree Adjoining Grammars that has been pro- posed for natural language processing, in particular for dealing with discontinuities and word order variation in languages such as German. It has been shown …...

Modern models of relation extraction for tasks like ACE are based on supervised learning of relations from small hand-labeled corpora. We investigate an alternative paradigm that does not require labeled corpora, avoiding the domain dependence of ACE- style algorithms, and allowing the use of corpora of any size. Our experiments …...

Linear context-free rewriting systems (LCFRSs) are grammar formalisms with the capability of modeling discontinu- ous constituents. Many applications use LCFRSs where the fan-out (a measure of the discontinuity of phrases) is not allowed to be greater than 2. We present an ef- ficient algorithm for transforming LCFRS with fan-out at …...

We consider the problem of learning context-dependent mappings from sen- tences to logical form. The training ex- amples are sequences of sentences anno- tated with lambda-calculus meaning rep- resentations. We develop an algorithm that maintains explicit, lambda-calculus repre- sentations of salient discourse entities and uses a context-dependent analysis pipeline to …...

We propose a hybrid approach to coor- dinate structure analysis that combines a simple grammar to ensure consistent global structure of coordinations in a sen- tence, and features based on sequence alignment to capture local symmetry of conjuncts. The weight of the alignment- based features, which in turn determines the …...

A∗ parsing makes 1-best search efficient by suppressing unlikely 1-best items. Existing k- best extraction methods can efficiently search for top derivations, but only after an exhaus- tive 1-best pass. We present a unified algo- rithm for k-best A∗ parsing which preserves the efficiency of k-best extraction while giv- ing …...

Inspired by the incremental TER align- ment, we re-designed the Indirect HMM (IHMM) alignment, which is one of the best hypothesis alignment methods for conventional MT system combination, in an incremental manner. One crucial prob- lem of incremental alignment is to align a hypothesis to a confusion network (CN). Our …...

Recently confusion network decoding shows the best performance in combining outputs from multiple machine translation (MT) sys- tems. However, overcoming different word orders presented in multiple MT systems dur- ing hypothesis alignment still remains the biggest challenge to confusion network-based MT system combination. In this paper, we compare four commonly …...

In this paper we present a confidence mea- sure for word alignment based on the posterior probability of alignment links. We introduce sentence alignment confi- dence measure and alignment link con- fidence measure. Based on these mea- sures, we improve the alignment qual- ity by selecting high confidence sentence alignments …...

This work investigates supervised word align- ment methods that exploit inversion transduc- tion grammar (ITG) constraints. We con- sider maximum margin and conditional like- lihood objectives, including the presentation of a new normal form grammar for canoni- calizing derivations. Even for non-ITG sen- tence pairs, we show that it is …...

The tree sequence based translation model al- lows the violation of syntactic boundaries in a rule to capture non-syntactic phrases, where a tree sequence is a contiguous sequence of sub- trees. This paper goes further to present a trans- lation model based on non-contiguous tree se- quence alignment, where a …...

The present paper describes a robust ap- proach for abbreviating terms. First, in order to incorporate non-local informa- tion into abbreviation generation tasks, we present both implicit and explicit solu- tions: the latent variable model, or alter- natively, the label encoding approach with global information. Although the two ap- proaches …...

This paper shows the results of an experiment in dialogue segmentation. In this experiment, segmentation was done on a level of analysis similar to adjacency pairs. The method of annotation was somewhat novel: volunteers were invited to participate over the Web, and their responses were aggregated using a simple voting …...

User simulations are shown to be useful in spoken dialog system development. Since most current user simulations deploy prob- ability models to mimic human user be- haviors, how to set up user action proba- bilities in these models is a key problem to solve. One generally used approach is to …...

We present a human-robot dialogue sys- tem that enables a robot to work together with a human user to build wooden con- struction toys. We then describe a study in which na¨ıve subjects interacted with this system under a range of conditions and then completed a user-satisfaction ques- tionnaire. The …...

We present a novel approach to parse web search queries for the purpose of automatic tagging of the queries. We will define a set of probabilistic context-free rules, which generates bags (i.e. multi-sets) of words. Us- ing this new type of rule in combination with the traditional probabilistic phrase structure …...

Mining bilingual data (including bilingual sen- tences and terms1) from the Web can benefit many NLP applications, such as machine translation and cross language information re- trieval. In this paper, based on the observation that bilingual data in many web pages appear collectively following similar patterns, an adaptive pattern-based bilingual …...

Short Messaging Service (SMS) is popu- larly used to provide information access to people on the move. This has resulted in the growth of SMS based Question An- swering (QA) services. However auto- matically handling SMS questions poses significant challenges due to the inherent noise in SMS questions. In this …...