Table 2 presents the results of comparison with the LI algorithm on the set of Boolean programs used in [22].
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:```have been proposed as potential alternatives to the Turing Test, specifically targeting its potential weaknesses and inadequacy [1].```
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:```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:```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:```In this case, FLNA(16-23) showed more rapid association and slower dissociation rates to the β-arr2/ICL3 complex than to ICL3 alone (Figure 7D), suggesting that the FLNA fragment interacts with β-arr2 rather than with ICL3.```
Sample intent: method
Sample text:```In this case, FLNA(16-23) showed more rapid association and slower dissociation rates to the β-arr2/ICL3 complex than to ICL3 alone (Figure 7D), suggesting that the FLNA fragment interacts with β-arr2 rather than with ICL3.```
Sample intent: method



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:```NP3L [10] is consistently outperformed by our methods, while for UPnP [8] our NPnLupC outperforms it in the noisy cases.```
Sample intent: background



Sample text:```In this study, we generalized previous results regarding the quasi-Gaussian shape and the scalar property using the SBF model [13,21,52].```
Sample intent: result



Sample text:```LASTZ represents a new implementation of the previous BLASTZ (30) algorithm and includes several improvements (29).```
Sample intent: background



Sample text:```In addition, [5] and [6] executed the researches about XACML, access control language which can be managed in XML documents.```
Sample intent: method



Sample text:```have been proposed as potential alternatives to the Turing Test, specifically targeting its potential weaknesses and inadequacy [1].```
Sample intent: background



Sample text:```While this method is known to be generally reliable, there are some questions about the representativeness of the data used [25].```
Sample intent: background



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