### Table 1. Three Families of Accounts of Inductive Inference Each of the three families will be discussed in turn in the three sections to follow and the entries in this table explicated.2 While most accounts of inductive inference fit into one of these three families, some span across two families. Achinstein apos;s (2001) theory of evidence, for example, draws on ideas from both hypothetical induction and probabilistic induction, in so far as it invokes both explanatory power and probabilististic notions. Demonstrative induction, listed here under inductive generalization, can also be thought of as an extension of hypothetical induction.

2003

"... In PAGE 3: ... As a result, it is possible to group virtually all accounts of induction into three families. This system is summarized in Table1 below. Each family is governed by a principle upon which every account in each family depends.... ..."

### Table 1: Probabilistic Approaches

"... In PAGE 2: ...3 Word-based, Probabilistic Approaches The third category assumes at most whitespace and punctuation knowledge and attempts to infer MWUs using word combination probabilities. Table1 (see next page) shows nine commonly-used probabilistic MWU-induction approaches. In the table, f and P signify frequency and probability XX of a word X.... ..."

### Table 3. Probabilistic network induction results

2001

Cited by 5

### Table 3: Intermediate tables during probabilistic inference.

1999

Cited by 15

### Table 1.3: Results of Probabilistic Inferences.

2001

Cited by 2

### Table 1.3: Results of Probabilistic Inferences.

2001

Cited by 1

### Table 3 Empirical Phenomena Associated With Analogical Inference and Schema Induction

"... In PAGE 23: ... Simulations of Human Relational Inference and Generalization We will now illustrate LISA apos;s ability to simulate a range of empirical phenomena concerning human relational inference and generalization. Table3 provides a summary of 15 phenomena that we take to be sufficiently well-established that any proposed theory will be required to account for them. We divide the phenomena into those related to the generation of specific inferences about a target, those related to the induction of more abstract relational schemas, and those that involve interactions between schemas and inference.... ..."

### TABLE 4. Inductive inference SAT problems: 32-variable hidden logic

1998

Cited by 13

### TABLE 5. Efficiency on inductive inference problems: interior point and combinatorial approaches

1998

Cited by 13

### Table 4: Inductive inference SAT problems: 32-variable hidden logic

"... In PAGE 9: ... This function has 2 32 apos; 4:3 #02 10 9 distinct input-output combinations. Table4 summarizes the computational results for this instance, where subsets of input-output ex- amples of size 50, 100 and 400 were considered and the number of terms in the expression to be synthesized was #0Cxed at K = 4. In all instances, the interior... ..."