Academia.eduAcademia.edu

Outline

Title
Abstract
Introduction
Experimental Results
Conclusion
References
All Topics
Computer Science
Computational Linguistics

Part of Speech Based Term Weighting for Information Retrieval

Profile image of C. LiomaC. Lioma

Abstract

Automatic language processing tools typically assign to terms so-called 'weights' corresponding to the contribution of terms to information content. Traditionally, term weights are computed from lexical statistics , e.g., term frequencies. We propose a new type of term weight that is computed from part of speech (POS) n-gram statistics. The proposed POS-based term weight represents how informative a term is in general, based on the 'POS contexts' in which it generally occurs in language. We suggest five different computations of POS-based term weights by extending existing statistical approximations of term information measures. We apply these POS-based term weights to information retrieval, by integrating them into the model that matches documents to queries. Experiments with two TREC collections and 300 queries, using TF-IDF & BM25 as baselines, show that integrating our POS-based term weights to retrieval always leads to gains (up to +33.7% from the baseline). Additional experiments with a different retrieval model as baseline (Language Model with Dirichlet priors smoothing) and our best performing POS-based term weight, show retrieval gains always and consistently across the whole smoothing range of the baseline.

Related papers

Document retrieval using term frequency inverse sentence frequency weighting scheme
Indonesian Journal of Electrical Engineering and Computer Science

The Indonesian Journal of Electrical Engineering and Computer Science (IJEECS), 2023

The need for an efficient method to find the furthermost appropriate document corresponding to a particular search query has become crucial due to the exponential development in the number of papers that are now readily available to us on the web. The vector space model (VSM) a perfect model used in “information retrieval”, represents these words as a vector in space and gives them weights via a popular weighting method known as term frequency inverse document frequency (TF-IDF). In this research, work has been proposed to retrieve the most relevant document focused on representing documents and queries as vectors comprising average term term frequency inverse sentence frequency (TF-ISF) weights instead of representing them as vectors of term TF-IDF weight and two basic and effective similarity measures: Cosine and Jaccard were used. Using the MS MARCO dataset, this article analyzes and assesses the retrieval effectiveness of the TF-ISF weighting scheme. The result shows that the TF-ISF model with the Cosine similarity measure retrieves more relevant documents. The model was evaluated against the conventional TF-ISF technique and shows that it performs significantly better on MS MARCO data (Microsoft-curated data of Bing queries).

View PDFchevron_right
An Adaptive Context-based Algorithm for Term Weighting
Marco Ernandes, Leonardo Rigutini

2007

Term weighting systems are of crucial importance in Information Extraction and Information Retrieval applications. Common approaches to term weighting are based either on statistical or on natural language analysis. In this paper, we present a new algorithm that capitalizes from the advantages of both the strategies by adopting a machine learning approach. In the proposed method, the weights are computed by a parametric function, called Context Function, that models the semantic influence exercised amongst the terms of the same context. The Context Function is learned from examples, allowing the use of statistical and linguistic information at the same time. The novel algorithm was successfully tested on crossword clues, which represent a case of Single-Word Question Answering.

View PDFchevron_right
A supervised term-weighting technique for topic-based retrieval
Fernando Delbianco

2020

This article presents a technique for term weighting that relies on a collection of documents labeled as relevant or irrelevant to a topic of interest. The proposed technique weights terms based on two factors representing the descriptive and discriminating power of the terms. These factors are combined through the use of an adjustable parameter into a general measure that allows for the selection of query terms that independently favor different aspects of retrieval. The proposed weighting technique is applied in the development of topic-based retrieval strategies that can favor precision, recall or a balance between both. The strategies are analyzed using a collection of news from the The Guardian newspaper, labeled by the authors, the 20 newsgroups data set, and the Reuters-21578 collection. Finally, a comparative evaluation of retrieval effectiveness for different retrieval goals is completed. The results demonstrate that, despite its simplicity, our method is competitive with s...

View PDFchevron_right
On setting the hyper-parameters of term frequency normalization for information retrieval
Iadh Ounis

2007

Abstract The setting of the term frequency normalization hyper-parameter suffers from the query dependence and collection dependence problems, which remarkably hurt the robustness of the retrieval performance. Our study in this article investigates three term frequency normalization methods, namely normalization 2, BM25's normalization and the Dirichlet Priors normalization.

View PDFchevron_right
Improvement of term weight result in the information retrieval systems
amril mutoi

2017 4th International Conference on New Media Studies (CONMEDIA)

