Computational Linguistics · 2015 · 186 citations · 94 references
Language StudiesComputer ScienceLinguisticsComputational LinguisticsDiscourse AnalysisNatural Language ProcessingDiscourse ProcessingParsingRhetorical AnalysisRhetorical TheorySyntactic ParsingText SegmentationConditional Random FieldsDiscourse RepresentationDiscourse Structure AnalysisDiscourse-based SegmentationParsing AlgorithmsRhetorical Structure AnalysisRhetorical Structure TheoryTree-based Representation
Discourse meaning arises from relationships between clauses and sentences, and rhetorical analysis seeks to uncover this coherence structure. The study introduces CODRA, a probabilistic discriminative framework for rhetorical analysis based on Rhetorical Structure Theory. CODRA consists of a binary‑classifier segmenter that identifies elementary discourse units and a parser that constructs a discourse tree by applying an optimal parsing algorithm to probabilities from intra‑ and multi‑sentential Conditional Random Fields, with two strategies for combining the stages. Empirical evaluations on two datasets show that CODRA outperforms state‑of‑the‑art methods by a wide margin, and reranking its k‑best parse hypotheses can further improve accuracy.
Clauses and sentences rarely stand on their own in an actual discourse; rather, the relationship between them carries important information that allows the discourse to express a meaning as a whole beyond the sum of its individual parts. Rhetorical analysis seeks to uncover this coherence structure. In this article, we present CODRA— a COmplete probabilistic Discriminative framework for performing Rhetorical Analysis in accordance with Rhetorical Structure Theory, which posits a tree representation of a discourse. CODRA comprises a discourse segmenter and a discourse parser. First, the discourse segmenter, which is based on a binary classifier, identifies the elementary discourse units in a given text. Then the discourse parser builds a discourse tree by applying an optimal parsing algorithm to probabilities inferred from two Conditional Random Fields: one for intra-sentential parsing and the other for multi-sentential parsing. We present two approaches to combine these two stages of parsing effectively. By conducting a series of empirical evaluations over two different data sets, we demonstrate that CODRA significantly outperforms the state-of-the-art, often by a wide margin. We also show that a reranking of the k-best parse hypotheses generated by CODRA can potentially improve the accuracy even further.
94
Leo Breiman · Machine Learning · 1996 · 17K citations · Full text
Leo Breiman · Machine Learning · 1996 · 16.4K citations · Full text
Recursive Deep Models for Semantic Compositionality Over a Sentiment Treebank
Richard Socher, Alex Perelygin, Jean Y. Wu et al. · 2013 · 6.8K citations · Full text