Melola Discovery

← Melola Discovery

Jurnal Tanpa peringkat SINTA

Textual Entailment for Non-Disclosure Agreement Contract Using ALBERT Method

Recursive Journal of Informatics · Vol. 3 No. 1 (2025) · hlm. 51–58

DOI
10.15294/rji.v3i1.9730
ISSN
2986-6588, 2963-5551
Terbit
2025-03-28
Penerbit
Universitas Negeri Semarang
Bahasa
eng

Abstrak

Purpose: NDA (Non-Disclosure Agreement) is one type of contract letter. An NDA binds two or more parties who all agree that certain information shared or created by one party is confidential. This type of contract serves to protect sensitive information, maintain patent rights, or control the information shared. Reading and understanding a contract letter is a repetitive, time-consuming, and labor-intensive process. Nevertheless, the activity is still crucial in the business world, as it can bind two or more parties under the law. This problem is perfect for Artificial Intelligence using Deep Learning. Therefore, this research aims to test and develop a pretrained language model that is designed for understanding contract letters through Natural Language Inference task. Method The method used is to train model to perform the language inference task of textual entailment using CNLI (Contract NLI) dataset. ALBERT-base model version that has been tuned to perform textual entailment is used along with LambdaLR for early stopping and AdamW as optimizer. The model is pre-trained with CNLI dataset several times with multiple hyperparameter. Result: As a result, the ALBERT base model that was used showed an accuracy score of 85 and EM score up to 85.04 percent. Although this score is not the State of the Art of the CNLI benchmark, the trained model can outperform other base versions of model that based on BERT and BART, like SpanNLI BERT-base, SCROLLS (BART-base) and Unlimiformer (BART-base). Value: ALBERT is a model that focuses on memory efficiency and small size parameters while maintaining performance. This model is suitable for performing tasks that require long context understanding with minimum hardware requirements. Such a model could be promising for the future of NLP in the legal area.

Kata kunci

Jaringan kolaborasi para penulis