Now finding relevant information is absolutely needed by users of the information. Actually, finding relevant information is more difficult than just looking for information. The presence information retrieval (IR) system is a system for automatically searching the relevant information to the user needs, which is expressed in the required query, and this query will be used as an input and processed by IR system and then will get relevant documents to the required query. One of methods of finding relevant information by query is term weighting by both query and document. The commonly used methods are the term weighting of local and global weighting, while the local term weighting algorithms that are used such as TF, TF logarithmic, binary TF and augmented TF and global weighting is IDF, IDFP, IDFB. In this research, besides of comparison of term weighting algorithms, it is also proposed new improvement in term weighting algorithms by adding global weight value that changes base 10 lo...

View PDFchevron_right
Term Weighting Using Term Dependence
Raj Bisht

International Journal of Computer Applications, 2010

Performance of an information retrieval system depends on its weighting scheme. Weighting of a term can be seen in two aspects, local and global. For each type of weighting scheme, generally, single terms are considered. Term dependency is quite natural in a document. Word pairs or phrases can better describe a document in place of single terms. In the present paper an attempt has been made to study and quantify the dependency of terms to each other. Term dependency has been utilized to define a local weighting scheme for word pairs. Utility of the proposed weighting scheme has been shown by arbitrarily choosing some documents and extracting relevant word pairs from the documents.

View PDFchevron_right
Improving Term Frequency Normalization for Multi-topical Documents and Application to Language Modeling Approaches
Seung-Hoon Na

Lecture Notes in Computer Science, 2008

Term frequency normalization is a serious issue since lengths of documents are various. Generally, documents become long due to two different reasons -verbosity and multi-topicality. First, verbosity means that the same topic is repeatedly mentioned by terms related to the topic, so that term frequency is more increased than the well-summarized one. Second, multi-topicality indicates that a document has a broad discussion of multi-topics, rather than single topic. Although these document characteristics should be differently handled, all previous methods of term frequency normalization have ignored these differences and have used a simplified length-driven approach which decreases the term frequency by only the length of a document, causing an unreasonable penalization. To attack this problem, we propose a novel TF normalization method which is a type of partially-axiomatic approach. We first formulate two formal constraints that the retrieval model should satisfy for documents having verbose and multi-topicality characteristic, respectively. Then, we modify language modeling approaches to better satisfy these two constraints, and derive novel smoothing methods. Experimental results show that the proposed method increases significantly the precision for keyword queries, and substantially improves MAP (Mean Average Precision) for verbose queries.

View PDFchevron_right
Relevance Feedback for Best Match Term Weighting Algorithms in Information Retrieval
Stephen Robertson

Acta, 2001

Personalisation in full text retrieval or full text filtering implies reweighting of the query terms based on some explicit or implicit feedback from the user. Relevance feedback inputs the user's judgements on previously retrieved documents to construct a personalised query or user profile. This paper studies relevance feedback within two probabilistic models of information retrieval: the first based on statistical language models and the second based on the binary independence probabilistic model. The paper shows the resemblance of the approaches to relevance feedback of these models, introduces new approaches to relevance feedback for both models, and evaluates the new relevance feedback algorithms on the TREC collection. The paper shows that there are no significant differences between simple and sophisticated approaches to relevance feedback.

View PDFchevron_right
Modeling term associations for ad-hoc retrieval performance within language modeling framework
W. Bruce Croft

2007

Previous research has shown that using term associations could improve the effectiveness of information retrieval (IR) systems. However, most of the existing approaches focus on query reformulation. Document reformulation has just begun to be studied recently. In this paper, we study how to utilize term association measures to do document modeling, and what types of measures are effective in document language models.

View PDFchevron_right
Using the Co-occurrence of Words for Retrieval Weighting
Elke Mittendorf

Information Retrieval, 2000

We have applied the well-known Robertson-Sparck Jones weighting to sets of indexing features that are different from word-based features. Our features describe the co-occurrences of words in a window range of predefined size. The experiments have been designed to analyse the value of features that are beyond word-based features but all used retrieval methods can be motivated strictly in the

View PDFchevron_right

