### Table 1: Strategies of term telimitation System term delimitation structure disamb.

### Table 2: Strategies of term filtering System Term Filtering

### Table 21: Term rewriting system for BPA drt.

1996

"... In PAGE 46: ...Table 21: Term rewriting system for BPA drt. Proof The term rewriting system of Table21 is associated to BPA drt by assigning a direction to the axioms. With the method of the lexicographical path ordering it is easily proven that this term rewriting system is strongly normalizing.... ..."

Cited by 7

### Table 3. Messaging systems: terms and concepts matrix

2003

"... In PAGE 31: ....2.5.3 Terms and Concepts Table3 shows the terms and concepts matrix. Although the general concepts are very similar, the systems use different terms for the involved elements.... ..."

Cited by 1

### Table 3: A term rewriting system

1996

"... In PAGE 6: ...Table 3: A term rewriting system Table3 contains a term rewriting system (TRS) which reduces sequential composition to its pre x counterpart and which eliminates expressions x and x and x. De ne a weight function on terms as follows: w( ) = 2 w(p + q) = w(p) + w(q) w(pq) = w(p)2w(q) w( p) =... ..."

Cited by 6

### Table 1: Term Weights in the Smart System

1996

"... In PAGE 5: ... The rst letter in a triple is a shorthand for the function of the term frequency factor being used in the term weights, the second letter corresponds to the inverse document frequency function and the third letter corresponds to the normalization factor applied to the term weights. Table1 summarizes the most commonly used functions in term weighting. The max tf in the augmented tf weight formula is the maximum term frequency of any term in the document under consideration.... ..."

Cited by 12

### Table 3: A term rewriting system

1996

"... In PAGE 7: ...2 Construction of basic terms In this section we de ne a class of basic terms, and we show that each process term is provably equal to a basic term. Table3 contains a Term Rewriting System (TRS) which reduces sequential com- position to its pre x counterpart and which eliminates expressions x and x and x. De ne a weight function on terms as follows: w( ) = 2 w(p + q) = w(p) + w(q) w(pq) = w(p)2w(q) w( p) = 6w(p): It is easy to see that the weight of terms always strictly decreases under application of the rewrite rules.... ..."

Cited by 6

### Table 4: Term Weights in the SMART System.

2005

"... In PAGE 6: ... Given a collection profile (queries and targets), it is possible to calculate an optimal weighting scheme by varying a set of parameters. The main parameters are provided in Table4 . A retrieval experiment can be characterized by a pair of triples - ddd.... In PAGE 6: ...qqq- where the first triple corresponds to term weight- ing used for the document collection (hence the symbols d), and the second triple corresponds to the query term weight (hence the symbols q). Each triple refers to a term frequency, an inverse document frequency and a normal- ization function as provided in Table4 . More elaborated weighting, such as the deviation from randomness [34] and the pivoted normalization [35] were tested but did not result in any improvement as compared to the cosine nor- malization given in Table 4.... ..."

### Table 22: Term rewriting system for BPAdrt.

1996

"... In PAGE 58: ...Table22... ..."

Cited by 7

### Table 22: Term rewriting system for BPAdrt.

1996

"... In PAGE 58: ...Table22... ..."

Cited by 7