Efficient utilization of pre-trained models: A review of sentiment analysis via prompt learning
K Bu, Y Liu, X Ju - Knowledge-Based Systems, 2024 - Elsevier
Sentiment analysis is one of the traditional well-known tasks in Natural Language
Processing (NLP) research. In recent years, Pre-trained Models (PMs) have become one of …
Processing (NLP) research. In recent years, Pre-trained Models (PMs) have become one of …
Markov logic networks
We propose a simple approach to combining first-order logic and probabilistic graphical
models in a single representation. A Markov logic network (MLN) is a first-order knowledge …
models in a single representation. A Markov logic network (MLN) is a first-order knowledge …
Gradience in grammar: Experimental and computational aspects of degrees of grammaticality
F Keller - 2000 - rucore.libraries.rutgers.edu
This thesis deals with gradience in grammar, ie, with the fact that some linguistic structures
are not fully acceptable or unacceptable, but receive gradient linguistic judgments. The …
are not fully acceptable or unacceptable, but receive gradient linguistic judgments. The …
[PDF][PDF] Contrastive estimation: Training log-linear models on unlabeled data
Conditional random fields (Lafferty et al., 2001) are quite effective at sequence labeling
tasks like shallow parsing (Sha and Pereira, 2003) and namedentity extraction (McCallum …
tasks like shallow parsing (Sha and Pereira, 2003) and namedentity extraction (McCallum …
Probabilistic reasoning with answer sets
This paper develops a declarative language, P-log, that combines logical and probabilistic
arguments in its reasoning. Answer Set Prolog is used as the logical foundation, while …
arguments in its reasoning. Answer Set Prolog is used as the logical foundation, while …
Parameter learning of logic programs for symbolic-statistical modeling
We propose a logical/mathematical framework for statistical parameter learning of
parameterized logic programs, ie definite clause programs containing probabilistic facts with …
parameterized logic programs, ie definite clause programs containing probabilistic facts with …
[PDF][PDF] Parameter estimation for probabilistic finite-state transducers
J Eisner - Proceedings of the 40th Annual Meeting of the …, 2002 - aclanthology.org
Weighted finite-state transducers suffer from the lack of a training algorithm. Training is even
harder for transducers that have been assembled via finite-state operations such as …
harder for transducers that have been assembled via finite-state operations such as …
Markov logic: A unifying framework for statistical relational learning
P Domingos, M Richardson - 2007 - direct.mit.edu
Interest in statistical relational learning (SRL) has grown rapidly in recent years. Several key
SRL tasks have been identified, and a large number of approaches have been proposed …
SRL tasks have been identified, and a large number of approaches have been proposed …
Stochastic attribute-value grammars
S Abney - arxiv preprint cmp-lg/9610003, 1996 - arxiv.org
Probabilistic analogues of regular and context-free grammars are well-known in
computational linguistics, and currently the subject of intensive research. To date, however …
computational linguistics, and currently the subject of intensive research. To date, however …
Parameter estimation in stochastic logic programs
J Cussens - Machine Learning, 2001 - Springer
Stochastic logic programs (SLPs) are logic programs with parameterised clauses which
define a log-linear distribution over refutations of goals. The log-linear distribution provides …
define a log-linear distribution over refutations of goals. The log-linear distribution provides …