We compute transitive closure by using a Union-Find structure, which runs in time O(log * n), which for practical purposes can be considered linear (O(n)) 3 .
when computing the best information gain for a nominal feature, StRip has to make a pass over the data for each value that the feature takes, while RIPPER can split the data into bags and perform the computation in one pass.