Abstract | This paper describes a rule-based framework for inducing derivational families (i.e., clusters of lemmas in derivational relationships) and its application to create a high-coverage German resource, DERIVBASE, mapping over 280k lemmas into more than 17k non-singleton clusters. |
Conclusion and Future Work | In this paper, we present DERIVBASE, a derivational resource for German based on a rule-based framework. |
Framework | In this section, we describe our rule-based model of derivation, its operation to define derivational families, and the application of the model to German. |
Framework | As German is a morphologically complex language, we analyzed its derivation processes before implementing our rule-based model. |
Framework | 3.2 A Rule-based Derivation Model |
Introduction | Instead, we employ a rule-based framework to define derivation rules that cover both suffixation and prefixation and describes stem changes. |
Related Work | Unsupervised approaches operate at the level of word-forms and have complementary strengths and weaknesses to rule-based approaches. |
Results | Its R-SU4 score is also significantly (p < 0.01) better than extractive methods, rule-based and sequence-based compression methods on both DUC 2006 and 2007. |
Results | For grammatical relation evaluation, our head-driven tree-based system obtains statistically significantly (p < 0.01) better Fl score (Rel-F1 than all the other systems except the rule-based system). |
Sentence Compression | Below we describe the sentence compression approaches developed in this research: RULE-BASED COMPRESSION, SEQUENCE—BASED COMPRESSION, and TREE-BASED COMPRESSION. |
Sentence Compression | 4.1 Rule-based Compression |
Sentence Compression | Our rule-based approach extends existing work (Conroy et al., 2006; Toutanova et al., 2007) to create the linguistically-motivated compression rules of Table 2. |
The Framework | Rule-Based Features |
Evaluation | 0 GUTime (Mani and Wilson, 2000), a widely used, older rule-based system. |
Evaluation | o SUTime (Chang and Manning, 2012), a more recent rule-based system for English. |
Evaluation | o UC3M (Vicente-Diez et al., 2010), a rule-based system for Spanish. |
Introduction | Many approaches to this problem make use of rule-based methods, combining regular-expression matching and handwritten interpretation functions. |
Introduction | dynamically back off to a rule-based system in the case of low confidence parses. |
Learning | A rule-based number recognizer was used for each language to recognize and ground numeric expressions, including information on whether the number was an ordinal (e.g., two versus second). |
Related Work | Previous work on speaker identification includes both rule-based and machine-learning approaches. |
Related Work | The rule-based methods are typically characterized by low coverage, and are too brittle to be reliably applied to different domains and changing styles. |
Related Work | (2010) implement a rule-based system to enrich German cabinet protocols with automatic speaker attribution. |
Background | It follows that approaches to document planning are rule-based as well and, concomitantly, are usually domain specific. |
Background | Further, statistical approaches should be more adaptable to different domains than their rule-based equivalents (Angeli et al., 2012). |
Evaluation and Discussion | This is an encouraging result considering that no experts were involved in the development of the system -a key contrast to many other existing (especially rule-based ) NLG systems. |
Conclusions and Future Work | The small size of our corpus, with around 375 bilingual sentences, posed a large challenge to the use of statistical methods; on the other hand, having no access to a LIS speaker prevented us from simply relying on a rule-based approach. |
Introduction | Still, it is a very small corpus, hence the main project shied away from statistical NLP techniques, relying instead on rule-based approaches developed with the help of a native ItaliarflLIS bilingual speaker; a similar approach is taken e.g. |
Rule extraction | Because the translation pipeline we plan to integrate with is rule-based , we chose a Decision Tree as our classifier: this allows rules to be easily extracted from the classification model. |
Introduction | With the advent of machine learning and the availability of annotated corpora in the mid 1990s the research focus shifted from rule-based approaches to supervised machine learning techniques. |
Introduction | Quite recently, however, rule-based approaches regained popularity due to Stanford’s multi-pass sieve approach which exhibits state-of-the-art performance on many standard coreference data sets (Raghunathan et al., 2010) and also won the CoNLL-2011 shared task on coreference resolution (Lee et al., 2011; Pradhan et al., 2011). |
Introduction | These results show that carefully crafted rule-based systems which employ suitable inference schemes can achieve competitive performance. |
Introduction | First, we compare the automatically learned verb classes to a preexisting ontology and handcrafted verb patterns from TABARI,1 an open-source and widely used rule-based event extraction system for this domain. |
Related Work | Beginning in the mid-19808, political scientists began experimenting with automated rule-based extraction systems (Schrodt and Gerner, 1994). |
Related Work | These efforts culminated in the open-source program, TABARI, which uses pattern matching from extensive hand-developed phrase dictionaries, combined with basic part of speech tagging (Schrodt, 2001); a rough analogue in the information extraction literature might be the rule-based , finite-state FASTUS system for MUC IE (Hobbs et al., 1997), though TABARI is restricted to single sentence analysis. |
Experiments | RULE-BASED : The method that regards only nuclei satisfying the constraint in Table l as problem nuclei. |
Experiments | The rule-based method achieved relatively high precision despite of the low recall, demonstrating the importance of problem and aid nuclei formulations described in Section 1. |
Experiments | RULE-BASED : The method that judges only problem-aid nuclei combinations with opposite excitation polarities as proper matches. |
Lexicon Evaluations | For that we perform subjectivity and polarity classification using rule-based classifiers6 on the test data E-TEST, S-TEST and R-TEST. |
Lexicon Evaluations | We consider how the various lexicons perform for rule-based classifiers for both subjectivity and polarity. |
Lexicon Evaluations | 6Similar approach to a rule-based classification using terms from he MPQA lexicon (Riloff and Wiebe, 2003). |
Introduction | Work on rule-based natural language generation (NLG) has explored a number of ways to combine these decisions in an architecture, ranging from integrated systems where all decisions happen jointly (Appelt, 1982) to strictly sequential pipelines (Reiter and Dale, 1997). |
Introduction | Such a system is reminiscent of earlier work in rule-based generation that implements an interactive or revision-based feedback between discourse-level planning and linguistic realisation (Hovy, 1988; Robin, 1993). |
Related Work | In rule-based , strictly sequential generators these interactions can lead to a so-called generation gap, where a downstream module cannot realize a text or sentence plan generated by the preceding modules (Meteer, 1991; Wanner, 1994). |