Tathmini ya Kukubalika kwa Lugha — Hukumu ya Sarufi
Tathmini ya kukubalika kwa lugha ni kazi ya usindikaji wa lugha asilia ambayo hutathmini kiotomatiki iwapo sentensi ingehukumiwa kuwa ya kukubalika kwa sarufi na mzungumzaji wa lugha lengwa. Kulingana na tofauti ya Chomsky (1957) kati ya matamshi yenye sarufi na yasiyo na sarufi, kazi hiyo ilifanywa rasmi kama kigezo cha neural na Warstadt, Singh na Bowman (2019) kupitia Kifungu cha Kukubalika kwa Lugha (CoLA). Inatumika katika utafiti wa kujifunza lugha, masomo ya isimu, na ukaguzi wa ubora wa mifumo ya uzalishaji wa lugha asilia (NLG).
Soma mbinu kamili
Ingia kwa akaunti ya bure ili kusoma sehemu hii.
Method map
The neighbourhood of related methods — select a node to explore.
Vyanzo
- Warstadt, A., Singh, A. & Bowman, S. (2019). Neural Network Acceptability Judgments. Transactions of the Association for Computational Linguistics, 7, 625–641. DOI: 10.1162/tacl_a_00290 ↗
- Chomsky, N. (1957). Syntactic Structures. Mouton, The Hague. ISBN: 978-9027933249
Jinsi ya kunukuu ukurasa huu
ScholarGate. (2026, June 1). Linguistic Acceptability Assessment (Grammaticality Judgment). ScholarGate. https://scholargate.app/sw/text-mining/linguistic-acceptability
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- BERT EmbeddingsUchimbaji wa Matini↔ compare
- Uchanganuzi wa HisiaUchimbaji wa Matini↔ compare
- Uainishaji wa MaandishiUchimbaji wa Matini↔ compare
- TF-IDFUchimbaji wa Matini↔ compare
Umeona tatizo kwenye ukurasa huu? Ripoti au pendekeza marekebisho →