…algorithms are formalized as matrix factorization (e.g., (Deerwester et al., 1990; Hofmann, 1999; Stratos et al., 2015)), but there may be no big difference between implicit (e.g., (Pennington et al., 2014)) and explicit factorization methods; see also (Mohamed, 2011; Rastogi et al., 2015).
Sample text:```…methods rely on some additional and often heuristic step to generate an initial solution, such as adversarially-trained neural networks [Conneau et al., 2018, Zhang et al., 2017a,b], robust self-learning [Artetxe et al., 2018b] or
5This can be easily verified by noting that the…```
Sample intent: background
Sample text:```In this sense, accidentally encountered information is also always algorithmically framed and often personalised by for example previous searches and geographical location (e.g. Abel et al., 2011; Feuz et al., 2011; Hannak et al., 2013).```
Sample intent: background



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:```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:```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:```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:```In this sense, accidentally encountered information is also always algorithmically framed and often personalised by for example previous searches and geographical location (e.g. Abel et al., 2011; Feuz et al., 2011; Hannak et al., 2013).```
Sample intent: background



Sample text:```Two traits are orthogonal when, based on individual rankings on one of the traits, it is impossible to predict anything certain about rankings on the other trait (Allik et al., 2015).```
Sample intent: method



Sample text:```On the other hand, there are research works on the design of graph-based routing algorithms [3], [16], [17], [18], [19], [20], [21], [22], [23] to deal with the void problem.```
Sample intent: method



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:```A rook pivoting scheme as in [3] and [11] can be implemented for tridiagonal matrices, but a full rook scheme for general banded matrices would probably lead to a ”chasing” scheme as in [5] or [15] .```
Sample intent: background



Sample text:```In-between methods can be subdivided into linear approximations [12,24] and quadratic interpolation methods [22,23,25–27] based on the degree of the polynomial approximation employed.```
Sample intent: method



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:```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:```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:```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