References (36)

  1. J. A. Aslam and V. Pavlu. Query hardness estimation using Jensen-Shannon divergence among multiple scoring functions. In ECIR, pages 198-209, 2007.
  2. H. Baayen, H. van Halteren, and F. Tweedie. Outside the cave of shadows: using syntactic annotation to enhance authorship attribution. Literary and Linguistic Computing, 11(3):121-131, 1996.
  3. A. Bas, D. Denison, E. Keizer, and G. Popova, editors. Fuzzy Grammar, a Reader. Oxford University Press, 2004.
  4. A. Bookstein and D. Swanson. Probabilistic models for automatic indexing. JASIS, 25:312-318, 1974.
  5. B. C. Brookes. The measure of information retrieval effectiveness proposed by Swets. Journal of Documentation, 24:41-54, 1968.
  6. P. F. Brown, V. J. Della Pietra, P. V. deSouza, J. C. Lai, and R. L. Mercer. Class- based n-gram models of natural language. Computational Linguistics, 18(4):467- 479, 1992.
  7. C. Buckley, A. Singhal, and M. Mitra. New retrieval approaches using Smart: TREC 4. In TREC-4, pages 25-48, 1995.
  8. K. W. Church and W. A. Gale. Poisson mixtures. Natural Language Engineering, 1(2):163-190, 1995.
  9. W. S. Cooper, A. Chen, and F. Gey. Full text retrieval based on probalistic equa- tions with coefficients fitted by logistic regression. In TREC-2, pages 57-66, 1993.
  10. S. Corston-Oliver, E. Ringer, M. Gamon, and R. Campbell. Task-focused summa- rization of email. In Text Summarization Branches Out: Proceedings of the ACL-04 Workshop, pages 43-50, 2004.
  11. N. Craswell, S. E. Robertson, H. Zaragoza, and M. J. Taylor. Relevance weighting for query independent evidence. In SIGIR, pages 416-423, 2005.
  12. B. Croft and J. Lafferty. Language Modeling for Information Retrieval. Kluwer Academic Publishers, 2003.
  13. S. P. Harter. A probabilistic approach to automatic keyword indexing: Part I. On the distribution of specialty words in a technical literature. JASIS, 26(4):197-206, 1975.
  14. R. Hwa, P. Resnik, A. Weinberg, and O. Kolak. Evaluating translational corre- spondence using annotation projection. In ACL, pages 392-399, 2002.
  15. O. Jespersen. The Philosophy of Grammar. Allen and Unwin, 1929.
  16. M. Koppel, S. Argamon, and A. R. Shimoni. Automatically categorizing written texts by author gender. Literary and Linguistic Computing, (4):401-412, 2003.
  17. C. Lioma and I. Ounis. Light syntactically-based index pruning for information retrieval. In ECIR, pages 88-100, 2007.
  18. C. Lioma and C. J. K. van Rijsbergen. Part of speech n-grams and information retrieval. RFLA, 8:9-22, 2008.
  19. J. Lyons. Semantics: Volume 2. Cambridge University Press, Cambridge, 1977.
  20. E. L. Margulis. N-Poisson document modelling. In SIGIR, pages 177-189, 1992.
  21. J. Mikk. Prior knowledge of text content and values of text characteristics. Journal of Quantitative Linguistics, 8(1):67-80, 2001.
  22. C. Monz. Model tree learning for query term weighting in question answering. In ECIR, pages 589-596, 2007.
  23. S. Ozmutlu, A. Spink, and H. C. Ozmutlu. A day in the life of Web searching: an exploratory study. Inf. Process. Manage., 40(2):319-345, 2004.
  24. K. Papineni. Why inverse document frequency? In NAACL, pages 25-33, 2001.
  25. M. Pasca. High-Performance Open-Domain Question Answering from Large Text Collections. PhD thesis, Southern Methodist University, 2001.
  26. A. Ratnaparkhi. A maximum entropy model for part-of-speech tagging. In EMNLP, pages 130-142, 1996.
  27. J. D. M. Rennie and T. Jaakkola. Using term informativeness for named entity detection. In SIGIR pages 353-360
  28. S. Robertson and K. Sparck Jones. Relevance weighting of search terms. Journal of the American Society of Information Science, 27:129-146, 1976.
  29. S. Robertson and S. Walker. Some simple approximations to the 2-Poisson model for probabilistic weighted retrieval. In SIGIR, pages 232-241. Springer-Verlag, 1994.
  30. M. Santini, R. Power, and R. Evans. Implementing a characterization of genre for automatic genre identification of Web pages. In COLING/ACL, pages 699-706, 2006.
  31. H. Schmid. Probabilistic part-of-speech tagging using decision trees. New Methods in Language Processing Studies, 1997.
  32. A. Singhal, C. Buckley, and M. Mitra. Pivoted document length normalization. In SIGIR, pages 21-29. ACM Press, 1996.
  33. K. Sparck Jones. A statistical interpretation of term specificity and its application in retrieval. Journal of Documentation, 28:11-21, 1972.
  34. T. Tao and C. Zhai. An exploration of proximity measures in information retrieval. In SIGIR, pages 295-302. ACM, 2007.
  35. E. M. Voorhees and D. K. Harman. TREC: Experiment and Evaluation in Infor- mation Retrieval. MIT Press, 2005.
  36. J. Wagner, J. Foster, and J. van Genabith. A comparative evaluation of deep and shallow approaches to the automatic detection of common grammatical errors. In EMNLP-CoNLL, pages 112-121, 2007.

Related papers

