1998
DOI: 10.1016/s0306-4573(97)00065-4
|View full text |Cite
|
Sign up to set email alerts
|

Freestyle vs. Boolean: A comparison of partial and exact match retrieval systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
14
1

Year Published

1999
1999
2014
2014

Publication Types

Select...
4
1
1

Relationship

1
5

Authors

Journals

citations
Cited by 10 publications
(15 citation statements)
references
References 11 publications
0
14
1
Order By: Relevance
“…complex vs. simple (exhaustivity tuning dimension), and broad vs. narrow (extent tuning dimension). This opens a way to create experimental settings that are more sensitive to situational factors, the issue that has been raised in the Boolean/best-match comparisons [ 11,20].…”
Section: Conclusion and Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…complex vs. simple (exhaustivity tuning dimension), and broad vs. narrow (extent tuning dimension). This opens a way to create experimental settings that are more sensitive to situational factors, the issue that has been raised in the Boolean/best-match comparisons [ 11,20].…”
Section: Conclusion and Discussionmentioning
confidence: 99%
“…comparisons, have suggested that studying the overall superiority of one model over the other may be a naive approach [11,20]. Boolean queries seem to perform better in some situations, and best match queries in other situations.…”
Section: Introductionmentioning
confidence: 99%
“…Equation (2) is an approximation to the original distance and computes faster than Equation (1). In the test data used in this work, less than 2% of strings contain a repeated 2-gram, while repeated 3-grams are even more rare.…”
Section: Error Counting Methodsmentioning
confidence: 99%
“…However, neither mechanism guarantees superior performance for every query [1]. They encourage the use of unstructured 'natural language' queries by example text (for example, find all documents with a title like 'modeling and reuse of information over time') and return lists of texts ranked according to their similarity with the query.…”
Section: Introductionmentioning
confidence: 99%
“…) Of all the arguments put forward above, only one (that Boolean search is difficult for novice users) seems valid. A study by Paris and Tibbo () also questioned the criticism of Boolean retrieval:
These results do not in any way prove the superiority of partial match techniques or exact match techniques, but they do suggest that different queries demand different techniques. Further study and analysis are needed to determine which elements of a query make it best suited for partial match or exact match retrieval.
…”
Section: Boolean Retrievalmentioning
confidence: 99%