Problem context

The purpose of the special parasession on "Interactive Man/Machine Discourse" is to discuss some critical issues in the design of (computerbased) interactive natural language processing systems. This panel will be addressing the question of how the purpose of the interaction, or "problem context" affects what is said and how it is interpreted. Each of the panel members brings a different orientation toward the study of language to this question.
2p bungio_1 03052013 12 1 Download

My consents are organized within the framework suggested by the Panel Chair, Barbara Grosz, which I find very appropriate. All of my conlnents pertain to the various issues raised by her; however, wherever possible I will discuss these issues more in the context of the "information seeking" interaction and the data base doma/n. The primary question is how the purpose of the interaction or "the problem context" affects what is said and how it is interpreted. The ~ separate aspects of this question that must be considered are the function and the domain of the discourse. I. Types of...
4p bungio_1 03052013 11 1 Download

contrast, the solution is deﬁned by data structures that describe the original problem context indirectly and thus, determine the search space within an evolutionary search (optimization process). There exists the analogy in the nature, where the genotype encodes the phenotype, as well. Consequently, a genotypephenotype mapping determines how the genotypic representation is mapped to the... more
64p tuhuy 21032009 871 590 Download

n contrast, the solution is deﬁned by data structures that describe the original problem context indirectly and thus, determine the search space within an evolutionary search (optimization process). There exists the analogy in the nature, where the genotype encodes the phenotype, as well. Consequently, a genotypephenotype mapping determines how the genotypic representation is mapped to the phenotypic property. In other words, the phenotypic property determines the solution in original problemcontext. ...
136p contentnew 10042012 94 44 Download

One morning, long ago, John woke up and decided he wanted to write a book on theories and techniques in counseling and psychotherapy. He thought, “Of all the classes I teach, I love teaching theories and techniques best, so I should write a textbook.” John then began using a cognitive selfinstructional problemsolving strategy (see Chapter 8). He identified the problems associated with existing theories and techniques textbooks and formulated possible solutions.
554p cronus75 13012013 29 6 Download

We consider the problem of learning contextdependent mappings from sentences to logical form. The training examples are sequences of sentences annotated with lambdacalculus meaning representations. We develop an algorithm that maintains explicit, lambdacalculus representations of salient discourse entities and uses a contextdependent analysis pipeline to recover logical forms. The method uses a hiddenvariable variant of the perception algorithm to learn a linear model used to select the best analysis.
9p hongphan_1 14042013 13 4 Download

We discuss some of the practical issues that arise from decoding with general synchronous contextfree grammars. We examine problems caused by unary rules and we also examine how virtual nonterminals resulting from binarization can best be handled. We also investigate adding more ﬂexibility to synchronous contextfree grammars by adding glue rules and phrases.
5p hongdo_1 12042013 14 3 Download

HAVING STARTED WORK on mechanical translation, we arrived at the conclusion that both the lexical meaning and the morphological shape of the word can and should be utilized in analyzing the text, and that for purposes of translation it is impractical to omit the information which can be thus obtained. The utilization of the lexical meanings of words as well as of their contexts may also affect problems of coding. These questions are extremely important to automatic translation. We based our work on the following principles: 1.
0p nghetay_1 06042013 11 2 Download

One problem with phrasebased statistical machine translation is the problem of longdistance reordering when translating between languages with different word orders, such as JapaneseEnglish. In this paper, we propose a method of imposing reordering constraints using documentlevel context. As the documentlevel context, we use noun phrases which signiﬁcantly occur in context documents containing source sentences.
5p hongdo_1 12042013 15 2 Download

In this paper we present a tool that uses comparable corpora to ﬁnd appropriate translation equivalents for expressions that are considered by translators as difﬁcult. For a phrase in the source language the tool identiﬁes a range of possible expressions used in similar contexts in target language corpora and presents them to the translator as a list of suggestions. In the paper we discuss the method and present results of human evaluation of the performance of the tool, which highlight its usefulness when dictionary solutions are lacking. ...
8p hongvang_1 16042013 10 2 Download

