পদ্ধতির তুলনা করুন

	ব্যাখ্যাযোগ্য BERT-ভিত্তিক শ্রেণীবিভাগ	বাক্য এমবেডিং
ক্ষেত্র	গভীর শিখন	গভীর শিখন
পরিবার	Machine learning	Machine learning
উদ্ভবের বছর	2019–2020	2015–2019
প্রবর্তক	Devlin et al. (BERT); explainability methods by Lundberg & Lee (SHAP), Ribeiro et al. (LIME), Sundararajan et al. (Integrated Gradients)	Kiros et al. (Skip-Thought, 2015); Reimers & Gurevych (Sentence-BERT, 2019)
ধরন	Pre-trained transformer classifier with post-hoc or intrinsic explainability	Representation learning / embedding
মৌলিক উৎস	Devlin, J., Chang, M.-W., Lee, K., & Toutanova, K. (2019). BERT: Pre-training of deep bidirectional transformers for language understanding. Proceedings of NAACL-HLT 2019, pp. 4171–4186.	Reimers, N., & Gurevych, I. (2019). Sentence-BERT: Sentence Embeddings using Siamese BERT-Networks. Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing (EMNLP), 3980–3990.
অপর নাম	XAI-BERT, interpretable BERT classifier, BERT with post-hoc explanation, transparent BERT classification	sentence vectors, sentence representations, SBERT, semantic sentence encoding
সম্পর্কিত	6	4
সারসংক্ষেপ	Explainable BERT-based Classification combines the predictive power of fine-tuned BERT transformers for text classification with post-hoc or intrinsic explainability techniques — such as SHAP, LIME, attention analysis, or integrated gradients — to reveal which words or tokens drove each prediction. The result is a classifier that is both accurate and interpretable enough for high-stakes or auditable NLP applications.	Sentence Embeddings convert a sentence or short text into a single fixed-length dense vector that captures its semantic meaning. These vectors allow downstream tasks — semantic similarity, clustering, retrieval, and classification — to operate on numerical representations instead of raw text, making them one of the most versatile building blocks in modern NLP pipelines.