To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
In this paper we describe the many steps involved in building a production quality Machine Translation system for translating weather warnings between French and English. Although in principle this task may seem straightforward, the details, especially corpus preparation and final text presentation, involve many difficult aspects that are often glossed over in the literature. On top of the classic Statistical Machine Translation evaluation metric results, four manual evaluations have been performed to assess and improve translation quality. We also show the usefulness of the integration of out-of-domain information sources in a Statistical Machine Translation system to produce high quality translated text.
This study examines the ability of a semantic space model to represent the meaning of noun compounds such as ‘information gathering’ or ‘heart disease.’ For a semantic space model to compute the meaning and the attributional similarity (or semantic relatedness) for unfamiliar noun compounds that do not occur in a corpus, the vector for a noun compound must be computed from the vectors of its constituent words using vector composition algorithms. Six composition algorithms (i.e., centroid, multiplication, circular convolution, predication, comparison, and dilation) are compared in terms of the quality of the computation of the attributional similarity for English and Japanese noun compounds. To evaluate the performance of the computation of the similarity, this study uses three tasks (i.e., related word ranking, similarity correlation, and semantic classification), and two types of semantic spaces (i.e., latent semantic analysis-based and positive pointwise mutual information-based spaces). The result of these tasks is that the dilation algorithm is generally most effective in computing the similarity of noun compounds, while the multiplication algorithm is best suited specifically for the positive pointwise mutual information-based space. In addition, the comparison algorithm works better for unfamiliar noun compounds that do not occur in the corpus. These findings indicate that in general a semantic space model, and in particular the dilation, multiplication, and comparison algorithms have sufficient ability to compute the attributional similarity for noun compounds.
While human annotation is crucial for many natural language processing tasks, it is often very expensive and time-consuming. Inspired by previous work on crowdsourcing, we investigate the viability of using non-expert labels instead of gold standard annotations from experts for a machine learning approach to automatic readability prediction. In order to do so, we evaluate two different methodologies to assess the readability of a wide variety of text material: A more traditional setup in which expert readers make readability judgments and a crowdsourcing setup for users who are not necessarily experts. To this purpose two assessment tools were implemented: a tool where expert readers can rank a batch of texts based on readability, and a lightweight crowdsourcing tool, which invites users to provide pairwise comparisons. To validate this approach, readability assessments for a corpus of written Dutch generic texts were gathered. By collecting multiple assessments per text, we explicitly wanted to level out readers' background knowledge and attitude. Our findings show that the assessments collected through both methodologies are highly consistent and that crowdsourcing is a viable alternative to expert labeling. This is a good news as crowdsourcing is more lightweight to use and can have access to a much wider audience of potential annotators. By performing a set of basic machine learning experiments using a feature set that mainly encodes basic lexical and morpho-syntactic information, we further illustrate how the collected data can be used to perform text comparisons or to assign an absolute readability score to an individual text. We do not focus on optimising the algorithms to achieve the best possible results for the learning tasks, but carry them out to illustrate the various possibilities of our data sets. The results on different data sets, however, show that our system outperforms the readability formulas and a baseline language modelling approach. We conclude that readability assessment by comparing texts is a polyvalent methodology, which can be adapted to specific domains and target audiences if required.
This paper presents morpheme-based language models developed for Amharic (a morphologically rich Semitic language) and their application to a speech recognition task. A substantial reduction in the out of vocabulary rate has been observed as a result of using subwords or morphemes. Thus a severe problem of morphologically rich languages has been addressed. Moreover, lower perplexity values have been obtained with morpheme-based language models than with word-based models. However, when comparing the quality based on the probability assigned to the test sets, word-based models seem to fare better. We have studied the utility of morpheme-based language models in speech recognition systems and found that the performance of a relatively small vocabulary (5k) speech recognition system improved significantly as a result of using morphemes as language modeling and dictionary units. However, as the size of the vocabulary increases (20k or more) the morpheme-based systems suffer from acoustic confusability and did not achieve a significant improvement over a word-based system with an equivalent vocabulary size even with the use of higher order (quadrogram) n-gram language models.
Causality is a key part of many fields and facets of life, from finding the relationship between diet and disease to discovering the reason for a particular stock market crash. Despite centuries of work in philosophy and decades of computational research, automated inference and explanation remains an open problem. In particular, the timing and complexity of relationships has been largely ignored even though this information is critically important for prediction, explanation and intervention. However, given the growing availability of large observational datasets including those from electronic health records and social networks, it is a practical necessity. This book presents a new approach to inference (finding relationships from a set of data) and explanation (assessing why a particular event occurred), addressing both the timing and complexity of relationships. The practical use of the method developed is illustrated through theoretical and experimental case studies, demonstrating its feasibility and success.
In recent years, the interest among the research community in sentiment analysis (SA) has grown exponentially. It is only necessary to see the number of scientific publications and forums or related conferences to understand that this is a field with great prospects for the future. On the other hand, the Twitter boom has boosted investigation in this area due fundamentally to its potential applications in areas such as business or government intelligence, recommender systems, graphical interfaces and virtual assistance. However, to fully understand this issue, a profound revision of the state of the art is first necessary. It is for this reason that this paper aims to represent a starting point for those investigations concerned with the latest references to Twitter in SA.
Thus far, I have discussed the types of causes that will be identified, how they can be represented as logical formulas, and how the definitions hold up to common counterexamples. This chapter addresses how these relationships can be inferred from a set of data. I begin by examining the set of hypotheses to be tested, the types of data one may make inferences from, and how to determine whether formulas are satisfied directly in this data (without first inferring a model). Next, I discuss how to calculate the causal significance measure introduced in the previous chapter (ϵavg) in data, and how to determine which values of this measure are statistically significant. I then address inference of relationships and their timing without prior knowledge of either. The chapter concludes by examining theoretical issues including the computational complexity of the testing procedures.
Testing Prima Facie Causality
Chapter 4 introduced a measure for causal significance and showed how probabilistic causal relationships can be represented using probabilistic temporal logic formulas. This representation allows efficient testing of arbitrarily complex relationships. In this chapter, I adapt standard PCTL model checking procedures to validate formulas directly in a set of time series data without first inferring a model (as this can be computationally complex or infeasible in many cases).
Why did Alice develop heart disease in her fifties? What led to the volatility in the U.S. stock market in August 2011? Who shot John F. Kennedy? The inference method described so far aims to find causal relationships that hold in general, while these questions seek causal explanations for one-time events. We do not want to know what causes heart disease, stock market crashes, or death by shooting in general but rather aim to determine why each of these particular events happened. This is a challenging problem, as we need to make such determinations with incomplete and often conflicting information. Few algorithmic methods have been developed to automate this process, yet this may have wide applications to situations with continuous monitoring, such as in intensive care units. Physicians there are overwhelmed with information and need to distinguish between factors causing a particular patient's current symptoms and side effects of their underlying illness to determine the best course of treatment.
This chapter begins in section 6.1 with a discussion of the distinction between type and token causality, and review of methods for token-level reasoning. In section 6.2, I introduce a new approach that links the type-level theory developed in earlier chapters with token-level observation sequences and develops methods for ranking explanations with incomplete and uncertain information. Finally, this is illustrated through worked out examples in section 6.3 and analysis of test cases that have proven difficult for prior approaches in section 6.4.
When discussing causality and causal inference we must first distinguish between the thing itself and how to recognize it. Most scientific work on causality involves developing methods for providing evidence for causal relationships, while work in philosophy addresses what it means for something to be a cause. This philosophical work is not immediately applicable to practical problems, but it provides a necessary starting point for work by computer scientists, epidemiologists, and economists. This section introduces readers not familiar with the philosophical literature to how philosophers have conceptualized causality and why this problem is still unsolved after centuries of work. I begin with a review of the primary ways philosophers have addressed causality leading up to more recent probabilistic methods. The review is not an unbiased survey of causality, but rather a discussion of its philosophical foundations through the lens of researchers aiming to build inference methods upon them. As a result, I omit large bodies of work such as process-based theories (Dowe, 2000; Salmon, 1994) and mechanistic models (Glennan, 1996; Machamer et al., 2000) because knowledge of these is not required to understand the later sections. I also raise concerns (such as computational complexity) that differ from those of philosophers but are important when translating these methods to practice.
While Aristotle is often credited with the first formal theory of causality in his Physics and Metaphysics, the most influential modern discussion of causality comes from David Hume in the 18th century. Hume attempted to define both what a cause is and what is meant by the term; as well as how we can come to possess causal knowledge and what is needed to infer it from observations. The core of Hume’s work is arguing that we come to know of causal relationships by inferring them from observations, so they may also be subjective due to beliefs and perception.
Whether we want to know the cause of a stock's price movements (in order to trade on this information), the key phrases that can alter public opinion of a candidate (in order to optimize a politician's speeches), or which genes work together to regulate a disease causing process (in order to intervene and disrupt it), many goals center on finding and using causes. Causes tell us not only that two phenomena are related, but how they are related. They allow us to make robust predictions about the future, explain the relationship between and occurrence of events, and develop effective policies for intervention.
While predictions are often made successfully on the basis of associations alone, these relationships can be unstable. If we do not know why the resulting models work, we cannot foresee when they will stop working. Lung cancer rates in an area may be correlated with match sales if many smokers use matches to light their cigarettes, but match sales may also be influenced by blackouts and seasonal trends (with many purchases around holidays or in winter). A spike in match sales due to a blackout will not result in the predicted spike in lung cancer rates, but without knowledge of the underlying causes we would not be able to anticipate that failure. Models based on associations can also lead to redundancies, since multiple effects of the true cause may be included as they are correlated with its occurrence.
Thus far, I have evaluated the approach developed here conceptually, but the goal is to apply the methods to actual data. Before applying a new approach to a new domain, though, it must first be evaluated on datasets where the true relationships are known. This chapter discusses two types of applications: validation on simulated neuronal and financial time series (to determine how well the algorithms can recover known causes) and experimentation on financial time series (to discover novel relationships).
Simulated Neural Spike Trains
We begin our study of applications with synthetically generated neural spike trains. The underlying relationships here are simple (one neuron causing another to fire in some predefined window of time), but the data allow validation of the algorithms for inferring relationships and their timing, and comparison against other methods. There has been much recent work on determining the connectivity between neurons by applying causal inference methods to spike train measurements (Brown et al., 2004; Hesse et al., 2003; Kamiński et al., 2001) but timing information is a central part of the causal relationships, so it will be useful to compare the approach to others that include this information to varying extents. I begin with a comparison where all algorithms are provided with the known times before examining how well the approach can recover these timings without such prior knowledge.
Synthetic MEA data
The data were created to mimic multi-neuronal electrode array (MEA) experiments, in which neuron firings may be tracked over a period of time. Data was generated for five different structures, with neurons denoted by the 26 characters of the English alphabet. Each dataset contained 100,000 firings generated using one of the five structures plus a degree of noise (this is a parameter that was varied).
The first few chapters of the book reviewed causality (highlighting some primary approaches to reasoning about and inferring it), probability, and logic, so that readers without expertise in these areas could follow the later discussions. The remainder of the book is devoted to developing a new approach that builds on probabilistic causality and temporal logic to infer complex causal relationships from data and explain the occurrence of actual events (called token causality, and the subject of chapter 6). The first task is to determine exactly what causes will be inferred and how these fit in with other theories of causality and causal inference. This chapter will focus on conceptual differences, while chapter 7 contains experimental comparisons against other inference methods. When discussing causality or causal inference, it is important to be precise about the meaning ascribed to the term “causal.” Many fields (including epidemiology, biology, economics, and politics) have developed their own criteria and conventions for what evidence is needed to substantiate a causal relationship. It is common to draw causal conclusions in biology from few experiments where a gene is suppressed (knocked-out) and one tests whether a given observable trait (phenotype) is present in the absence of the knocked-out gene. When the trait is absent the usual explanation is that the gene causes it, but this does not mean it is the sole cause (it may be only one of a set of necessary conditions) nor does it mean that the presence of the trait indicates noncausality.
Whether we want to determine the likelihood of a stock market crash or if people with a given gene have a higher risk of a disease, we need to understand the details of how to calculate and assess probabilities. But first, what exactly are probabilities and where do they come from? There are two primary views. The frequentist view says that probabilities relate to the proportion of occurrences in a series of events. For example, the probability of a coin coming up heads being 1/2 means that with a large number of coin flips, half should be heads and half tails. The probability then corresponds to how often something will occur. However, we also discuss the probability of events that may only happen once. We may want to know the probability that a recession will end if a policy is enacted, or the chances of a federal interest rate change on a particular date. In the frequentist case, we can get close to inferring the true probability by doing a large number of tests, but when an event may only occur once, we must instead rely on background knowledge and belief. There is another interpretation of probability, referred to as the Bayesian or subjectivist view. Here the probabilities correspond to degrees of belief in the outcome occurring. In this case, one must have what is called a prior, on which the belief is based.