Results 81 to 90 of about 595,495 (293)
Exploiting multi-word units in history-based probabilistic generation [PDF]
We present a simple history-based model for sentence generation from LFG f-structures, which improves on the accuracy of previous models by breaking down PCFG independence assumptions so that more f-structure conditioning context is used in the ...
Cahill, Aoife +7 more
core +2 more sources
Maximum Entropy and Gradient Harmonic Grammar are well-established grammatical models for the analysis of linguistic phenomena, but we demonstrate that their probabilistic versions are inherently unidentifiable, employing parameters that cannot be ...
Kosmas Kosmidis +2 more
doaj +1 more source
A Probabilistic Generative Grammar for Semantic Parsing
Domain-general semantic parsing is a long-standing goal in natural language processing, where the semantic parser is capable of robustly parsing sentences from domains outside of which it was trained. Current approaches largely rely on additional supervision from new domains in order to generalize to those domains.
Abulhair Saparov, Tom M. Mitchell
openaire +3 more sources
A carrier‐free zinc‐coordinated polyphenol nanoplatform (ZnCA NPs) is designed as an “all‐in‐one” therapeutic strategy for intestinal inflammation. The ZnCA NPs exhibit enhanced colonic accumulation and broad‐spectrum reactive oxygen and nitrogen species scavenging.
Qiwen Xie +7 more
wiley +1 more source
LLMs and syntactic theory: Lexical Functional Grammar has no fear [PDF]
This paper responds to Chesi’s paper Is it the end of (generative) linguistics as we know it? from the perspective of a computational linguist who works within one of several generative syntactic frameworks, namely Lexical Functional ...
Miriam Butt
doaj +1 more source
Covariance in Unsupervised Learning of Probabilistic Grammars
Probabilistic grammars offer great flexibility in modeling discrete sequential data like natural language text. Their symbolic component is amenable to inspection by humans, while their probabilistic component helps resolve ambiguity. They also permit the use of well-understood, generalpurpose learning algorithms.
Cohen, S. B., Smith, Noah A.
openaire +3 more sources
Variational Inference for Grammar Induction with Prior Knowledge [PDF]
Variational EM has become a popular technique in probabilistic NLP with hidden variables. Commonly, for computational tractability, we make strong independence assumptions, such as the mean-field assumption, in approximating posterior distributions over ...
Noah A. Smith +3 more
core +1 more source
KFO‐Atlas reveals how real‐world aromas are organized as structured mixtures rather than individual molecules. Building on these principles, KFO‐Gen, a generative AI framework, designs perceptually valid aroma formulations and reconstructs meat‐like aromas exclusively from plant‐derived odorants, providing a foundation for mixture‐level studies and AI ...
Jingzhi Zhang +5 more
wiley +1 more source
Probabilistic context-free grammars for phonology [PDF]
We present a phonological probabilistic context-free grammar, which describes the word and syllable structure of German words. The grammar is trained on a large corpus by a simple supervised method, and evaluated on a syllabification task achieving 96.88% word accuracy on word tokens, and 90.33% on word types. We added rules for English phonemes to the
openaire +1 more source
MAPA transforms complex multi‐omics data into biologically coherent functional modules by integrating pathway information with molecular interaction networks. Retrieval‐augmented large language models then generate structured, literature‐informed interpretations.
Yifei Ge +13 more
wiley +1 more source

