A phrase‐based matching function

Giulia Galbiati

Journal of the American Society for Information Science, 1991, vol. 42, issue 1, 36-48

Abstract: In this article we claim that the retrieval capability of information retrieval systems based on the binary vector model can be improved if the indexing language allows us to specify simple phrases in addition to keywords. A matching function between a document and a query is defined that takes into account the syntactic structure of the phrases. The function has values that fall within a predefined interval having as bounds respectively the Jaccard coefficient and a value slightly bigger than the Dice coefficient. Based on a measure of closeness between the terms of a query and the phrases of a document, the function ranges from the lower to the upper value. © 1991 John Wiley & Sons, Inc.

Date: 1991
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/(SICI)1097-4571(199101)42:13.0.CO;2-A

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:bla:jamest:v:42:y:1991:i:1:p:36-48

Ordering information: This journal article can be ordered from
https://doi.org/10.1002/(ISSN)1097-4571

Access Statistics for this article

More articles in Journal of the American Society for Information Science from Association for Information Science & Technology
Bibliographic data for series maintained by Wiley Content Delivery ().