40 penulis · 187 tautan kepenulisan bersama · 26 lintas organisasi · menampilkan 40 yang paling banyak terhubung

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • Institut Teknologi Kalimantan
  • State University of Semarang
  • National Research and Innovation Agency
  • Newcastle University
  • Afiliasi tidak diketahui
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama
Alamsyah AlamsyahInstitut Teknologi Kalimantan7
Much Aziz MuslimState University of Semarang3
Endang SugihartiState University of Semarang3
Amalia Ika WulandariAfiliasi tidak diketahui3
Riza ArifudinState University of Semarang2
Chris Jeremy Verian SitorusInstitut Teknologi Kalimantan2
Muhammad Uswah PawaraInstitut Teknologi Kalimantan2
Rodlian Jamal IkhwaniInstitut Teknologi Kalimantan2
Suardi SuardiAfiliasi tidak diketahui2
Amalia Ika WulandariInstitut Teknologi Kalimantan2
Suardi SuardiInstitut Teknologi Kalimantan2
Lisa AriyantiState University of Semarang2
Budi PrasetiyoState University of Semarang1
Jumanto JumantoState University of Semarang1
Rofik RofikState University of Semarang1
Charles Sambera KalaAfiliasi tidak diketahui1
Niti Gede KumandangInstitut Teknologi Kalimantan1
Arif Nur IskandarAfiliasi tidak diketahui1
Taufik HidayatNational Research and Innovation Agency1
Taufik HidayatInstitut Teknologi Kalimantan1
Arif Nur IskandarInstitut Teknologi Kalimantan1
Abrari Noor HasmiAfiliasi tidak diketahui1
Abrari Noor HasmiInstitut Teknologi Kalimantan1
Asram Dio PratamaInstitut Teknologi Kalimantan1
Rodlian Jamal IkhwaniAfiliasi tidak diketahui1
Irvan SetiawanInstitut Teknologi Kalimantan1
Destyariani Liana PutriAfiliasi tidak diketahui1
Alan Dicky Swans SaragihAfiliasi tidak diketahui1
Anggoronadhi DianiswaraAfiliasi tidak diketahui1
Destyariani Liana PutriInstitut Teknologi Kalimantan1
Alan Dicky Swans SaragihInstitut Teknologi Kalimantan1
Anggoronadhi DianiswaraInstitut Teknologi Kalimantan1
Wira SetiawanAfiliasi tidak diketahui1
Muhammad Uswah PawaraAfiliasi tidak diketahui1
Andi Mursid Nugraha ArifuddinAfiliasi tidak diketahui1
Samsu Dlukha NurcholiqAfiliasi tidak diketahui1
Wira SetiawanNewcastle University1
Andi Mursid Nugraha ArifuddinInstitut Teknologi Kalimantan1

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Sumber metadata: OAI-PMH (metadata jurnal) https://journal.unnes.ac.id/journals/rji/oai, pertama di-harvest 6 Nov 2026, terakhir terlihat 8 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en">Textual Entailment for Non-Disclosure Agreement Contract Using ALBERT Method</dc:title>
	<dc:creator xml:lang="en">Azmi, Abdillah</dc:creator>
	<dc:creator xml:lang="en">Alamsyah, Alamsyah</dc:creator>
	<dc:subject xml:lang="en">NLI</dc:subject>
	<dc:subject xml:lang="en">ALBERT</dc:subject>
	<dc:subject xml:lang="en">Textual Entailment</dc:subject>
	<dc:subject xml:lang="en">NLP</dc:subject>
	<dc:subject xml:lang="en">Contract</dc:subject>
	<dc:subject xml:lang="en">Finetuning</dc:subject>
	<dc:subject xml:lang="en">NDA</dc:subject>
	<dc:subject xml:lang="en">Deep Learning</dc:subject>
	<dc:subject xml:lang="en">Language Model</dc:subject>
	<dc:description xml:lang="en">Purpose: NDA (Non-Disclosure Agreement) is one type of contract letter. An NDA binds two or more parties who all agree that certain information shared or created by one party is confidential. This type of contract serves to protect sensitive information, maintain patent rights, or control the information shared. Reading and understanding a contract letter is a repetitive, time-consuming, and labor-intensive process. Nevertheless, the activity is still crucial in the business world, as it can bind two or more parties under the law. This problem is perfect for Artificial Intelligence using Deep Learning. Therefore, this research aims to test and develop a pretrained language model that is designed for understanding contract letters through Natural Language Inference task.
Method The method used is to train model to perform the language inference task of textual entailment using CNLI (Contract NLI) dataset. ALBERT-base model version that has been tuned to perform textual entailment is used along with LambdaLR for early stopping and AdamW as optimizer. The model is pre-trained with CNLI dataset several times with multiple hyperparameter.
Result: As a result, the ALBERT base model that was used showed an accuracy score of 85 and EM score up to 85.04 percent. Although this score is not the State of the Art of the CNLI benchmark, the trained model can outperform other base versions of model that based on BERT and BART, like SpanNLI BERT-base, SCROLLS (BART-base) and Unlimiformer (BART-base).
Value: ALBERT is a model that focuses on memory efficiency and small size parameters while maintaining performance. This model is suitable for performing tasks that require long context understanding with minimum hardware requirements. Such a model could be promising for the future of NLP in the legal area.</dc:description>
	<dc:publisher xml:lang="en">Universitas Negeri Semarang</dc:publisher>
	<dc:date>2025-03-28</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://journal.unnes.ac.id/journals/rji/article/view/9730</dc:identifier>
	<dc:identifier>10.15294/rji.v3i1.9730</dc:identifier>
	<dc:source xml:lang="en">Recursive Journal of Informatics; Vol. 3 No. 1 (2025): March 2025; 51-58</dc:source>
	<dc:source>2986-6588</dc:source>
	<dc:source>2963-5551</dc:source>
	<dc:source>10.15294/rji.v3i1</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://journal.unnes.ac.id/journals/rji/article/view/9730/3435</dc:relation>
	<dc:rights xml:lang="en">Copyright (c) 2025 Recursive Journal of Informatics</dc:rights>
</oai_dc:dc>