Term Frequency With Average Term Occurrences For Textual Information Retrieval
Osman Ibrahim

2016

In the context of Information Retrieval (IR) from text documents, the term-weighting scheme (TWS) is a key component of the matching mechanism when using the vector space model (VSM). In this paper we propose a new TWS that is based on computing the average term occurrences of terms in documents and it also uses a discriminative approach based on the document centroid vector to remove less significant weights from the documents. We call our approach Term Frequency With Average Term Occurrence (TF-ATO). An analysis of commonly used document collections shows that test collections are not fully judged as achieving that is expensive and may be infeasible for large collections. A document collection being fully judged means that every document in the collection acts as a relevant document to a specific query or a group of queries. The discriminative approach used in our proposed approach is a heuristic method for improving the IR effectiveness and performance, and it has the advantage of not requiring previous knowledge about relevance judgements. We compare the performance of the proposed TF-ATO to the well-known TF-IDF approach and show that using TF-ATO results in better effectiveness in both static and dynamic document collections. In addition , this paper investigates the impact that stop-words removal and our discriminative approach have on TF-IDF and TF-ATO. The results show that both, stop-words removal and the discriminative approach, have a positive effect on both term-weighting schemes. More importantly, it is shown that using the proposed dis-criminative approach is beneficial for improving IR effectiveness and performance with no information in the relevance judgement for the collection.

View PDFchevron_right
A novel term weighting scheme based on discrimination power obtained from past retrieval results
Sung-Hyon Myaeng

Term weighting for document ranking and retrieval has been an important research topic in information retrieval for decades. We propose a novel term weighting method based on a hypothesis that a term's role in accumulated retrieval sessions in the past affects its general importance regardless. It utilizes availability of past retrieval results consisting of the queries that contain a particular term, retrieved documents, and their relevance judgments. A term's evidential weight, as we propose in this paper, depends on the degree to which the mean frequency values for the relevant and non-relevant document distributions in the past are different. More precisely, it takes into account the rankings and similarity values of the relevant and non-relevant documents. Our experimental result using standard test collections shows that the proposed term weighting scheme improves conventional TF Ã IDF and language model based schemes. It indicates that evidential term weights bring in a new aspect of term importance and complement the collection statistics based on TF Ã IDF. We also show how the proposed term weighting scheme based on the notion of evidential weights are related to the well-known weighting schemes based on language modeling and probabilistic models.

View PDFchevron_right
Modeling using Term Dependencies and Term Weighting in Information Retrieval Systems
Doaa Mabrouk

2018

The process of information retrieval has become a fact of life because of the great growth of the internet and information. In this paper, retrieval models are discussed. These models are classified according to two different mathematical modeling approaches: term dependency models and term weighting models. Some models assume term independence, while others consider this dependency relation. On the other hand, term weighting is a method that tries to index the document in an effective way. The aim of this paper is to discuss and evaluate different information retrieval models which employ both terms dependence/independence, as well as term weighting.

View PDFchevron_right
Relevance Weighting of Search Terms
Stephen Robertson

This paper examines statistical techniques for exploiting relevance information to weight search terms. These techniques are presented as a natural extension of weighting methods using information about the distribution of index terms in documents in general. A series of relevance weighting functions is derived and is justified by theoretical considerations. In particular, it is shown that specific weighted search methods are implied by a general probabilistic theory of retrieval. Different applications of relevance weighting are illustrated by experimental results for test collections.

View PDFchevron_right
Assessing the behavior and performance of a supervised term-weighting technique for topic-based retrieval
Fernando Tohme

Information Processing & Management, 2021

This article analyses and evaluates FDD β , a supervised term-weighting scheme that can be applied for query-term selection in topic-based retrieval. FDD β weights terms based on two factors representing the descriptive and discriminating power of the terms with respect to the given topic. It then combines these two factor through the use of an adjustable parameter that allows to favor different aspects of retrieval, such as precision, recall or a balance between both. The article makes the following contributions: (1) it presents an extensive analysis of the behavior of FDD β as a function of its adjustable parameter; (2) it compares FDD β against eighteen traditional and state-of-the-art weighting scheme; (3) it evaluates the performance of disjunctive queries built by combining terms selected using the analyzed methods; (4) it introduces a new public data set with news labeled as relevant or irrelevant to the economic domain. The analysis and evaluations are performed on three data sets: two well-known text data sets, namely 20 Newsgroups and Reuters-21578, and the newly released data set. It is possible to conclude that despite its simplicity, FDD β is competitive with state-of-the-art methods and has the important advantage of offering flexibility at the moment of adapting

View PDFchevron_right

Related topics

  • Computational Linguistics
    • 580 California St., Suite 400
    San Francisco, CA, 94104
    © 2025 Academia. All rights reserved