The impact of our method is evaluated using the TreeTagger (Schmid, 1994, 1995) for POS tagging without considering probabilities for unknown tokens.77 For a language-independent approach, we use the trigram holing operation to compute a DT as exemplified with c) in Section 2.4.
Sample text:```This seems to be the main drawback of the current implementation in comparison to the method of Black Jepson (“refined” in Table 1).```
Sample intent: result
Sample text:```Our heritability result is generally in agreement with the studies of Kien et al. (2008) in Eucalyptus urophylla and Zhao et al. (2014a) in poplar.```
Sample intent: result



Sample text:```We use BLEU (up to 4-grams) (Papineni et al., 2002) as evaluation metric, which computes the precision of n-grams in generated summaries with gold-standard abstracts as the reference.```
Sample intent: background



Sample text:```Our results confi rm previous studies that reached the same conclusion (Boushey et al 1994; Vermeulen et al 2000; Till et al 2005; Marcucci et al 2005).```
Sample intent: result



Sample text:```Discrepancies analogous to those between our results and those of simulations have, indeed, recently been observed in the case of the binary perceptron [18], the pspin interaction spin glass [19], and in the case of fluctuating manifolds in random media [20], where dynamically frozen phases were observed in regions of parameter space in which static approaches yielded ergodic phases.```
Sample intent: result



Sample text:```…between output and input, CNF achieves almost 10% relative improvement over CRF. CNF also outperforms other methods including SVMpro (Hua and Sun, 2001), SVMpsi (Kim and Park, 2003), YASSPP (Karypis, 2006), PSIPRED (Jones, 1999), SPINE (Dor and Zhou, 2007) and TreeCRFpsi (Dietterich et al., 2004).```
Sample intent: background
Sample text:```The results for veridical recall replicated previous results in the literature (Bal-
lardini et al., 2008; McDermott & Watson, 2001), with the average recall of studied words increas-
ing monotonically as SOA increased.```
Sample intent: result



Sample text:```We screened for potential TF binding sites using STAMP [59], with the motifs’ position weight matrices (PWMs) retrieved from the TRANSFAC database [60].```
Sample intent: background



Sample text:```Our heritability result is generally in agreement with the studies of Kien et al. (2008) in Eucalyptus urophylla and Zhao et al. (2014a) in poplar.```
Sample intent: result



Sample text:```The D-HOTM system is based on the Text Mining Infrast ucture (TMI) developed by the parallel and distributed text mining lab at Lehigh University [20].```
Sample intent: background



Sample text:```Over the last few years, many different local interest point detectors (like Harris3D [16], Cuboid [6], Hessian [35] or Dense sampling [33]) and many spatio-temporal descriptors (like HOG [17], HOG3D [14], HOF [17], Cuboid [6] or ESURF [35]) have been proposed.```
Sample intent: method



Sample text:```[20] found that the enhancement that this procedure would provide in terms of explaining trauma symptoms is limited, and they concluded that the relative gains are not worth the methodological complexity.```
Sample intent: method



Sample text:```Following past work, we show that such basis models can be learned from 2D annotations using techniques adapted from nonrigid structure from motion (SFM) [20, 19].```
Sample intent: method



Sample text:```Discrepancies analogous to those between our results and those of simulations have, indeed, recently been observed in the case of the binary perceptron [18], the pspin interaction spin glass [19], and in the case of fluctuating manifolds in random media [20], where dynamically frozen phases were observed in regions of parameter space in which static approaches yielded ergodic phases.```
Sample intent: result



Sample text:```Note that in their pioneering paper Calvet and Fisher (2002) proposed the simplified version of the construction of Mannersalo et al (2002).```
Sample intent: method



Sample text:```For example, Kawato et al. (1990) suggested that movement trajectories can be projected using critical via-points through which the trajectory has to pass at a certain time, rather than in terms of the moment-by-moment dynamics of the implemented movement trajectory. Optimal trajectories can then be learnt by applying local optimising principles for getting from one via-point to the next. In this way, impoverished predictions can be used to monitor rich implementations. In the same way, language users might predict particularly crucial aspects of an utterance, but the aspects that they predict will depend on the circumstances. More generally, Meyer & Hagoort question the value of predicting one’s own utterance. They argue that prediction is useful when it is likely to differ from the actual event. This is the case when predicting another person’s behaviour or when the result of one’s action is uncertain (e.g., moving in a strong wind). But they argue that people are confident about their own speech. Meyer & Hagoort admit that they will tend to be less confident in dialogue, and we agree. But more important, we argue that the behaviour of the production implementer is not fully determined by the production command, because the complex processes involved in production are subject to internal (“neural”) noise or priming (i.e., influences that may not be a result of the production command). Assuming that these sources of noise do not necessarily affect forward modelling as well, predicted speech may differ from actual speech. In addition, prediction is useful even if the behaviour is fully predictable, because it allows the actor to plan future behaviour on the basis of the prediction. In fact, we made such a proposal in relation to the order of heavy and light phrases (see sect. 3.1, target article). Hartsuiker claims that our account incorrectly predicts an early competitor effect in Huettig and Hartsuiker (2010). His claim is based on the assumption that Response/Pickering & Garrod: An integrated theory of language production and comprehension```
Sample intent: method