This paper presents a partial solution to a component of the problem of lexical choice: choosing the synonym most typical, or expected, in context. We apply a new statistical approach to representing the context of a word through lexical cooccurrence networks. The implementation was trained and evaluated on a large corpus, and results show that the inclusion of secondorder cooccurrence relations improves the performance of our implemented lexical choice program.
3p bunthai_1 06052013 21 2 Download

Báo cáo khoa học: "Optimal HeadDriven Parsing Complexity for Linear ContextFree Rewriting Systems"
We study the problem of ﬁnding the best headdriven parsing strategy for Linear ContextFree Rewriting System productions. A headdriven strategy must begin with a speciﬁed righthandside nonterminal (the head) and add the remaining nonterminals one at a time in any order. We show that it is NPhard to ﬁnd the best headdriven strategy in terms of either the time or space complexity of parsing.
10p hongdo_1 12042013 10 1 Download

Statistical MT has made great progress in the last few years, but current translation models are weak on reordering and target language ﬂuency. Syntactic approaches seek to remedy these problems. In this paper, we take the framework for acquiring multilevel syntactic translation rules of (Galley et al.
8p hongvang_1 16042013 13 1 Download

We consider the problem of parsing nonrecursive contextfree grammars, i.e., contextfree grammars that generate ﬁnite languages. In natural language processing, this problem arises in several areas of application, including natural language generation, speech recognition and machine translation. We present two tabular algorithms for parsing of nonrecursive contextfree grammars, and show that they perform well in practical settings, despite the fact that this problem is PSPACEcomplete.
8p bunmoc_1 20042013 17 1 Download

The class of linear contextfree rewriting systems has been introduced as a generalization of a class of grammar formalisms known as mildly contextsensitive. The recognition problem for linear contextfree rewriting languages is studied at length here, presenting evidence that, even in some restricted cases, it cannot be solved efficiently. This entails the existence of a gap between, for example, tree adjoining languages and the subclass of linear contextfree rewriting languages that generalizes the former class; such a gap is attributed to "crossing configurations".
7p bunmoc_1 20042013 15 1 Download

We present an algorithm for computing ngram probabilities from stochastic contextfree grammars, a procedure that can alleviate some of the standard problems associated with ngrams (estimation from sparse data, lack of linguistic structure, among others). The method operates via the computation of substring expectations, which in turn is accomplished by solving systems of linear equations derived from the grammar. The procedure is fully implemented and has proved viable and useful in practice. confirming its practical feasibility and utility.
6p bunmoc_1 20042013 10 1 Download

This paper addresses the problem of correcting spelling errors that result in valid, though unintended words (such as peace and piece, or quiet and quite) and also the problem of correcting particular word usage errors (such as amount and number, or among and between). Such corrections require contextual information and are not handled by conventional spelling programs such as Unix spell. First, we introduce a method called Trigrams that uses partofspeech trigrams to encode the context. This method uses a small number of parameters compared to previous methods based on word trigrams.
8p bunmoc_1 20042013 19 1 Download

I will address the questions posed to the panel from wlthln the context of a project at SRI, TEAM [Grosz, 1982b], that is developing techniques for transportable naturallanguage interfaces. The goal of transportability is to enable nonspeciallsts to adapt a naturallanguage processing system for access to an existing conventional database. TEAM is designed to interact with two different kinds of users.
5p bungio_1 03052013 16 1 Download

Parallel Multiple ContextFree Grammar (PMCFG) is an extension of contextfree grammar for which the recognition problem is still solvable in polynomial time. We describe a new parsing algorithm that has the advantage to be incremental and to support PMCFG directly rather than the weaker MCFG formalism. The algorithm is also topdown which allows it to be used for grammar based word prediction.
8p bunthai_1 06052013 12 1 Download

Báo cáo khoa học: "A Probabilistic Contextfree Grammar for Disambiguation in Morphological Parsing"
One of the major problems one is faced with when decomposing words into their constituent parts is ambiguity: the generation of multiple analyses for one input word, many of which are implausible. In order to deal with ambiguity, the MORphological PArser MORPA is provided with a probabilistic contextfree grammar (PCFG), i.e. it combines a "conventional" contextfree morphological grammar to filter out ungrammatical segmentations with a probabilitybased scoring function which determines the likelihood of each successful parse. ...
10p buncha_1 08052013 13 1 Download