Unsupervised Grouping of Public Procurement Similar Items: Which Text Representation Should I Use? (2024.lrec-main)
Copied to clipboard
Pedro P. V. Brum, Mariana O. Silva, Gabriel P. Oliveira, Lucas G. L. Costa, Anisio Lacerda, Gisele Pappa
| Challenge: | establishing reference prices is essential to guide competitors in setting product prices . however, selecting an appropriate representation for text is challenging . |
| Approach: | They propose a framework for text cleaning, extraction, and representation based on sentence representations for public procurement item descriptions. |
| Outcome: | The proposed approach captures the most important components of item descriptions. |
Similar Papers
pAtChWoRK: Patching the Pieces of Public Procurement Documents (2026.acl-demo)
Copied to clipboard
| Challenge: | pAtChWoRK corrects manual classification errors and extracts complex unstructured fields such as award and solvency criteria and tenders’ objectives. |
| Approach: | pAtChWoRK corrects manual classification errors and extracts complex unstructured fields such as award and solvency criteria and tenders’ objectives. |
| Outcome: | pAtChWoRK corrects manual classification errors and extracts complex unstructured fields such as award and solvency criteria and tenders’ objectives. |
Towards Unsupervised Text Classification Leveraging Experts and Word Embeddings (P19-1)
Copied to clipboard
| Challenge: | a new method for text classification uses supervised and semisupervised approaches to classify documents into categories. |
| Approach: | They propose an unsupervised method to classify documents into categories simply described by a label. |
| Outcome: | The proposed method increases F1-score over relying on human expertise and language models on standard corpora. |
Interpretable Text Embeddings and Text Similarity Explanation: A Survey (2025.emnlp-main)
Copied to clipboard
| Challenge: | Text embeddings are a fundamental component in many NLP tasks, but their interpretation and explanation remain challenging. |
| Approach: | They propose a framework for interpretable text embeddings and text similarity explanation . they characterize the main ideas, approaches, and trade-offs and discuss lessons learned . |
| Outcome: | The proposed methods are compared with existing models and compare them with existing ones. |
Sentence Meta-Embeddings for Unsupervised Semantic Textual Similarity (2020.acl-main)
Copied to clipboard
| Challenge: | Existing word embeddings combine complementary strengths of their components to achieve unsupervised semantic similarity (STS). |
| Approach: | They propose to ensemble pre-trained sentence encoders into sentence meta-embeddings to achieve unsupervised Semantic Textual Similarity (STS) they adapt dimensionality reduction, generalized Canonical Correlation Analysis and cross-view auto-encoders to their work. |
| Outcome: | The proposed method achieves 3.7% to 6.4% Pearson’s r over single-source word embeddings on the STS Benchmark and on the StS12-STS16 datasets. |
Advances in Pre-Training Distributed Word Representations (L18-1)
Copied to clipboard
| Challenge: | Pre-trained word representations are a building block of many Natural Language Processing and Machine Learning applications. |
| Approach: | They propose to combine known tricks and a set of publicly available pre-trained word vector representations to train high-quality representations. |
| Outcome: | The proposed models outperform the current state of the art on a number of tasks while maintaining a high training speed to scale to massive amount of data. |
A Survey of Unsupervised Dependency Parsing (2020.coling-main)
Copied to clipboard
| Challenge: | Syntactic dependency parsing is an important task in natural language processing . unsupervised learning of dependency parses requires training sentences to be manually annotated with their correct parse trees. |
| Approach: | They propose to survey existing approaches to unsupervised dependency parsing . they identify two major classes of approaches and discuss recent trends . |
| Outcome: | The proposed methods can be used in semantic parsing, machine translation, relation extraction, and many other tasks. |
LLMs Enable Bag-of-Texts Representations for Short-Text Clustering (2026.acl-long)
Copied to clipboard
| Challenge: | Existing methods for short text clustering require labeling and no embeddings optimization. |
| Approach: | They propose a training-free method for unsupervised short text clustering that relies less on careful selection of embedders than other methods. |
| Outcome: | The proposed method achieves comparable or superior results to state-of-the-art methods, but without embeddings optimization or prior knowledge of clusters or labels. |
A supervised approach to taxonomy extraction using word embeddings (L18-1)
Copied to clipboard
| Challenge: | a recent evaluation of a method for organizing texts into a hierarchy showed that it did not outperform a baseline. |
| Approach: | They propose a method that uses supervised learning to combine multiple features with a support vector machine classifier including the baseline features. |
| Outcome: | The proposed method outperforms the baseline method and provides stronger method for identifying taxonomic relations than previous methods. |
Text Similarity Estimation Based on Word Embeddings and Matrix Norms for Targeted Marketing (N19-1)
Copied to clipboard
| Challenge: | Existing methods to estimate document similarity based on word embeddings are mediocre . a recent study compared word and sentence embedded documents to a similarity estimate using matrix norms. |
| Approach: | They propose to combine word embeddings with matrix norms to obtain a similarity estimate. |
| Outcome: | The proposed method produces superior results for most of the investigated matrix norms compared to the classical cosine measure and several other similarity estimates. |
Controllable Clustering with LLM-driven Embeddings (2025.emnlp-industry)
Copied to clipboard
Kerria Pang-Naylor, Shivani Manivasagan, Aitong Zhong, Mehak Garg, Nicholas Mondello, Blake Buckner, Jonathan P. Chang, Khyati Mahajan, Masoud Hashemi, Fabio Casati
| Challenge: | Unsupervised text clustering is unlikely to produce groupings that work across use cases . authors present techniques to effectively control text embeddings with minimal human input . |
| Approach: | They propose techniques to control text embeddings with minimal human input . they evaluate clustering performance for datasets with multiple independent labels . |
| Outcome: | The proposed techniques improve clustering for one perspective or use case, but at a tradeoff in performance for another use case. |