mneb/semeval2018-task7 · Datasets at Hugging Face

input stringlengths 231 1.99k	output dict	schema listlengths 0 0
Activity detection for information access to oral communication Oral communication is ubiquitous and carries important information yet it is also time consuming to document. Given the development of storage media and networks one could just record and store a conversation for documentation. The question is, however, ho...	{ "entities": { "keyphrase": [ { "text": "Oral communication", "start": 64, "end": 82 }, { "text": "storage media and networks", "start": 199, "end": 225 }, { "text": "conversation", "start": 260, "end": 272 ...	[]
Dialogue Interaction with the DARPA Communicator Infrastructure: The Development of Useful Software To support engaging human users in robust, mixed-initiative speech dialogue interactions which reach beyond current capabilities in dialogue systems, the DARPA Communicator program [1] is funding the development of a dis...	{ "entities": { "keyphrase": [ { "text": "mixed-initiative speech dialogue interactions", "start": 143, "end": 188 }, { "text": "dialogue systems", "start": 232, "end": 248 }, { "text": "DARPA Communicator program", "sta...	[]
Interlingua-Based Broad-Coverage Korean-to-English Translation in CCLING At MIT Lincoln Laboratory, we have been developing a Korean-to-English machine translation system CCLINC (Common Coalition Language System at Lincoln Laboratory). The CCLINC Korean-to-English translation system consists of two core modules, langua...	{ "entities": { "keyphrase": [ { "text": "Korean-to-English machine translation system", "start": 126, "end": 170 }, { "text": "CCLINC (Common Coalition Language System at Lincoln Laboratory)", "start": 171, "end": 234 }, { "tex...	[]
Is That Your Final Answer? The purpose of this research is to test the efficacy of applying automated evaluation techniques, originally devised for the evaluation of human language learners, to the output of machine translation (MT) systems. We believe that these evaluation techniques will provide information about bot...	{ "entities": { "keyphrase": [ { "text": "automated evaluation techniques", "start": 92, "end": 123 }, { "text": "human language learners", "start": 166, "end": 189 }, { "text": "output", "start": 198, "end": 204...	[]
Listen-Communicate-Show (LCS): Spoken Language Command of Agent-based Remote Information Access Listen-Communicate-Show (LCS) is a new paradigm for human interaction with data sources. We integrate a spoken language understanding system with intelligent mobile agents that mediate between users and information sources. ...	{ "entities": { "keyphrase": [ { "text": "Listen-Communicate-Show (LCS)", "start": 96, "end": 125 }, { "text": "human interaction with data sources", "start": 148, "end": 183 }, { "text": "spoken language understanding system", ...	[]
On Combining Language Models: Oracle Approach In this paper, we address the problem of combining several language models (LMs). We find that simple interpolation methods, like log-linear and linear interpolation, improve the performance but fall short of the performance of an oracle. The oracle knows the reference word...	{ "entities": { "keyphrase": [ { "text": "language models (LMs)", "start": 105, "end": 126 }, { "text": "interpolation methods", "start": 148, "end": 169 }, { "text": "log-linear and linear interpolation", "start": 176, ...	[]
Towards an Intelligent Multilingual Keyboard System This paper proposes a practical approach employing n-gram models and error-correction rules for Thai key prediction and Thai-English language identification. The paper also proposes rule-reduction algorithm applying mutual information to reduce the error-correction ru...	{ "entities": { "keyphrase": [ { "text": "n-gram models", "start": 103, "end": 116 }, { "text": "error-correction rules", "start": 121, "end": 143 }, { "text": "Thai key prediction", "start": 148, "end": 167 ...	[]
SPoT: A Trainable Sentence Planner Sentence planning is a set of inter-related but distinct tasks, one of which is sentence scoping, i. e. the choice of syntactic structure for elementary speech acts and the decision of how to combine them into one or more sentences. In this paper, we present SPoT, a sentence planner, ...	{ "entities": { "keyphrase": [ { "text": "Sentence planning", "start": 35, "end": 52 }, { "text": "sentence scoping", "start": 115, "end": 131 }, { "text": "syntactic structure", "start": 153, "end": 172 },...	[]
Low-cost, High-performance Translation Retrieval: Dumber is Better In this paper, we compare the relative effects of segment order, segmentation and segment contiguity on the retrieval performance of a translation memory system. We take a selection of both bag-of-words and segment order-sensitive string comparison meth...	{ "entities": { "keyphrase": [ { "text": "segment order", "start": 117, "end": 130 }, { "text": "segmentation", "start": 132, "end": 144 }, { "text": "segment contiguity", "start": 149, "end": 167 }, ...	[]
Guided Parsing of Range Concatenation Languages The theoretical study of the range concatenation grammar [RCG] formalism has revealed many attractive properties which may be used in NLP. In particular, range concatenation languages [RCL] can be parsed in polynomial time and many classical grammatical formalisms can be ...	{ "entities": { "keyphrase": [ { "text": "range concatenation grammar [RCG] formalism", "start": 77, "end": 120 }, { "text": "NLP", "start": 182, "end": 185 }, { "text": "range concatenation languages [RCL]", "start": 20...	[]
Extracting Paraphrases from a Parallel Corpus While paraphrasing is critical both for interpretation and generation of natural language, current systems use manual or semi-automatic methods to collect paraphrases. We present an unsupervised learning algorithm for identification of paraphrases from a corpus of multiple ...	{ "entities": { "keyphrase": [ { "text": "paraphrasing", "start": 52, "end": 64 }, { "text": "interpretation and generation of natural language", "start": 86, "end": 135 }, { "text": "paraphrases", "start": 201, ...	[]
Alternative Phrases and Natural Language Information Retrieval This paper presents a formal analysis for a large class of words called alternative markers, which includes other (than), such (as), and besides. These words appear frequently enough in dialog to warrant serious attention, yet present natural language searc...	{ "entities": { "keyphrase": [ { "text": "formal analysis", "start": 85, "end": 100 }, { "text": "words", "start": 122, "end": 127 }, { "text": "alternative markers", "start": 135, "end": 154 }, { ...	[]
Extending Lambek grammars: a logical account of minimalist grammars We provide a logical definition of Minimalist grammars, that are Stabler' s formalization of Chomsky' s minimalist program. Our logical definition leads to a neat relation to categorial grammar, (yielding a treatment of Montague semantics), a parsing-a...	{ "entities": { "keyphrase": [ { "text": "logical definition", "start": 81, "end": 99 }, { "text": "Minimalist grammars", "start": 103, "end": 122 }, { "text": "Stabler' s formalization", "start": 133, "end": 157...	[]
Evaluating a Trainable Sentence Planner for a Spoken Dialogue System Techniques for automatically training modules of a natural language generator have recently been proposed, but a fundamental concern is whether the quality of utterances produced with trainable components can compete with hand-crafted template-based o...	{ "entities": { "keyphrase": [ { "text": "Techniques for automatically training", "start": 69, "end": 106 }, { "text": "natural language generator", "start": 120, "end": 146 }, { "text": "quality", "start": 217, ...	[]
Using Machine Learning Techniques to Interpret WH-questions We describe a set of supervised machine learning experiments centering on the construction of statistical models of WH-questions. These models, which are built from shallow linguistic features of questions, are employed to predict target variables which repres...	{ "entities": { "keyphrase": [ { "text": "supervised machine learning", "start": 81, "end": 108 }, { "text": "statistical models", "start": 154, "end": 172 }, { "text": "WH-questions", "start": 176, "end": 188 ...	[]
Effective Utterance Classification with Unsupervised Phonotactic Models This paper describes a method for utterance classification that does not require manual transcription of training data. The method combines domain independent acoustic models with off-the-shelf classifiers to give utterance classification performan...	{ "entities": { "keyphrase": [ { "text": "utterance classification", "start": 106, "end": 130 }, { "text": "manual transcription", "start": 153, "end": 173 }, { "text": "training data", "start": 177, "end": 190 ...	[]
In Question Answering, Two Heads Are Better Than One Motivated by the success of ensemble methods in machine learning and other areas of natural language processing, we developed a multi-strategy and multi-source approach to question answering which is based on combining the results from different answering agents sear...	{ "entities": { "keyphrase": [ { "text": "ensemble methods", "start": 81, "end": 97 }, { "text": "machine learning", "start": 101, "end": 117 }, { "text": "natural language processing", "start": 137, "end": 164 ...	[]
Semantic Coherence Scoring Using an Ontology In this paper we present ONTOSCORE, a system for scoring sets of concepts on the basis of an ontology. We apply our system to the task of scoring alternative speech recognition hypotheses (SRH) in terms of their semantic coherence. We conducted an annotation experiment and s...	{ "entities": { "keyphrase": [ { "text": "ONTOSCORE", "start": 70, "end": 79 }, { "text": "concepts", "start": 110, "end": 118 }, { "text": "ontology", "start": 138, "end": 146 }, { "text": "s...	[]
Statistical Phrase-Based Translation We propose a new phrase-based translation model and decoding algorithm that enables us to evaluate and compare several, previously proposed phrase-based translation models. Within our framework, we carry out a large number of experiments to understand better and explain why phrase-b...	{ "entities": { "keyphrase": [ { "text": "phrase-based translation model", "start": 54, "end": 84 }, { "text": "decoding algorithm", "start": 89, "end": 107 }, { "text": "phrase-based translation models", "start": 177, ...	[]
A Generative Probabilistic OCR Model for NLP Applications In this paper, we introduce a generative probabilistic optical character recognition (OCR) model that describes an end-to-end process in the noisy channel framework, progressing from generation of true text through its transformation into the noisy output of an ...	{ "entities": { "keyphrase": [ { "text": "generative probabilistic optical character recognition (OCR) model", "start": 88, "end": 154 }, { "text": "noisy channel framework", "start": 199, "end": 222 }, { "text": "true text", ...	[]
Statistical Sentence Condensation using Ambiguity Packing and Stochastic Disambiguation Methods for Lexical-Functional Grammar We present an application of ambiguity packing and stochastic disambiguation techniques for Lexical-Functional Grammars (LFG) to the domain of sentence condensation. Our system incorporates a l...	{ "entities": { "keyphrase": [ { "text": "ambiguity packing and stochastic disambiguation techniques", "start": 156, "end": 214 }, { "text": "Lexical-Functional Grammars (LFG)", "start": 219, "end": 252 }, { "text": "sentence co...	[]
Feature-Rich Part-of-Speech Tagging with a Cyclic Dependency Network We present a new part-of-speech tagger that demonstrates the following ideas: (i) explicit use of both preceding and following tag contexts via a dependency network representation, (ii) broad use of lexical features, including jointly conditioning on ...	{ "entities": { "keyphrase": [ { "text": "part-of-speech tagger", "start": 86, "end": 107 }, { "text": "tag contexts", "start": 196, "end": 208 }, { "text": "dependency network representation", "start": 215, "end...	[]
Getting More Mileage from Web Text Sources for Conversational Speech Language Modeling using Class-Dependent Mixtures Sources of training data suitable for language modeling of conversational speech are limited. In this paper, we show how training data can be supplemented with text from the web filtered to match the st...	{ "entities": { "keyphrase": [ { "text": "training data", "start": 129, "end": 142 }, { "text": "language modeling", "start": 156, "end": 173 }, { "text": "conversational speech", "start": 177, "end": 198 }...	[]
Adaptation Using Out-of-Domain Corpus within EBMT In order to boost the translation quality of EBMT based on a small-sized bilingual corpus, we use an out-of-domain bilingual corpus and, in addition, the language model of an in-domain monolingual corpus. We conducted experiments with an EBMT system. The two evaluation ...	{ "entities": { "keyphrase": [ { "text": "translation quality", "start": 72, "end": 91 }, { "text": "EBMT", "start": 95, "end": 99 }, { "text": "bilingual corpus", "start": 123, "end": 139 }, { ...	[]
Unsupervised Learning of Morphology for English and Inuktitut We describe a simple unsupervised technique for learning morphology by identifying hubs in an automaton. For our purposes, a hub is a node in a graph with in-degree greater than one and out-degree greater than one. We create a word-trie, transform it into a ...	{ "entities": { "keyphrase": [ { "text": "unsupervised technique", "start": 83, "end": 105 }, { "text": "morphology", "start": 119, "end": 129 }, { "text": "hubs", "start": 145, "end": 149 }, { ...	[]
Word Alignment with Cohesion Constraint We present a syntax-based constraint for word alignment, known as the cohesion constraint. It requires disjoint English phrases to be mapped to non-overlapping intervals in the French sentence. We evaluate the utility of this constraint in two different algorithms. The results sh...	{ "entities": { "keyphrase": [ { "text": "syntax-based constraint", "start": 53, "end": 76 }, { "text": "word alignment", "start": 81, "end": 95 }, { "text": "cohesion constraint", "start": 110, "end": 129 ...	[]
Bootstrapping for Named Entity Tagging Using Concept-based Seeds A novel bootstrapping approach to Named Entity (NE) tagging using concept-based seeds and successive learners is presented. This approach only requires a few common noun or pronoun seeds that correspond to the concept for the targeted NE, e. g. he/she/man...	{ "entities": { "keyphrase": [ { "text": "bootstrapping approach", "start": 73, "end": 95 }, { "text": "Named Entity (NE) tagging", "start": 99, "end": 124 }, { "text": "concept-based seeds", "start": 131, "end":...	[]
A Phrase-Based Unigram Model for Statistical Machine Translation In this paper, we describe a phrase-based unigram model for statistical machine translation that uses a much simpler set of model parameters than similar phrase-based models. The units of translation are blocks-pairs of phrases. During decoding, we use a ...	{ "entities": { "keyphrase": [ { "text": "phrase-based unigram model", "start": 94, "end": 120 }, { "text": "statistical machine translation", "start": 125, "end": 156 }, { "text": "model parameters", "start": 189, ...	[]
Cooperative Model Based Language Understanding in Dialogue In this paper, we propose a novel Cooperative Model for natural language understanding in a dialogue system. We build this based on both Finite State Model (FSM) and Statistical Learning Model (SLM). FSM provides two strategies for language understanding and ha...	{ "entities": { "keyphrase": [ { "text": "Cooperative Model", "start": 93, "end": 110 }, { "text": "natural language understanding", "start": 115, "end": 145 }, { "text": "dialogue system", "start": 151, "end": 1...	[]
JAVELIN: A Flexible, Planner-Based Architecture for Question Answering The JAVELIN system integrates a flexible, planning-based architecture with a variety of language processing modules to provide an open-domain question answering capability on free text. The demonstration will focus on how JAVELIN processes questions...	{ "entities": { "keyphrase": [ { "text": "JAVELIN system", "start": 75, "end": 89 }, { "text": "planning-based architecture", "start": 113, "end": 140 }, { "text": "language processing modules", "start": 159, "en...	[]
Using Predicate-Argument Structures for Information Extraction In this paper we present a novel, customizable: IE paradigm that takes advantage of predicate-argument structures. We also introduce a new way of automatically identifying predicate argument structures, which is central to our IE paradigm. It is based on: (...	{ "entities": { "keyphrase": [ { "text": "IE paradigm", "start": 111, "end": 122 }, { "text": "predicate-argument structures", "start": 147, "end": 176 }, { "text": "predicate argument structures", "start": 235, ...	[]
Hierarchical Directed Acyclic Graph Kernel: Methods for Structured Natural Language Data This paper proposes the Hierarchical Directed Acyclic Graph (HDAG) Kernel for structured natural language data. The HDAG Kernel directly accepts several levels of both chunks and their relations, and then efficiently computes the w...	{ "entities": { "keyphrase": [ { "text": "Hierarchical Directed Acyclic Graph (HDAG) Kernel", "start": 113, "end": 162 }, { "text": "structured natural language data", "start": 167, "end": 199 }, { "text": "HDAG Kernel", ...	[]
Clustering Polysemic Subcategorization Frame Distributions Semantically Previous research has demonstrated the utility of clustering in inducing semantic verb classes from undisambiguated corpus data. We describe a new approach which involves clustering subcategorization frame (SCF) distributions using the Information ...	{ "entities": { "keyphrase": [ { "text": "clustering", "start": 122, "end": 132 }, { "text": "semantic verb classes", "start": 145, "end": 166 }, { "text": "corpus data", "start": 188, "end": 199 }, {...	[]
A Machine Learning Approach to Pronoun Resolution in Spoken Dialogue We apply a decision tree based approach to pronoun resolution in spoken dialogue. Our system deals with pronouns with NP-and non-NP-antecedents. We present a set of features designed for pronoun resolution in spoken dialogue and determine the most pro...	{ "entities": { "keyphrase": [ { "text": "decision tree based approach", "start": 80, "end": 108 }, { "text": "pronoun resolution", "start": 112, "end": 130 }, { "text": "spoken dialogue", "start": 134, "end": 14...	[]
Optimizing Story Link Detection is not Equivalent to Optimizing New Event Detection Link detection has been regarded as a core technology for the Topic Detection and Tracking tasks of new event detection. In this paper we formulate story link detection and new event detection as information retrieval task and hypothesi...	{ "entities": { "keyphrase": [ { "text": "Link detection", "start": 84, "end": 98 }, { "text": "Topic Detection and Tracking tasks", "start": 146, "end": 180 }, { "text": "new event detection", "start": 184, "end...	[]
Corpus-based Discourse Understanding in Spoken Dialogue Systems This paper concerns the discourse understanding process in spoken dialogue systems. This process enables the system to understand user utterances based on the context of a dialogue. Since multiple candidates for the understanding result can be obtained for...	{ "entities": { "keyphrase": [ { "text": "discourse understanding process", "start": 88, "end": 119 }, { "text": "spoken dialogue systems", "start": 123, "end": 146 }, { "text": "user utterances", "start": 194, "...	[]
Flexible Guidance Generation using User Model in Spoken Dialogue Systems We address appropriate user modeling in order to generate cooperative responses to each user in spoken dialogue systems. Unlike previous studies that focus on user' s knowledge or typical kinds of users, the user model we propose is more comprehen...	{ "entities": { "keyphrase": [ { "text": "user modeling", "start": 96, "end": 109 }, { "text": "cooperative responses", "start": 131, "end": 152 }, { "text": "user", "start": 161, "end": 165 }, { ...	[]
Unsupervised Learning of Arabic Stemming using a Parallel Corpus This paper presents an unsupervised learning approach to building a non-English (Arabic) stemmer. The stemming model is based on statistical machine translation and it uses an English stemmer and a small (10K sentences) parallel corpus as its sole trainin...	{ "entities": { "keyphrase": [ { "text": "unsupervised learning approach", "start": 88, "end": 118 }, { "text": "non-English (Arabic) stemmer", "start": 133, "end": 161 }, { "text": "stemming model", "start": 167, ...	[]
Language Model Based Arabic Word Segmentation We approximate Arabic' s rich morphology by a model that a word consists of a sequence of morphemes in the pattern prefix -stem-suffix (* denotes zero or more occurrences of a morpheme). Our method is seeded by a small manually segmented Arabic corpus and uses it to boot...	{ "entities": { "keyphrase": [ { "text": "Arabic' s rich morphology", "start": 61, "end": 86 }, { "text": "model", "start": 92, "end": 97 }, { "text": "word", "start": 105, "end": 109 }, { "te...	[]
Exploiting Parallel Texts for Word Sense Disambiguation: An Empirical Study A central problem of word sense disambiguation (WSD) is the lack of manually sense-tagged data required for supervised learning. In this paper, we evaluate an approach to automatically acquire sense-tagged training data from English-Chinese par...	{ "entities": { "keyphrase": [ { "text": "word sense disambiguation (WSD)", "start": 97, "end": 128 }, { "text": "manually sense-tagged data", "start": 144, "end": 170 }, { "text": "supervised learning", "start": 184, ...	[]
Towards a Resource for Lexical Semantics: A Large German Corpus with Extensive Semantic Annotation We describe the ongoing construction of a large, semantically annotated corpus resource as reliable basis for the large-scale acquisition of word-semantic information, e. g. the construction of domain-independent lexica. ...	{ "entities": { "keyphrase": [ { "text": "semantically annotated corpus", "start": 148, "end": 177 }, { "text": "acquisition of word-semantic information", "start": 225, "end": 265 }, { "text": "domain-independent lexica", ...	[]
Towards a Model of Face-to-Face Grounding We investigate the verbal and nonverbal means for grounding, and propose a design for embodied conversational agents that relies on both kinds of signals to establish common ground in human-computer interaction. We analyzed eye gaze, head nods and attentional focus in the conte...	{ "entities": { "keyphrase": [ { "text": "verbal and nonverbal means", "start": 61, "end": 87 }, { "text": "grounding", "start": 92, "end": 101 }, { "text": "embodied conversational agents", "start": 128, "end": ...	[]
Comparison between CFG filtering techniques for LTAG and HPSG An empirical comparison of CFG filtering techniques for LTAG and HPSG is presented. We demonstrate that an approximation of HPSG produces a more effective CFG filter than that of LTAG. We also investigate the reason for that difference.	{ "entities": { "keyphrase": [ { "text": "CFG filtering techniques", "start": 89, "end": 113 }, { "text": "LTAG", "start": 118, "end": 122 }, { "text": "HPSG", "start": 127, "end": 131 }, { "t...	[]
Lower and higher estimates of the number of & quot; true analogies & quot; between sentences contained in a large multilingual corpus The reality of analogies between words is refuted by noone (e. g., I walked is to to walk as I laughed is to to laugh, noted I walked: to walk:: I laughed: to laugh). But computational l...	{ "entities": { "keyphrase": [ { "text": "analogies between words", "start": 149, "end": 172 }, { "text": "computational linguists", "start": 305, "end": 328 }, { "text": "analogies between sentences", "start": 360, ...	[]
Evaluating Multiple Aspects of Coherence in Student Essays CriterionSM Online Essay Evaluation Service includes a capability that labels sentences in student writing with essay-based discourse elements (e. g., thesis statements). We describe a new system that enhances Criterion' s capability, by evaluating multiple asp...	{ "entities": { "keyphrase": [ { "text": "CriterionSM Online Essay Evaluation Service", "start": 59, "end": 102 }, { "text": "sentences", "start": 137, "end": 146 }, { "text": "writing", "start": 158, "end": 165 ...	[]
Improving Multilingual Summarization: Using Redundancy in the Input to Correct MT errors In this paper, we use the information redundancy in multilingual input to correct errors in machine translation and thus improve the quality of multilingual summaries. We consider the case of multi-document summarization, where the...	{ "entities": { "keyphrase": [ { "text": "information redundancy", "start": 115, "end": 137 }, { "text": "multilingual input", "start": 141, "end": 159 }, { "text": "machine translation", "start": 181, "end": 200...	[]
A Maximum Entropy Word Aligner for Arabic-English Machine Translation This paper presents a maximum entropy word alignment algorithm for Arabic-English based on supervised training data. We demonstrate that it is feasible to create training material for problems in machine translation and that a mixture of supervised a...	{ "entities": { "keyphrase": [ { "text": "maximum entropy word alignment algorithm", "start": 92, "end": 132 }, { "text": "Arabic-English", "start": 137, "end": 151 }, { "text": "supervised training data", "start": 161, ...	[]
Translating with non-contiguous phrases This paper presents a phrase-based statistical machine translation method, based on non-contiguous phrases, i. e. phrases with gaps. A method for producing such phrases from a word-aligned corpora is proposed. A statistical translation model is also presented that deals such phra...	{ "entities": { "keyphrase": [ { "text": "phrase-based statistical machine translation method", "start": 62, "end": 113 }, { "text": "non-contiguous phrases", "start": 124, "end": 146 }, { "text": "phrases", "start": 154...	[]
Automatically Evaluating Answers to Definition Questions Following recent developments in the automatic evaluation of machine translation and document summarization, we present a similar approach, implemented in a measure called POURPRE, for automatically evaluating answers to definition questions. Until now, the only ...	{ "entities": { "keyphrase": [ { "text": "automatic evaluation", "start": 94, "end": 114 }, { "text": "machine translation", "start": 118, "end": 137 }, { "text": "document summarization", "start": 142, "end": 16...	[]
Pattern Visualization for Machine Translation Output We describe a method for identifying systematic patterns in translation data using part-of-speech tag sequences. We incorporate this analysis into a diagnostic tool intended for developers of machine translation systems, and demonstrate how our application can be use...	{ "entities": { "keyphrase": [ { "text": "patterns", "start": 101, "end": 109 }, { "text": "translation data", "start": 113, "end": 129 }, { "text": "part-of-speech tag sequences", "start": 136, "end": 164 ...	[]
Evaluating the Word Sense Disambiguation Performance of Statistical Machine Translation We present the first known empirical test of an increasingly common speculative claim, by evaluating a representative Chinese-to-English SMT model directly on word sense disambiguation performance, using standard WSD evaluation meth...	{ "entities": { "keyphrase": [ { "text": "empirical test", "start": 115, "end": 129 }, { "text": "Chinese-to-English SMT model", "start": 206, "end": 234 }, { "text": "word sense disambiguation performance", "start": 247...	[]
Statistical Machine Translation Part I: Hands-On Introduction Statistical machine translation (SMT) is currently one of the hot spots in natural language processing. Over the last few years dramatic improvements have been made, and a number of comparative evaluations have shown, that SMT gives competitive results to ru...	{ "entities": { "keyphrase": [ { "text": "Statistical machine translation (SMT)", "start": 62, "end": 99 }, { "text": "natural language processing", "start": 137, "end": 164 }, { "text": "SMT", "start": 285, "end...	[]
Harvesting the Bitexts of the Laws of Hong Kong From the Web In this paper we present our recent work on harvesting English-Chinese bitexts of the laws of Hong Kong from the Web and aligning them to the subparagraph level via utilizing the numbering system in the legal text hierarchy. Basic methodology and practical te...	{ "entities": { "keyphrase": [ { "text": "English-Chinese bitexts", "start": 116, "end": 139 }, { "text": "Web", "start": 174, "end": 177 }, { "text": "subparagraph", "start": 203, "end": 215 }, { ...	[]
Using Machine Translation Evaluation Techniques to Determine Sentence-level Semantic Equivalence The task of machine translation (MT) evaluation is closely related to the task of sentence-level semantic equivalence classification. This paper investigates the utility of applying standard MT evaluation methods (BLEU, NIS...	{ "entities": { "keyphrase": [ { "text": "machine translation (MT) evaluation", "start": 109, "end": 144 }, { "text": "sentence-level semantic equivalence classification", "start": 179, "end": 229 }, { "text": "MT evaluation met...	[]
Automatic generation of paraphrases to be used as translation references in objective evaluation measures of machine translation We propose a method that automatically generates paraphrase sets from seed sentences to be used as reference sets in objective machine translation evaluation measures like BLEU and NIST. We m...	{ "entities": { "keyphrase": [ { "text": "paraphrase", "start": 178, "end": 188 }, { "text": "seed sentences", "start": 199, "end": 213 }, { "text": "reference sets", "start": 228, "end": 242 }, { ...	[]
Annotating Honorifics Denoting Social Ranking of Referents This paper proposes an annotating scheme that encodes honorifics (respectful words). Honorifics are used extensively in Japanese, reflecting the social relationship (e. g. social ranks and age) of the referents. This referential information is vital for resolvi...	{ "entities": { "keyphrase": [ { "text": "annotating scheme", "start": 82, "end": 99 }, { "text": "honorifics", "start": 113, "end": 123 }, { "text": "Honorifics", "start": 144, "end": 154 }, { ...	[]
Discriminative Reranking for Natural Language Parsing This article considers approaches which rerank the output of an existing probabilistic parser. The base parser produces a set of candidate parses for each input sentence, with associated probabilities that define an initial ranking of these parses. A second model th...	{ "entities": { "keyphrase": [ { "text": "probabilistic parser", "start": 127, "end": 147 }, { "text": "parser", "start": 158, "end": 164 }, { "text": "candidate parses", "start": 183, "end": 199 }, {...	[]
Improving Machine Translation Performance by Exploiting Non-Parallel Corpora We present a novel method for discovering parallel sentences in comparable, non-parallel corpora. We train a maximum entropy classifier that, given a pair of sentences, can reliably determine whether or not they are translations of each other....	{ "entities": { "keyphrase": [ { "text": "discovering parallel sentences", "start": 107, "end": 137 }, { "text": "comparable, non-parallel corpora", "start": 141, "end": 173 }, { "text": "maximum entropy classifier", "st...	[]
Scaling Phrase-Based Statistical Machine Translation to Larger Corpora and Longer Phrases In this paper we describe a novel data structure for phrase-based statistical machine translation which allows for the retrieval of arbitrarily long phrases while simultaneously using less memory than is required by current decode...	{ "entities": { "keyphrase": [ { "text": "data structure", "start": 124, "end": 138 }, { "text": "phrase-based statistical machine translation", "start": 143, "end": 187 }, { "text": "retrieval", "start": 209, "e...	[]
Dependency Treelet Translation: Syntactically Informed Phrasal SMT We describe a novel approach to statistical machine translation that combines syntactic information in the source language with recent advances in phrasal translation. This method requires a source-language dependency parser, target language word segmen...	{ "entities": { "keyphrase": [ { "text": "statistical machine translation", "start": 99, "end": 130 }, { "text": "syntactic information", "start": 145, "end": 166 }, { "text": "source language", "start": 174, "en...	[]
Word Sense Disambiguation vs. Statistical Machine Translation We directly investigate a subject of much recent debate: do word sense disambigation models help statistical machine translation quality? We present empirical results casting doubt on this common, but unproved, assumption. Using a state-of-the-art Chinese wo...	{ "entities": { "keyphrase": [ { "text": "word sense disambigation models", "start": 122, "end": 153 }, { "text": "statistical machine translation", "start": 159, "end": 190 }, { "text": "quality", "start": 191, ...	[]
Machine Translation Using Probabilistic Synchronous Dependency Insertion Grammars Syntax-based statistical machine translation (MT) aims at applying statistical models to structured data. In this paper, we present a syntax-based statistical machine translation system based on a probabilistic synchronous dependency inse...	{ "entities": { "keyphrase": [ { "text": "Syntax-based statistical machine translation (MT)", "start": 82, "end": 131 }, { "text": "statistical models", "start": 149, "end": 167 }, { "text": "structured data", "start": 1...	[]
A Localized Prediction Model for Statistical Machine Translation In this paper, we present a novel training method for a localized phrase-based prediction model for statistical machine translation (SMT). The model predicts blocks with orientation to handle local phrase re-ordering. We use a maximum likelihood criterion...	{ "entities": { "keyphrase": [ { "text": "training method", "start": 99, "end": 114 }, { "text": "localized phrase-based prediction model", "start": 121, "end": 160 }, { "text": "statistical machine translation (SMT)", "...	[]
Paraphrasing with Bilingual Parallel Corpora Previous work has used monolingual parallel corpora to extract and generate paraphrases. We show that this task can be done using bilingual parallel corpora, a much more commonly available resource. Using alignment techniques from phrase-based statistical machine translation...	{ "entities": { "keyphrase": [ { "text": "monolingual parallel corpora", "start": 68, "end": 96 }, { "text": "paraphrases", "start": 121, "end": 132 }, { "text": "bilingual parallel corpora", "start": 175, "end":...	[]
Dependency-Based Statistical Machine Translation We present a Czech-English statistical machine translation system which performs tree-to-tree translation of dependency structures. The only bilingual resource required is a sentence-aligned parallel corpus. All other resources are monolingual. We also refer to an evalua...	{ "entities": { "keyphrase": [ { "text": "Czech-English statistical machine translation system", "start": 62, "end": 114 }, { "text": "tree-to-tree translation", "start": 130, "end": 154 }, { "text": "dependency structures", ...	[]
Word Sense Induction: Triplet-Based Clustering and Automatic Evaluation In this paper a novel solution to automatic and unsupervised word sense induction (WSI) is introduced. It represents an instantiation of the one sense per collocation observation (Gale et al., 1992). Like most existing approaches it utilizes cluste...	{ "entities": { "keyphrase": [ { "text": "unsupervised word sense induction (WSI)", "start": 120, "end": 159 }, { "text": "one sense per collocation observation", "start": 213, "end": 250 }, { "text": "clustering of word co-occu...	[]
Addressee Identification in Face-to-Face Meetings We present results on addressee identification in four-participants face-to-face meetings using Bayesian Network and Naive Bayes classifiers. First, we investigate how well the addressee of a dialogue act can be predicted based on gaze, utterance and conversational cont...	{ "entities": { "keyphrase": [ { "text": "addressee identification", "start": 72, "end": 96 }, { "text": "four-participants face-to-face meetings", "start": 100, "end": 139 }, { "text": "Bayesian Network", "start": 146, ...	[]
CDER: Efficient MT Evaluation Using Block Movements Most state-of-the-art evaluation measures for machine translation assign high costs to movements of word blocks. In many cases though such movements still result in correct or almost correct sentences. In this paper, we will present a new evaluation measure which expl...	{ "entities": { "keyphrase": [ { "text": "evaluation measures", "start": 74, "end": 93 }, { "text": "machine translation", "start": 98, "end": 117 }, { "text": "costs", "start": 130, "end": 135 }, { ...	[]
Automatic Segmentation of Multiparty Dialogue In this paper, we investigate the problem of automatically predicting segment boundaries in spoken multiparty dialogue. We extend prior work in two ways. We first apply approaches that have been proposed for predicting top-level topic shifts to the problem of identifying su...	{ "entities": { "keyphrase": [ { "text": "segment boundaries", "start": 116, "end": 134 }, { "text": "spoken multiparty dialogue", "start": 138, "end": 164 }, { "text": "predicting top-level topic shifts", "start": 254, ...	[]
Ensemble Methods for Unsupervised WSD Combination methods are an effective way of improving system performance. This paper examines the benefits of system combination for unsupervised WSD. We investigate several voting-and arbiter-based combination strategies over a diverse pool of unsupervised WSD systems. Our combina...	{ "entities": { "keyphrase": [ { "text": "Combination methods", "start": 38, "end": 57 }, { "text": "system performance", "start": 92, "end": 110 }, { "text": "system combination", "start": 148, "end": 166 ...	[]
An Improved Redundancy Elimination Algorithm for Underspecified Representations We present an efficient algorithm for the redundancy elimination problem: Given an underspecified semantic representation (USR) of a scope ambiguity, compute an USR with fewer mutually equivalent readings. The algorithm operates on underspe...	{ "entities": { "keyphrase": [ { "text": "redundancy elimination problem", "start": 122, "end": 152 }, { "text": "underspecified semantic representation (USR)", "start": 163, "end": 207 }, { "text": "scope ambiguity", "s...	[]
Using Machine Learning Techniques to Build a Comma Checker for Basque In this paper, we describe the research using machine learning techniques to build a comma checker to be integrated in a grammar checker for Basque. After several experiments, and trained with a little corpus of 100, 000 words, the system guesses cor...	{ "entities": { "keyphrase": [ { "text": "machine learning techniques", "start": 116, "end": 143 }, { "text": "comma checker", "start": 155, "end": 168 }, { "text": "grammar checker", "start": 191, "end": 206 ...	[]
Unsupervised Relation Disambiguation Using Spectral Clustering This paper presents an unsupervised learning approach to disambiguate various relations between named entities by use of various lexical and syntactic features from the contexts. It works by calculating eigenvectors of an adjacency graph' s Laplacian to rec...	{ "entities": { "keyphrase": [ { "text": "unsupervised learning approach", "start": 86, "end": 116 }, { "text": "named entities", "start": 159, "end": 173 }, { "text": "lexical and syntactic features", "start": 192, ...	[]
Automatic Construction of Polarity-tagged Corpus from HTML Documents This paper proposes a novel method of building polarity-tagged corpus from HTML documents. The characteristics of this method is that it is fully automatic and can be applied to arbitrary HTML documents. The idea behind our method is to utilize certai...	{ "entities": { "keyphrase": [ { "text": "polarity-tagged corpus", "start": 116, "end": 138 }, { "text": "HTML documents", "start": 144, "end": 158 }, { "text": "HTML documents", "start": 257, "end": 271 },...	[]
Intelligent Access to Text: Integrating Information Extraction Technology into Text Browsers In this paper we show how two standard outputs from information extraction (IE) systems-named entity annotations and scenario templates-can be used to enhance access to text collections via a standard text browser. We describe ...	{ "entities": { "keyphrase": [ { "text": "information extraction (IE) systems", "start": 145, "end": 180 }, { "text": "named entity annotations", "start": 181, "end": 205 }, { "text": "scenario templates", "start": 210, ...	[]
Natural Language Generation in Dialog Systems Recent advances in Automatic Speech Recognition technology have put the goal of naturally sounding dialog systems within reach. However, the improved speech recognition has brought to light a new problem: as dialog systems understand more of what the user tells them, they n...	{ "entities": { "keyphrase": [ { "text": "Automatic Speech Recognition technology", "start": 65, "end": 104 }, { "text": "dialog systems", "start": 145, "end": 159 }, { "text": "speech recognition", "start": 196, ...	[]
A Three-Tiered Evaluation Approach for Interactive Spoken Dialogue Systems We describe a three-tiered approach for evaluation of spoken dialogue systems. The three tiers measure user satisfaction, system support of mission success and component performance. We describe our use of this approach in numerous fielded user ...	{ "entities": { "keyphrase": [ { "text": "spoken dialogue systems", "start": 129, "end": 152 }, { "text": "user satisfaction", "start": 178, "end": 195 }, { "text": "system support of mission success", "start": 197, ...	[]
TAP-XL: An Automated Analyst' s Assistant The TAP-XL Automated Analyst' s Assistant is an application designed to help an English-speaking analyst write a topical report, culling information from a large inflow of multilingual, multimedia data. It gives users the ability to spend their time finding more data relevant t...	{ "entities": { "keyphrase": [ { "text": "TAP-XL Automated Analyst' s Assistant", "start": 46, "end": 83 }, { "text": "English", "start": 122, "end": 129 }, { "text": "topical report", "start": 155, "end": 169 ...	[]
Some Computational Complexity Results for Synchronous Context-Free Grammars This paper investigates some computational problems associated with probabilistic translation models that have recently been adopted in the literature on machine translation. These models can be viewed as pairs of probabilistic context-free gra...	{ "entities": { "keyphrase": [ { "text": "computational problems", "start": 105, "end": 127 }, { "text": "probabilistic translation models", "start": 144, "end": 176 }, { "text": "machine translation", "start": 230, ...	[]
BLEU in characters: towards automatic MT evaluation in languages without word delimiters Automatic evaluation metrics for Machine Translation (MT) systems, such as BLEU or NIST, are now well established. Yet, they are scarcely used for the assessment of language pairs like English-Chinese or English-Japanese, because o...	{ "entities": { "keyphrase": [ { "text": "evaluation metrics", "start": 99, "end": 117 }, { "text": "Machine Translation (MT) systems", "start": 122, "end": 154 }, { "text": "BLEU", "start": 164, "end": 168 ...	[]
Interactively Exploring a Machine Translation Model This paper describes a method of interactively visualizing and directing the process of translating a sentence. The method allows a user to explore a model of syntax-based statistical machine translation (MT), to understand the model' s strengths and weaknesses, and t...	{ "entities": { "keyphrase": [ { "text": "interactively visualizing and directing the process", "start": 85, "end": 136 }, { "text": "translating a sentence", "start": 140, "end": 162 }, { "text": "user", "start": 184, ...	[]
Computational Complexity of Statistical Machine Translation In this paper we study a set of problems that are of considerable importance to Statistical Machine Translation (SMT) but which have not been addressed satisfactorily by the SMT research community. Over the last decade, a variety of SMT algorithms have been bu...	{ "entities": { "keyphrase": [ { "text": "Statistical Machine Translation (SMT)", "start": 140, "end": 177 }, { "text": "SMT research community", "start": 234, "end": 256 }, { "text": "SMT algorithms", "start": 293, ...	[]
Structuring Knowledge for Reference Generation: A Clustering Algorithm This paper discusses two problems that arise in the Generation of Referring Expressions: (a) numeric-valued attributes, such as size or location; (b) perspective-taking in reference. Both problems, it is argued, can be resolved if some structure is ...	{ "entities": { "keyphrase": [ { "text": "Generation", "start": 123, "end": 133 }, { "text": "Referring Expressions", "start": 137, "end": 158 }, { "text": "numeric-valued attributes", "start": 164, "end": 189 ...	[]
Answering the Question You Wish They Had Asked: The Impact of Paraphrasing for Question Answering State-of-the-art Question Answering (QA) systems are very sensitive to variations in the phrasing of an information need. Finding the preferred language for such a need is a valuable task. We investigate that claim by adop...	{ "entities": { "keyphrase": [ { "text": "Question Answering (QA) systems", "start": 115, "end": 146 }, { "text": "information need", "start": 202, "end": 218 }, { "text": "language", "start": 242, "end": 250 ...	[]
A Comparison of Tagging Strategies for Statistical Information Extraction There are several approaches that model information extraction as a token classification task, using various tagging strategies to combine multiple tokens. We describe the tagging strategies that can be found in the literature and evaluate their ...	{ "entities": { "keyphrase": [ { "text": "information extraction", "start": 114, "end": 136 }, { "text": "token classification task", "start": 142, "end": 167 }, { "text": "tagging strategies", "start": 183, "end...	[]
InfoMagnets: Making Sense of Corpus Data We introduce a new interactive corpus exploration tool called InfoMagnets. InfoMagnets aims at making exploratory corpus analysis accessible to researchers who are not experts in text mining. As evidence of its usefulness and usability, it has been used successfully in a researc...	{ "entities": { "keyphrase": [ { "text": "interactive corpus exploration tool", "start": 60, "end": 95 }, { "text": "InfoMagnets", "start": 103, "end": 114 }, { "text": "InfoMagnets", "start": 116, "end": 127 ...	[]
Polarized Unification Grammars This paper proposes a generic mathematical formalism for the combination of various structures: strings, trees, dags, graphs, and products of them. The polarization of the objects of the elementary structures controls the saturation of the final structure. This formalism is both elementar...	{ "entities": { "keyphrase": [ { "text": "mathematical formalism", "start": 61, "end": 83 }, { "text": "structures", "start": 115, "end": 125 }, { "text": "strings", "start": 127, "end": 134 }, { ...	[]
Word Vectors and Two Kinds of Similarity This paper examines what kind of similarity between words can be represented by what kind of word vectors in the vector space model. Through two experiments, three methods for constructing word vectors, i. e., LSA-based, cooccurrence-based and dictionary-based methods, were comp...	{ "entities": { "keyphrase": [ { "text": "similarity", "start": 74, "end": 84 }, { "text": "words", "start": 93, "end": 98 }, { "text": "word vectors", "start": 134, "end": 146 }, { "text": "v...	[]
Investigations on Event-Based Summarization We investigate independent and relevant event-based extractive mutli-document summarization approaches. In this paper, events are defined as event terms and associated event elements. With independent approach, we identify important contents by frequency of events. With relev...	{ "entities": { "keyphrase": [ { "text": "mutli-document summarization approaches", "start": 107, "end": 146 }, { "text": "events", "start": 163, "end": 169 }, { "text": "event terms", "start": 185, "end": 196 ...	[]
FERRET: Interactive Question-Answering for Real-World Environments This paper describes FERRET, an interactive question-answering (Q/A) system designed to address the challenges of integrating automatic Q/A applications into real-world environments. FERRET utilizes a novel approach to Q/A known as predictive questionin...	{ "entities": { "keyphrase": [ { "text": "FERRET", "start": 88, "end": 94 }, { "text": "interactive question-answering (Q/A) system", "start": 99, "end": 142 }, { "text": "automatic Q/A", "start": 193, "end": 206...	[]
Computational Analysis of Move Structures in Academic Abstracts This paper introduces a method for computational analysis of move structures in abstracts of research articles. In our approach, sentences in a given abstract are analyzed and labeled with a specific move in light of various rhetorical functions. The metho...	{ "entities": { "keyphrase": [ { "text": "computational analysis of move structures", "start": 99, "end": 140 }, { "text": "abstracts", "start": 144, "end": 153 }, { "text": "research articles", "start": 157, "en...	[]
Re-Usable Tools for Precision Machine Translation The LOGON MT demonstrator assembles independently valuable general-purpose NLP components into a machine translation pipeline that capitalizes on output quality. The demonstrator embodies an interesting combination of hand-built, symbolic resources and stochastic proces...	{ "entities": { "keyphrase": [ { "text": "LOGON MT demonstrator", "start": 54, "end": 75 }, { "text": "general-purpose NLP components", "start": 109, "end": 139 }, { "text": "machine translation pipeline", "start": 147, ...	[]
Testing The Psychological Reality of a Representational Model A research program is described in which a particular representational format for meaning is tested as broadly as possible. In this format, developed by the LNR research group at The University of California at San Diego, verbs are represented as interconnec...	{ "entities": { "keyphrase": [ { "text": "representational format for meaning", "start": 116, "end": 151 }, { "text": "verbs", "start": 284, "end": 289 }, { "text": "subpredicates", "start": 332, "end": 345 ...	[]
Fragments of a Theory of Human Plausible Reasoning The paper outlines a computational theory of human plausible reasoning constructed from analysis of people' s answers to everyday questions. Like logic, the theory is expressed in a content-independent formalism. Unlike logic, the theory specifies how different informa...	{ "entities": { "keyphrase": [ { "text": "computational theory", "start": 72, "end": 92 }, { "text": "human plausible reasoning", "start": 96, "end": 121 }, { "text": "logic", "start": 197, "end": 202 }, ...	[]
PATH-BASED AND NODE-BASED INFERENCE IN SEMANTIC NETWORKS Two styles of performing inference in semantic networks are presented and compared. Path-based inference allows an arc or a path of arcs between two given nodes to be inferred from the existence of another specified path between the same two nodes. Path-based inf...	{ "entities": { "keyphrase": [ { "text": "inference", "start": 82, "end": 91 }, { "text": "semantic networks", "start": 95, "end": 112 }, { "text": "Path-based inference", "start": 141, "end": 161 }, ...	[]
ON FROFF: A TEXT PROCESSING SYSTEM FOR ENGLISH TEXTS AND FIGURES In order to meet the needs of a publication of papers in English, many systems to run off texts have been developed. In this paper, we report a system FROFF which can make a fair copy of not only texts but also graphs and tables indispensable to our paper...	{ "entities": { "keyphrase": [ { "text": "FROFF", "start": 216, "end": 221 }, { "text": "fonts", "start": 340, "end": 345 }, { "text": "character", "start": 364, "end": 373 }, { "text": "typin...	[]
ATNS USED AS A PROCEDURAL DIALOG MODEL An attempt has been made to use an Augmented Transition Network as a procedural dialog model. The development of such a model appears to be important in several respects: as a device to represent and to use different dialog schemata proposed in empirical conversation analysis; as ...	{ "entities": { "keyphrase": [ { "text": "Augmented Transition Network", "start": 74, "end": 102 }, { "text": "dialog model", "start": 119, "end": 131 }, { "text": "model", "start": 159, "end": 164 }, ...	[]
Metaphor-A Key to Extensible Semantic Analysis Interpreting metaphors is an integral and inescapable process in human understanding of natural language. This paper discusses a method of analyzing metaphors based on the existence of a small number of generalized metaphor mappings. Each generalized metaphor contains a re...	{ "entities": { "keyphrase": [ { "text": "metaphors", "start": 60, "end": 69 }, { "text": "human understanding of natural language", "start": 112, "end": 151 }, { "text": "method of analyzing metaphors", "start": 176, ...	[]
Expanding the Horizons of Natural Language Interfaces Current natural language interfaces have concentrated largely on determining the literal meaning of input from their users. While such decoding is an essential underpinning, much recent work suggests that natural language interfaces will never appear cooperative or ...	{ "entities": { "keyphrase": [ { "text": "natural language interfaces", "start": 62, "end": 89 }, { "text": "meaning", "start": 143, "end": 150 }, { "text": "input", "start": 154, "end": 159 }, { ...	[]

Activity detection for information access to oral communication Oral communication is ubiquitous and carries important information yet it is also time consuming to document. Given the development of storage media and networks one could just record and store a conversation for documentation. The question is, however, ho...

{ "entities": { "keyphrase": [ { "text": "Oral communication", "start": 64, "end": 82 }, { "text": "storage media and networks", "start": 199, "end": 225 }, { "text": "conversation", "start": 260, "end": 272 ...

[]

Dialogue Interaction with the DARPA Communicator Infrastructure: The Development of Useful Software To support engaging human users in robust, mixed-initiative speech dialogue interactions which reach beyond current capabilities in dialogue systems, the DARPA Communicator program [1] is funding the development of a dis...

{ "entities": { "keyphrase": [ { "text": "mixed-initiative speech dialogue interactions", "start": 143, "end": 188 }, { "text": "dialogue systems", "start": 232, "end": 248 }, { "text": "DARPA Communicator program", "sta...

[]

Interlingua-Based Broad-Coverage Korean-to-English Translation in CCLING At MIT Lincoln Laboratory, we have been developing a Korean-to-English machine translation system CCLINC (Common Coalition Language System at Lincoln Laboratory). The CCLINC Korean-to-English translation system consists of two core modules, langua...

{ "entities": { "keyphrase": [ { "text": "Korean-to-English machine translation system", "start": 126, "end": 170 }, { "text": "CCLINC (Common Coalition Language System at Lincoln Laboratory)", "start": 171, "end": 234 }, { "tex...

[]

Is That Your Final Answer? The purpose of this research is to test the efficacy of applying automated evaluation techniques, originally devised for the evaluation of human language learners, to the output of machine translation (MT) systems. We believe that these evaluation techniques will provide information about bot...

{ "entities": { "keyphrase": [ { "text": "automated evaluation techniques", "start": 92, "end": 123 }, { "text": "human language learners", "start": 166, "end": 189 }, { "text": "output", "start": 198, "end": 204...

[]

Listen-Communicate-Show (LCS): Spoken Language Command of Agent-based Remote Information Access Listen-Communicate-Show (LCS) is a new paradigm for human interaction with data sources. We integrate a spoken language understanding system with intelligent mobile agents that mediate between users and information sources. ...

{ "entities": { "keyphrase": [ { "text": "Listen-Communicate-Show (LCS)", "start": 96, "end": 125 }, { "text": "human interaction with data sources", "start": 148, "end": 183 }, { "text": "spoken language understanding system", ...

[]

On Combining Language Models: Oracle Approach In this paper, we address the problem of combining several language models (LMs). We find that simple interpolation methods, like log-linear and linear interpolation, improve the performance but fall short of the performance of an oracle. The oracle knows the reference word...

{ "entities": { "keyphrase": [ { "text": "language models (LMs)", "start": 105, "end": 126 }, { "text": "interpolation methods", "start": 148, "end": 169 }, { "text": "log-linear and linear interpolation", "start": 176, ...

[]

Towards an Intelligent Multilingual Keyboard System This paper proposes a practical approach employing n-gram models and error-correction rules for Thai key prediction and Thai-English language identification. The paper also proposes rule-reduction algorithm applying mutual information to reduce the error-correction ru...

{ "entities": { "keyphrase": [ { "text": "n-gram models", "start": 103, "end": 116 }, { "text": "error-correction rules", "start": 121, "end": 143 }, { "text": "Thai key prediction", "start": 148, "end": 167 ...

[]

SPoT: A Trainable Sentence Planner Sentence planning is a set of inter-related but distinct tasks, one of which is sentence scoping, i. e. the choice of syntactic structure for elementary speech acts and the decision of how to combine them into one or more sentences. In this paper, we present SPoT, a sentence planner, ...

{ "entities": { "keyphrase": [ { "text": "Sentence planning", "start": 35, "end": 52 }, { "text": "sentence scoping", "start": 115, "end": 131 }, { "text": "syntactic structure", "start": 153, "end": 172 },...

[]

Low-cost, High-performance Translation Retrieval: Dumber is Better In this paper, we compare the relative effects of segment order, segmentation and segment contiguity on the retrieval performance of a translation memory system. We take a selection of both bag-of-words and segment order-sensitive string comparison meth...

{ "entities": { "keyphrase": [ { "text": "segment order", "start": 117, "end": 130 }, { "text": "segmentation", "start": 132, "end": 144 }, { "text": "segment contiguity", "start": 149, "end": 167 }, ...

[]

Guided Parsing of Range Concatenation Languages The theoretical study of the range concatenation grammar [RCG] formalism has revealed many attractive properties which may be used in NLP. In particular, range concatenation languages [RCL] can be parsed in polynomial time and many classical grammatical formalisms can be ...

{ "entities": { "keyphrase": [ { "text": "range concatenation grammar [RCG] formalism", "start": 77, "end": 120 }, { "text": "NLP", "start": 182, "end": 185 }, { "text": "range concatenation languages [RCL]", "start": 20...

[]

Extracting Paraphrases from a Parallel Corpus While paraphrasing is critical both for interpretation and generation of natural language, current systems use manual or semi-automatic methods to collect paraphrases. We present an unsupervised learning algorithm for identification of paraphrases from a corpus of multiple ...

{ "entities": { "keyphrase": [ { "text": "paraphrasing", "start": 52, "end": 64 }, { "text": "interpretation and generation of natural language", "start": 86, "end": 135 }, { "text": "paraphrases", "start": 201, ...

[]

Alternative Phrases and Natural Language Information Retrieval This paper presents a formal analysis for a large class of words called alternative markers, which includes other (than), such (as), and besides. These words appear frequently enough in dialog to warrant serious attention, yet present natural language searc...

{ "entities": { "keyphrase": [ { "text": "formal analysis", "start": 85, "end": 100 }, { "text": "words", "start": 122, "end": 127 }, { "text": "alternative markers", "start": 135, "end": 154 }, { ...

[]

Extending Lambek grammars: a logical account of minimalist grammars We provide a logical definition of Minimalist grammars, that are Stabler' s formalization of Chomsky' s minimalist program. Our logical definition leads to a neat relation to categorial grammar, (yielding a treatment of Montague semantics), a parsing-a...

{ "entities": { "keyphrase": [ { "text": "logical definition", "start": 81, "end": 99 }, { "text": "Minimalist grammars", "start": 103, "end": 122 }, { "text": "Stabler' s formalization", "start": 133, "end": 157...

[]

Evaluating a Trainable Sentence Planner for a Spoken Dialogue System Techniques for automatically training modules of a natural language generator have recently been proposed, but a fundamental concern is whether the quality of utterances produced with trainable components can compete with hand-crafted template-based o...

{ "entities": { "keyphrase": [ { "text": "Techniques for automatically training", "start": 69, "end": 106 }, { "text": "natural language generator", "start": 120, "end": 146 }, { "text": "quality", "start": 217, ...

[]

Using Machine Learning Techniques to Interpret WH-questions We describe a set of supervised machine learning experiments centering on the construction of statistical models of WH-questions. These models, which are built from shallow linguistic features of questions, are employed to predict target variables which repres...

{ "entities": { "keyphrase": [ { "text": "supervised machine learning", "start": 81, "end": 108 }, { "text": "statistical models", "start": 154, "end": 172 }, { "text": "WH-questions", "start": 176, "end": 188 ...

[]

Effective Utterance Classification with Unsupervised Phonotactic Models This paper describes a method for utterance classification that does not require manual transcription of training data. The method combines domain independent acoustic models with off-the-shelf classifiers to give utterance classification performan...

{ "entities": { "keyphrase": [ { "text": "utterance classification", "start": 106, "end": 130 }, { "text": "manual transcription", "start": 153, "end": 173 }, { "text": "training data", "start": 177, "end": 190 ...

[]

In Question Answering, Two Heads Are Better Than One Motivated by the success of ensemble methods in machine learning and other areas of natural language processing, we developed a multi-strategy and multi-source approach to question answering which is based on combining the results from different answering agents sear...

{ "entities": { "keyphrase": [ { "text": "ensemble methods", "start": 81, "end": 97 }, { "text": "machine learning", "start": 101, "end": 117 }, { "text": "natural language processing", "start": 137, "end": 164 ...

[]

Semantic Coherence Scoring Using an Ontology In this paper we present ONTOSCORE, a system for scoring sets of concepts on the basis of an ontology. We apply our system to the task of scoring alternative speech recognition hypotheses (SRH) in terms of their semantic coherence. We conducted an annotation experiment and s...

{ "entities": { "keyphrase": [ { "text": "ONTOSCORE", "start": 70, "end": 79 }, { "text": "concepts", "start": 110, "end": 118 }, { "text": "ontology", "start": 138, "end": 146 }, { "text": "s...

[]

Statistical Phrase-Based Translation We propose a new phrase-based translation model and decoding algorithm that enables us to evaluate and compare several, previously proposed phrase-based translation models. Within our framework, we carry out a large number of experiments to understand better and explain why phrase-b...

{ "entities": { "keyphrase": [ { "text": "phrase-based translation model", "start": 54, "end": 84 }, { "text": "decoding algorithm", "start": 89, "end": 107 }, { "text": "phrase-based translation models", "start": 177, ...

[]

A Generative Probabilistic OCR Model for NLP Applications In this paper, we introduce a generative probabilistic optical character recognition (OCR) model that describes an end-to-end process in the noisy channel framework, progressing from generation of true text through its transformation into the noisy output of an ...

{ "entities": { "keyphrase": [ { "text": "generative probabilistic optical character recognition (OCR) model", "start": 88, "end": 154 }, { "text": "noisy channel framework", "start": 199, "end": 222 }, { "text": "true text", ...

[]

Statistical Sentence Condensation using Ambiguity Packing and Stochastic Disambiguation Methods for Lexical-Functional Grammar We present an application of ambiguity packing and stochastic disambiguation techniques for Lexical-Functional Grammars (LFG) to the domain of sentence condensation. Our system incorporates a l...

{ "entities": { "keyphrase": [ { "text": "ambiguity packing and stochastic disambiguation techniques", "start": 156, "end": 214 }, { "text": "Lexical-Functional Grammars (LFG)", "start": 219, "end": 252 }, { "text": "sentence co...

[]

Feature-Rich Part-of-Speech Tagging with a Cyclic Dependency Network We present a new part-of-speech tagger that demonstrates the following ideas: (i) explicit use of both preceding and following tag contexts via a dependency network representation, (ii) broad use of lexical features, including jointly conditioning on ...

{ "entities": { "keyphrase": [ { "text": "part-of-speech tagger", "start": 86, "end": 107 }, { "text": "tag contexts", "start": 196, "end": 208 }, { "text": "dependency network representation", "start": 215, "end...

[]

Getting More Mileage from Web Text Sources for Conversational Speech Language Modeling using Class-Dependent Mixtures Sources of training data suitable for language modeling of conversational speech are limited. In this paper, we show how training data can be supplemented with text from the web filtered to match the st...

{ "entities": { "keyphrase": [ { "text": "training data", "start": 129, "end": 142 }, { "text": "language modeling", "start": 156, "end": 173 }, { "text": "conversational speech", "start": 177, "end": 198 }...

[]

Adaptation Using Out-of-Domain Corpus within EBMT In order to boost the translation quality of EBMT based on a small-sized bilingual corpus, we use an out-of-domain bilingual corpus and, in addition, the language model of an in-domain monolingual corpus. We conducted experiments with an EBMT system. The two evaluation ...

{ "entities": { "keyphrase": [ { "text": "translation quality", "start": 72, "end": 91 }, { "text": "EBMT", "start": 95, "end": 99 }, { "text": "bilingual corpus", "start": 123, "end": 139 }, { ...

[]

Unsupervised Learning of Morphology for English and Inuktitut We describe a simple unsupervised technique for learning morphology by identifying hubs in an automaton. For our purposes, a hub is a node in a graph with in-degree greater than one and out-degree greater than one. We create a word-trie, transform it into a ...

{ "entities": { "keyphrase": [ { "text": "unsupervised technique", "start": 83, "end": 105 }, { "text": "morphology", "start": 119, "end": 129 }, { "text": "hubs", "start": 145, "end": 149 }, { ...

[]

Word Alignment with Cohesion Constraint We present a syntax-based constraint for word alignment, known as the cohesion constraint. It requires disjoint English phrases to be mapped to non-overlapping intervals in the French sentence. We evaluate the utility of this constraint in two different algorithms. The results sh...

{ "entities": { "keyphrase": [ { "text": "syntax-based constraint", "start": 53, "end": 76 }, { "text": "word alignment", "start": 81, "end": 95 }, { "text": "cohesion constraint", "start": 110, "end": 129 ...

[]

Bootstrapping for Named Entity Tagging Using Concept-based Seeds A novel bootstrapping approach to Named Entity (NE) tagging using concept-based seeds and successive learners is presented. This approach only requires a few common noun or pronoun seeds that correspond to the concept for the targeted NE, e. g. he/she/man...

{ "entities": { "keyphrase": [ { "text": "bootstrapping approach", "start": 73, "end": 95 }, { "text": "Named Entity (NE) tagging", "start": 99, "end": 124 }, { "text": "concept-based seeds", "start": 131, "end":...

[]

A Phrase-Based Unigram Model for Statistical Machine Translation In this paper, we describe a phrase-based unigram model for statistical machine translation that uses a much simpler set of model parameters than similar phrase-based models. The units of translation are blocks-pairs of phrases. During decoding, we use a ...

{ "entities": { "keyphrase": [ { "text": "phrase-based unigram model", "start": 94, "end": 120 }, { "text": "statistical machine translation", "start": 125, "end": 156 }, { "text": "model parameters", "start": 189, ...

[]

Cooperative Model Based Language Understanding in Dialogue In this paper, we propose a novel Cooperative Model for natural language understanding in a dialogue system. We build this based on both Finite State Model (FSM) and Statistical Learning Model (SLM). FSM provides two strategies for language understanding and ha...

{ "entities": { "keyphrase": [ { "text": "Cooperative Model", "start": 93, "end": 110 }, { "text": "natural language understanding", "start": 115, "end": 145 }, { "text": "dialogue system", "start": 151, "end": 1...

[]

JAVELIN: A Flexible, Planner-Based Architecture for Question Answering The JAVELIN system integrates a flexible, planning-based architecture with a variety of language processing modules to provide an open-domain question answering capability on free text. The demonstration will focus on how JAVELIN processes questions...

{ "entities": { "keyphrase": [ { "text": "JAVELIN system", "start": 75, "end": 89 }, { "text": "planning-based architecture", "start": 113, "end": 140 }, { "text": "language processing modules", "start": 159, "en...

[]

Using Predicate-Argument Structures for Information Extraction In this paper we present a novel, customizable: IE paradigm that takes advantage of predicate-argument structures. We also introduce a new way of automatically identifying predicate argument structures, which is central to our IE paradigm. It is based on: (...

{ "entities": { "keyphrase": [ { "text": "IE paradigm", "start": 111, "end": 122 }, { "text": "predicate-argument structures", "start": 147, "end": 176 }, { "text": "predicate argument structures", "start": 235, ...

[]

Hierarchical Directed Acyclic Graph Kernel: Methods for Structured Natural Language Data This paper proposes the Hierarchical Directed Acyclic Graph (HDAG) Kernel for structured natural language data. The HDAG Kernel directly accepts several levels of both chunks and their relations, and then efficiently computes the w...

{ "entities": { "keyphrase": [ { "text": "Hierarchical Directed Acyclic Graph (HDAG) Kernel", "start": 113, "end": 162 }, { "text": "structured natural language data", "start": 167, "end": 199 }, { "text": "HDAG Kernel", ...

[]

Clustering Polysemic Subcategorization Frame Distributions Semantically Previous research has demonstrated the utility of clustering in inducing semantic verb classes from undisambiguated corpus data. We describe a new approach which involves clustering subcategorization frame (SCF) distributions using the Information ...

{ "entities": { "keyphrase": [ { "text": "clustering", "start": 122, "end": 132 }, { "text": "semantic verb classes", "start": 145, "end": 166 }, { "text": "corpus data", "start": 188, "end": 199 }, {...

[]

A Machine Learning Approach to Pronoun Resolution in Spoken Dialogue We apply a decision tree based approach to pronoun resolution in spoken dialogue. Our system deals with pronouns with NP-and non-NP-antecedents. We present a set of features designed for pronoun resolution in spoken dialogue and determine the most pro...

{ "entities": { "keyphrase": [ { "text": "decision tree based approach", "start": 80, "end": 108 }, { "text": "pronoun resolution", "start": 112, "end": 130 }, { "text": "spoken dialogue", "start": 134, "end": 14...

[]

Optimizing Story Link Detection is not Equivalent to Optimizing New Event Detection Link detection has been regarded as a core technology for the Topic Detection and Tracking tasks of new event detection. In this paper we formulate story link detection and new event detection as information retrieval task and hypothesi...

{ "entities": { "keyphrase": [ { "text": "Link detection", "start": 84, "end": 98 }, { "text": "Topic Detection and Tracking tasks", "start": 146, "end": 180 }, { "text": "new event detection", "start": 184, "end...

[]

Corpus-based Discourse Understanding in Spoken Dialogue Systems This paper concerns the discourse understanding process in spoken dialogue systems. This process enables the system to understand user utterances based on the context of a dialogue. Since multiple candidates for the understanding result can be obtained for...

{ "entities": { "keyphrase": [ { "text": "discourse understanding process", "start": 88, "end": 119 }, { "text": "spoken dialogue systems", "start": 123, "end": 146 }, { "text": "user utterances", "start": 194, "...

[]

Flexible Guidance Generation using User Model in Spoken Dialogue Systems We address appropriate user modeling in order to generate cooperative responses to each user in spoken dialogue systems. Unlike previous studies that focus on user' s knowledge or typical kinds of users, the user model we propose is more comprehen...

{ "entities": { "keyphrase": [ { "text": "user modeling", "start": 96, "end": 109 }, { "text": "cooperative responses", "start": 131, "end": 152 }, { "text": "user", "start": 161, "end": 165 }, { ...

[]

Unsupervised Learning of Arabic Stemming using a Parallel Corpus This paper presents an unsupervised learning approach to building a non-English (Arabic) stemmer. The stemming model is based on statistical machine translation and it uses an English stemmer and a small (10K sentences) parallel corpus as its sole trainin...

{ "entities": { "keyphrase": [ { "text": "unsupervised learning approach", "start": 88, "end": 118 }, { "text": "non-English (Arabic) stemmer", "start": 133, "end": 161 }, { "text": "stemming model", "start": 167, ...

[]

Language Model Based Arabic Word Segmentation We approximate Arabic' s rich morphology by a model that a word consists of a sequence of morphemes in the pattern prefix *-stem-suffix * (* denotes zero or more occurrences of a morpheme). Our method is seeded by a small manually segmented Arabic corpus and uses it to boot...

{ "entities": { "keyphrase": [ { "text": "Arabic' s rich morphology", "start": 61, "end": 86 }, { "text": "model", "start": 92, "end": 97 }, { "text": "word", "start": 105, "end": 109 }, { "te...

[]

Exploiting Parallel Texts for Word Sense Disambiguation: An Empirical Study A central problem of word sense disambiguation (WSD) is the lack of manually sense-tagged data required for supervised learning. In this paper, we evaluate an approach to automatically acquire sense-tagged training data from English-Chinese par...

{ "entities": { "keyphrase": [ { "text": "word sense disambiguation (WSD)", "start": 97, "end": 128 }, { "text": "manually sense-tagged data", "start": 144, "end": 170 }, { "text": "supervised learning", "start": 184, ...

[]

Towards a Resource for Lexical Semantics: A Large German Corpus with Extensive Semantic Annotation We describe the ongoing construction of a large, semantically annotated corpus resource as reliable basis for the large-scale acquisition of word-semantic information, e. g. the construction of domain-independent lexica. ...

{ "entities": { "keyphrase": [ { "text": "semantically annotated corpus", "start": 148, "end": 177 }, { "text": "acquisition of word-semantic information", "start": 225, "end": 265 }, { "text": "domain-independent lexica", ...

[]

Towards a Model of Face-to-Face Grounding We investigate the verbal and nonverbal means for grounding, and propose a design for embodied conversational agents that relies on both kinds of signals to establish common ground in human-computer interaction. We analyzed eye gaze, head nods and attentional focus in the conte...

{ "entities": { "keyphrase": [ { "text": "verbal and nonverbal means", "start": 61, "end": 87 }, { "text": "grounding", "start": 92, "end": 101 }, { "text": "embodied conversational agents", "start": 128, "end": ...

[]

Comparison between CFG filtering techniques for LTAG and HPSG An empirical comparison of CFG filtering techniques for LTAG and HPSG is presented. We demonstrate that an approximation of HPSG produces a more effective CFG filter than that of LTAG. We also investigate the reason for that difference.

{ "entities": { "keyphrase": [ { "text": "CFG filtering techniques", "start": 89, "end": 113 }, { "text": "LTAG", "start": 118, "end": 122 }, { "text": "HPSG", "start": 127, "end": 131 }, { "t...

[]

Lower and higher estimates of the number of & quot; true analogies & quot; between sentences contained in a large multilingual corpus The reality of analogies between words is refuted by noone (e. g., I walked is to to walk as I laughed is to to laugh, noted I walked: to walk:: I laughed: to laugh). But computational l...

{ "entities": { "keyphrase": [ { "text": "analogies between words", "start": 149, "end": 172 }, { "text": "computational linguists", "start": 305, "end": 328 }, { "text": "analogies between sentences", "start": 360, ...

[]

Evaluating Multiple Aspects of Coherence in Student Essays CriterionSM Online Essay Evaluation Service includes a capability that labels sentences in student writing with essay-based discourse elements (e. g., thesis statements). We describe a new system that enhances Criterion' s capability, by evaluating multiple asp...

{ "entities": { "keyphrase": [ { "text": "CriterionSM Online Essay Evaluation Service", "start": 59, "end": 102 }, { "text": "sentences", "start": 137, "end": 146 }, { "text": "writing", "start": 158, "end": 165 ...

[]

Improving Multilingual Summarization: Using Redundancy in the Input to Correct MT errors In this paper, we use the information redundancy in multilingual input to correct errors in machine translation and thus improve the quality of multilingual summaries. We consider the case of multi-document summarization, where the...

{ "entities": { "keyphrase": [ { "text": "information redundancy", "start": 115, "end": 137 }, { "text": "multilingual input", "start": 141, "end": 159 }, { "text": "machine translation", "start": 181, "end": 200...

[]

A Maximum Entropy Word Aligner for Arabic-English Machine Translation This paper presents a maximum entropy word alignment algorithm for Arabic-English based on supervised training data. We demonstrate that it is feasible to create training material for problems in machine translation and that a mixture of supervised a...

{ "entities": { "keyphrase": [ { "text": "maximum entropy word alignment algorithm", "start": 92, "end": 132 }, { "text": "Arabic-English", "start": 137, "end": 151 }, { "text": "supervised training data", "start": 161, ...

[]

Translating with non-contiguous phrases This paper presents a phrase-based statistical machine translation method, based on non-contiguous phrases, i. e. phrases with gaps. A method for producing such phrases from a word-aligned corpora is proposed. A statistical translation model is also presented that deals such phra...

{ "entities": { "keyphrase": [ { "text": "phrase-based statistical machine translation method", "start": 62, "end": 113 }, { "text": "non-contiguous phrases", "start": 124, "end": 146 }, { "text": "phrases", "start": 154...

[]

Automatically Evaluating Answers to Definition Questions Following recent developments in the automatic evaluation of machine translation and document summarization, we present a similar approach, implemented in a measure called POURPRE, for automatically evaluating answers to definition questions. Until now, the only ...

{ "entities": { "keyphrase": [ { "text": "automatic evaluation", "start": 94, "end": 114 }, { "text": "machine translation", "start": 118, "end": 137 }, { "text": "document summarization", "start": 142, "end": 16...

[]

Pattern Visualization for Machine Translation Output We describe a method for identifying systematic patterns in translation data using part-of-speech tag sequences. We incorporate this analysis into a diagnostic tool intended for developers of machine translation systems, and demonstrate how our application can be use...

{ "entities": { "keyphrase": [ { "text": "patterns", "start": 101, "end": 109 }, { "text": "translation data", "start": 113, "end": 129 }, { "text": "part-of-speech tag sequences", "start": 136, "end": 164 ...

[]

Evaluating the Word Sense Disambiguation Performance of Statistical Machine Translation We present the first known empirical test of an increasingly common speculative claim, by evaluating a representative Chinese-to-English SMT model directly on word sense disambiguation performance, using standard WSD evaluation meth...

{ "entities": { "keyphrase": [ { "text": "empirical test", "start": 115, "end": 129 }, { "text": "Chinese-to-English SMT model", "start": 206, "end": 234 }, { "text": "word sense disambiguation performance", "start": 247...

[]

Statistical Machine Translation Part I: Hands-On Introduction Statistical machine translation (SMT) is currently one of the hot spots in natural language processing. Over the last few years dramatic improvements have been made, and a number of comparative evaluations have shown, that SMT gives competitive results to ru...

{ "entities": { "keyphrase": [ { "text": "Statistical machine translation (SMT)", "start": 62, "end": 99 }, { "text": "natural language processing", "start": 137, "end": 164 }, { "text": "SMT", "start": 285, "end...

[]

Harvesting the Bitexts of the Laws of Hong Kong From the Web In this paper we present our recent work on harvesting English-Chinese bitexts of the laws of Hong Kong from the Web and aligning them to the subparagraph level via utilizing the numbering system in the legal text hierarchy. Basic methodology and practical te...

{ "entities": { "keyphrase": [ { "text": "English-Chinese bitexts", "start": 116, "end": 139 }, { "text": "Web", "start": 174, "end": 177 }, { "text": "subparagraph", "start": 203, "end": 215 }, { ...

[]

Using Machine Translation Evaluation Techniques to Determine Sentence-level Semantic Equivalence The task of machine translation (MT) evaluation is closely related to the task of sentence-level semantic equivalence classification. This paper investigates the utility of applying standard MT evaluation methods (BLEU, NIS...

{ "entities": { "keyphrase": [ { "text": "machine translation (MT) evaluation", "start": 109, "end": 144 }, { "text": "sentence-level semantic equivalence classification", "start": 179, "end": 229 }, { "text": "MT evaluation met...

[]

Automatic generation of paraphrases to be used as translation references in objective evaluation measures of machine translation We propose a method that automatically generates paraphrase sets from seed sentences to be used as reference sets in objective machine translation evaluation measures like BLEU and NIST. We m...

{ "entities": { "keyphrase": [ { "text": "paraphrase", "start": 178, "end": 188 }, { "text": "seed sentences", "start": 199, "end": 213 }, { "text": "reference sets", "start": 228, "end": 242 }, { ...

[]

Annotating Honorifics Denoting Social Ranking of Referents This paper proposes an annotating scheme that encodes honorifics (respectful words). Honorifics are used extensively in Japanese, reflecting the social relationship (e. g. social ranks and age) of the referents. This referential information is vital for resolvi...

{ "entities": { "keyphrase": [ { "text": "annotating scheme", "start": 82, "end": 99 }, { "text": "honorifics", "start": 113, "end": 123 }, { "text": "Honorifics", "start": 144, "end": 154 }, { ...

[]

Discriminative Reranking for Natural Language Parsing This article considers approaches which rerank the output of an existing probabilistic parser. The base parser produces a set of candidate parses for each input sentence, with associated probabilities that define an initial ranking of these parses. A second model th...

{ "entities": { "keyphrase": [ { "text": "probabilistic parser", "start": 127, "end": 147 }, { "text": "parser", "start": 158, "end": 164 }, { "text": "candidate parses", "start": 183, "end": 199 }, {...

[]

Improving Machine Translation Performance by Exploiting Non-Parallel Corpora We present a novel method for discovering parallel sentences in comparable, non-parallel corpora. We train a maximum entropy classifier that, given a pair of sentences, can reliably determine whether or not they are translations of each other....

{ "entities": { "keyphrase": [ { "text": "discovering parallel sentences", "start": 107, "end": 137 }, { "text": "comparable, non-parallel corpora", "start": 141, "end": 173 }, { "text": "maximum entropy classifier", "st...

[]

Scaling Phrase-Based Statistical Machine Translation to Larger Corpora and Longer Phrases In this paper we describe a novel data structure for phrase-based statistical machine translation which allows for the retrieval of arbitrarily long phrases while simultaneously using less memory than is required by current decode...

{ "entities": { "keyphrase": [ { "text": "data structure", "start": 124, "end": 138 }, { "text": "phrase-based statistical machine translation", "start": 143, "end": 187 }, { "text": "retrieval", "start": 209, "e...

[]

Dependency Treelet Translation: Syntactically Informed Phrasal SMT We describe a novel approach to statistical machine translation that combines syntactic information in the source language with recent advances in phrasal translation. This method requires a source-language dependency parser, target language word segmen...

{ "entities": { "keyphrase": [ { "text": "statistical machine translation", "start": 99, "end": 130 }, { "text": "syntactic information", "start": 145, "end": 166 }, { "text": "source language", "start": 174, "en...

[]

Word Sense Disambiguation vs. Statistical Machine Translation We directly investigate a subject of much recent debate: do word sense disambigation models help statistical machine translation quality? We present empirical results casting doubt on this common, but unproved, assumption. Using a state-of-the-art Chinese wo...

{ "entities": { "keyphrase": [ { "text": "word sense disambigation models", "start": 122, "end": 153 }, { "text": "statistical machine translation", "start": 159, "end": 190 }, { "text": "quality", "start": 191, ...

[]

Machine Translation Using Probabilistic Synchronous Dependency Insertion Grammars Syntax-based statistical machine translation (MT) aims at applying statistical models to structured data. In this paper, we present a syntax-based statistical machine translation system based on a probabilistic synchronous dependency inse...

{ "entities": { "keyphrase": [ { "text": "Syntax-based statistical machine translation (MT)", "start": 82, "end": 131 }, { "text": "statistical models", "start": 149, "end": 167 }, { "text": "structured data", "start": 1...

[]

A Localized Prediction Model for Statistical Machine Translation In this paper, we present a novel training method for a localized phrase-based prediction model for statistical machine translation (SMT). The model predicts blocks with orientation to handle local phrase re-ordering. We use a maximum likelihood criterion...

{ "entities": { "keyphrase": [ { "text": "training method", "start": 99, "end": 114 }, { "text": "localized phrase-based prediction model", "start": 121, "end": 160 }, { "text": "statistical machine translation (SMT)", "...

[]

Paraphrasing with Bilingual Parallel Corpora Previous work has used monolingual parallel corpora to extract and generate paraphrases. We show that this task can be done using bilingual parallel corpora, a much more commonly available resource. Using alignment techniques from phrase-based statistical machine translation...

{ "entities": { "keyphrase": [ { "text": "monolingual parallel corpora", "start": 68, "end": 96 }, { "text": "paraphrases", "start": 121, "end": 132 }, { "text": "bilingual parallel corpora", "start": 175, "end":...

[]

Dependency-Based Statistical Machine Translation We present a Czech-English statistical machine translation system which performs tree-to-tree translation of dependency structures. The only bilingual resource required is a sentence-aligned parallel corpus. All other resources are monolingual. We also refer to an evalua...

{ "entities": { "keyphrase": [ { "text": "Czech-English statistical machine translation system", "start": 62, "end": 114 }, { "text": "tree-to-tree translation", "start": 130, "end": 154 }, { "text": "dependency structures", ...

[]

Word Sense Induction: Triplet-Based Clustering and Automatic Evaluation In this paper a novel solution to automatic and unsupervised word sense induction (WSI) is introduced. It represents an instantiation of the one sense per collocation observation (Gale et al., 1992). Like most existing approaches it utilizes cluste...

{ "entities": { "keyphrase": [ { "text": "unsupervised word sense induction (WSI)", "start": 120, "end": 159 }, { "text": "one sense per collocation observation", "start": 213, "end": 250 }, { "text": "clustering of word co-occu...

[]

Addressee Identification in Face-to-Face Meetings We present results on addressee identification in four-participants face-to-face meetings using Bayesian Network and Naive Bayes classifiers. First, we investigate how well the addressee of a dialogue act can be predicted based on gaze, utterance and conversational cont...

{ "entities": { "keyphrase": [ { "text": "addressee identification", "start": 72, "end": 96 }, { "text": "four-participants face-to-face meetings", "start": 100, "end": 139 }, { "text": "Bayesian Network", "start": 146, ...

[]

CDER: Efficient MT Evaluation Using Block Movements Most state-of-the-art evaluation measures for machine translation assign high costs to movements of word blocks. In many cases though such movements still result in correct or almost correct sentences. In this paper, we will present a new evaluation measure which expl...

{ "entities": { "keyphrase": [ { "text": "evaluation measures", "start": 74, "end": 93 }, { "text": "machine translation", "start": 98, "end": 117 }, { "text": "costs", "start": 130, "end": 135 }, { ...

[]

Automatic Segmentation of Multiparty Dialogue In this paper, we investigate the problem of automatically predicting segment boundaries in spoken multiparty dialogue. We extend prior work in two ways. We first apply approaches that have been proposed for predicting top-level topic shifts to the problem of identifying su...

{ "entities": { "keyphrase": [ { "text": "segment boundaries", "start": 116, "end": 134 }, { "text": "spoken multiparty dialogue", "start": 138, "end": 164 }, { "text": "predicting top-level topic shifts", "start": 254, ...

[]

Ensemble Methods for Unsupervised WSD Combination methods are an effective way of improving system performance. This paper examines the benefits of system combination for unsupervised WSD. We investigate several voting-and arbiter-based combination strategies over a diverse pool of unsupervised WSD systems. Our combina...

{ "entities": { "keyphrase": [ { "text": "Combination methods", "start": 38, "end": 57 }, { "text": "system performance", "start": 92, "end": 110 }, { "text": "system combination", "start": 148, "end": 166 ...

[]

An Improved Redundancy Elimination Algorithm for Underspecified Representations We present an efficient algorithm for the redundancy elimination problem: Given an underspecified semantic representation (USR) of a scope ambiguity, compute an USR with fewer mutually equivalent readings. The algorithm operates on underspe...

{ "entities": { "keyphrase": [ { "text": "redundancy elimination problem", "start": 122, "end": 152 }, { "text": "underspecified semantic representation (USR)", "start": 163, "end": 207 }, { "text": "scope ambiguity", "s...

[]

Using Machine Learning Techniques to Build a Comma Checker for Basque In this paper, we describe the research using machine learning techniques to build a comma checker to be integrated in a grammar checker for Basque. After several experiments, and trained with a little corpus of 100, 000 words, the system guesses cor...

{ "entities": { "keyphrase": [ { "text": "machine learning techniques", "start": 116, "end": 143 }, { "text": "comma checker", "start": 155, "end": 168 }, { "text": "grammar checker", "start": 191, "end": 206 ...

[]

Unsupervised Relation Disambiguation Using Spectral Clustering This paper presents an unsupervised learning approach to disambiguate various relations between named entities by use of various lexical and syntactic features from the contexts. It works by calculating eigenvectors of an adjacency graph' s Laplacian to rec...

{ "entities": { "keyphrase": [ { "text": "unsupervised learning approach", "start": 86, "end": 116 }, { "text": "named entities", "start": 159, "end": 173 }, { "text": "lexical and syntactic features", "start": 192, ...

[]

Automatic Construction of Polarity-tagged Corpus from HTML Documents This paper proposes a novel method of building polarity-tagged corpus from HTML documents. The characteristics of this method is that it is fully automatic and can be applied to arbitrary HTML documents. The idea behind our method is to utilize certai...

{ "entities": { "keyphrase": [ { "text": "polarity-tagged corpus", "start": 116, "end": 138 }, { "text": "HTML documents", "start": 144, "end": 158 }, { "text": "HTML documents", "start": 257, "end": 271 },...

[]

Intelligent Access to Text: Integrating Information Extraction Technology into Text Browsers In this paper we show how two standard outputs from information extraction (IE) systems-named entity annotations and scenario templates-can be used to enhance access to text collections via a standard text browser. We describe ...

{ "entities": { "keyphrase": [ { "text": "information extraction (IE) systems", "start": 145, "end": 180 }, { "text": "named entity annotations", "start": 181, "end": 205 }, { "text": "scenario templates", "start": 210, ...

[]

Natural Language Generation in Dialog Systems Recent advances in Automatic Speech Recognition technology have put the goal of naturally sounding dialog systems within reach. However, the improved speech recognition has brought to light a new problem: as dialog systems understand more of what the user tells them, they n...

{ "entities": { "keyphrase": [ { "text": "Automatic Speech Recognition technology", "start": 65, "end": 104 }, { "text": "dialog systems", "start": 145, "end": 159 }, { "text": "speech recognition", "start": 196, ...

[]

A Three-Tiered Evaluation Approach for Interactive Spoken Dialogue Systems We describe a three-tiered approach for evaluation of spoken dialogue systems. The three tiers measure user satisfaction, system support of mission success and component performance. We describe our use of this approach in numerous fielded user ...

{ "entities": { "keyphrase": [ { "text": "spoken dialogue systems", "start": 129, "end": 152 }, { "text": "user satisfaction", "start": 178, "end": 195 }, { "text": "system support of mission success", "start": 197, ...

[]

TAP-XL: An Automated Analyst' s Assistant The TAP-XL Automated Analyst' s Assistant is an application designed to help an English-speaking analyst write a topical report, culling information from a large inflow of multilingual, multimedia data. It gives users the ability to spend their time finding more data relevant t...

{ "entities": { "keyphrase": [ { "text": "TAP-XL Automated Analyst' s Assistant", "start": 46, "end": 83 }, { "text": "English", "start": 122, "end": 129 }, { "text": "topical report", "start": 155, "end": 169 ...

[]

Some Computational Complexity Results for Synchronous Context-Free Grammars This paper investigates some computational problems associated with probabilistic translation models that have recently been adopted in the literature on machine translation. These models can be viewed as pairs of probabilistic context-free gra...

{ "entities": { "keyphrase": [ { "text": "computational problems", "start": 105, "end": 127 }, { "text": "probabilistic translation models", "start": 144, "end": 176 }, { "text": "machine translation", "start": 230, ...

[]

BLEU in characters: towards automatic MT evaluation in languages without word delimiters Automatic evaluation metrics for Machine Translation (MT) systems, such as BLEU or NIST, are now well established. Yet, they are scarcely used for the assessment of language pairs like English-Chinese or English-Japanese, because o...

{ "entities": { "keyphrase": [ { "text": "evaluation metrics", "start": 99, "end": 117 }, { "text": "Machine Translation (MT) systems", "start": 122, "end": 154 }, { "text": "BLEU", "start": 164, "end": 168 ...

[]

Interactively Exploring a Machine Translation Model This paper describes a method of interactively visualizing and directing the process of translating a sentence. The method allows a user to explore a model of syntax-based statistical machine translation (MT), to understand the model' s strengths and weaknesses, and t...

{ "entities": { "keyphrase": [ { "text": "interactively visualizing and directing the process", "start": 85, "end": 136 }, { "text": "translating a sentence", "start": 140, "end": 162 }, { "text": "user", "start": 184, ...

[]

Computational Complexity of Statistical Machine Translation In this paper we study a set of problems that are of considerable importance to Statistical Machine Translation (SMT) but which have not been addressed satisfactorily by the SMT research community. Over the last decade, a variety of SMT algorithms have been bu...

{ "entities": { "keyphrase": [ { "text": "Statistical Machine Translation (SMT)", "start": 140, "end": 177 }, { "text": "SMT research community", "start": 234, "end": 256 }, { "text": "SMT algorithms", "start": 293, ...

[]

Structuring Knowledge for Reference Generation: A Clustering Algorithm This paper discusses two problems that arise in the Generation of Referring Expressions: (a) numeric-valued attributes, such as size or location; (b) perspective-taking in reference. Both problems, it is argued, can be resolved if some structure is ...

{ "entities": { "keyphrase": [ { "text": "Generation", "start": 123, "end": 133 }, { "text": "Referring Expressions", "start": 137, "end": 158 }, { "text": "numeric-valued attributes", "start": 164, "end": 189 ...

[]

Answering the Question You Wish They Had Asked: The Impact of Paraphrasing for Question Answering State-of-the-art Question Answering (QA) systems are very sensitive to variations in the phrasing of an information need. Finding the preferred language for such a need is a valuable task. We investigate that claim by adop...

{ "entities": { "keyphrase": [ { "text": "Question Answering (QA) systems", "start": 115, "end": 146 }, { "text": "information need", "start": 202, "end": 218 }, { "text": "language", "start": 242, "end": 250 ...

[]

A Comparison of Tagging Strategies for Statistical Information Extraction There are several approaches that model information extraction as a token classification task, using various tagging strategies to combine multiple tokens. We describe the tagging strategies that can be found in the literature and evaluate their ...

{ "entities": { "keyphrase": [ { "text": "information extraction", "start": 114, "end": 136 }, { "text": "token classification task", "start": 142, "end": 167 }, { "text": "tagging strategies", "start": 183, "end...

[]

InfoMagnets: Making Sense of Corpus Data We introduce a new interactive corpus exploration tool called InfoMagnets. InfoMagnets aims at making exploratory corpus analysis accessible to researchers who are not experts in text mining. As evidence of its usefulness and usability, it has been used successfully in a researc...

{ "entities": { "keyphrase": [ { "text": "interactive corpus exploration tool", "start": 60, "end": 95 }, { "text": "InfoMagnets", "start": 103, "end": 114 }, { "text": "InfoMagnets", "start": 116, "end": 127 ...

[]

Polarized Unification Grammars This paper proposes a generic mathematical formalism for the combination of various structures: strings, trees, dags, graphs, and products of them. The polarization of the objects of the elementary structures controls the saturation of the final structure. This formalism is both elementar...

{ "entities": { "keyphrase": [ { "text": "mathematical formalism", "start": 61, "end": 83 }, { "text": "structures", "start": 115, "end": 125 }, { "text": "strings", "start": 127, "end": 134 }, { ...

[]

Word Vectors and Two Kinds of Similarity This paper examines what kind of similarity between words can be represented by what kind of word vectors in the vector space model. Through two experiments, three methods for constructing word vectors, i. e., LSA-based, cooccurrence-based and dictionary-based methods, were comp...

{ "entities": { "keyphrase": [ { "text": "similarity", "start": 74, "end": 84 }, { "text": "words", "start": 93, "end": 98 }, { "text": "word vectors", "start": 134, "end": 146 }, { "text": "v...

[]

Investigations on Event-Based Summarization We investigate independent and relevant event-based extractive mutli-document summarization approaches. In this paper, events are defined as event terms and associated event elements. With independent approach, we identify important contents by frequency of events. With relev...

{ "entities": { "keyphrase": [ { "text": "mutli-document summarization approaches", "start": 107, "end": 146 }, { "text": "events", "start": 163, "end": 169 }, { "text": "event terms", "start": 185, "end": 196 ...

[]

FERRET: Interactive Question-Answering for Real-World Environments This paper describes FERRET, an interactive question-answering (Q/A) system designed to address the challenges of integrating automatic Q/A applications into real-world environments. FERRET utilizes a novel approach to Q/A known as predictive questionin...

{ "entities": { "keyphrase": [ { "text": "FERRET", "start": 88, "end": 94 }, { "text": "interactive question-answering (Q/A) system", "start": 99, "end": 142 }, { "text": "automatic Q/A", "start": 193, "end": 206...

[]

Computational Analysis of Move Structures in Academic Abstracts This paper introduces a method for computational analysis of move structures in abstracts of research articles. In our approach, sentences in a given abstract are analyzed and labeled with a specific move in light of various rhetorical functions. The metho...

{ "entities": { "keyphrase": [ { "text": "computational analysis of move structures", "start": 99, "end": 140 }, { "text": "abstracts", "start": 144, "end": 153 }, { "text": "research articles", "start": 157, "en...

[]

Re-Usable Tools for Precision Machine Translation The LOGON MT demonstrator assembles independently valuable general-purpose NLP components into a machine translation pipeline that capitalizes on output quality. The demonstrator embodies an interesting combination of hand-built, symbolic resources and stochastic proces...

{ "entities": { "keyphrase": [ { "text": "LOGON MT demonstrator", "start": 54, "end": 75 }, { "text": "general-purpose NLP components", "start": 109, "end": 139 }, { "text": "machine translation pipeline", "start": 147, ...

[]

Testing The Psychological Reality of a Representational Model A research program is described in which a particular representational format for meaning is tested as broadly as possible. In this format, developed by the LNR research group at The University of California at San Diego, verbs are represented as interconnec...

{ "entities": { "keyphrase": [ { "text": "representational format for meaning", "start": 116, "end": 151 }, { "text": "verbs", "start": 284, "end": 289 }, { "text": "subpredicates", "start": 332, "end": 345 ...

[]

Fragments of a Theory of Human Plausible Reasoning The paper outlines a computational theory of human plausible reasoning constructed from analysis of people' s answers to everyday questions. Like logic, the theory is expressed in a content-independent formalism. Unlike logic, the theory specifies how different informa...

{ "entities": { "keyphrase": [ { "text": "computational theory", "start": 72, "end": 92 }, { "text": "human plausible reasoning", "start": 96, "end": 121 }, { "text": "logic", "start": 197, "end": 202 }, ...

[]

PATH-BASED AND NODE-BASED INFERENCE IN SEMANTIC NETWORKS Two styles of performing inference in semantic networks are presented and compared. Path-based inference allows an arc or a path of arcs between two given nodes to be inferred from the existence of another specified path between the same two nodes. Path-based inf...

{ "entities": { "keyphrase": [ { "text": "inference", "start": 82, "end": 91 }, { "text": "semantic networks", "start": 95, "end": 112 }, { "text": "Path-based inference", "start": 141, "end": 161 }, ...

[]

ON FROFF: A TEXT PROCESSING SYSTEM FOR ENGLISH TEXTS AND FIGURES In order to meet the needs of a publication of papers in English, many systems to run off texts have been developed. In this paper, we report a system FROFF which can make a fair copy of not only texts but also graphs and tables indispensable to our paper...

{ "entities": { "keyphrase": [ { "text": "FROFF", "start": 216, "end": 221 }, { "text": "fonts", "start": 340, "end": 345 }, { "text": "character", "start": 364, "end": 373 }, { "text": "typin...

[]

ATNS USED AS A PROCEDURAL DIALOG MODEL An attempt has been made to use an Augmented Transition Network as a procedural dialog model. The development of such a model appears to be important in several respects: as a device to represent and to use different dialog schemata proposed in empirical conversation analysis; as ...

{ "entities": { "keyphrase": [ { "text": "Augmented Transition Network", "start": 74, "end": 102 }, { "text": "dialog model", "start": 119, "end": 131 }, { "text": "model", "start": 159, "end": 164 }, ...

[]

Metaphor-A Key to Extensible Semantic Analysis Interpreting metaphors is an integral and inescapable process in human understanding of natural language. This paper discusses a method of analyzing metaphors based on the existence of a small number of generalized metaphor mappings. Each generalized metaphor contains a re...

{ "entities": { "keyphrase": [ { "text": "metaphors", "start": 60, "end": 69 }, { "text": "human understanding of natural language", "start": 112, "end": 151 }, { "text": "method of analyzing metaphors", "start": 176, ...

[]

Expanding the Horizons of Natural Language Interfaces Current natural language interfaces have concentrated largely on determining the literal meaning of input from their users. While such decoding is an essential underpinning, much recent work suggests that natural language interfaces will never appear cooperative or ...

{ "entities": { "keyphrase": [ { "text": "natural language interfaces", "start": 62, "end": 89 }, { "text": "meaning", "start": 143, "end": 150 }, { "text": "input", "start": 154, "end": 159 }, { ...

[]