Results 51 to 60 of about 10,677,937 (263)

P(Expression|Grammar): Probability of deriving an algebraic expression with a probabilistic context-free grammar [PDF]

open access: yes, 2022
Probabilistic context-free grammars have a long-term record of use as generative models in machine learning and symbolic regression. When used for symbolic regression, they generate algebraic expressions.
Primožič, Urh   +2 more
core  

Thickness‐Defined Transport Regime Toward Near‐Ideal Area‐Type Switching

open access: yesAdvanced Materials, EarlyView.
By thinning the oxide layer, memristors pass from diode‐like and battery‐effect‐dominated behavior toward eventual short‐circuit failure. Within the intermediate 5–6 nm window, they reach a near‐ideal analog area‐type switching regime, featuring symmetric hysteresis, area‐dependent conductance, and continuous linear programming of HRS and LRS with ...
Cuo Wu   +12 more
wiley   +1 more source

Accelerated probabilistic inference of RNA structure evolution

open access: yesBMC Bioinformatics, 2005
Background Pairwise stochastic context-free grammars (Pair SCFGs) are powerful tools for evolutionary analysis of RNA, including simultaneous RNA sequence alignment and secondary structure prediction, but the associated algorithms are intensive in both ...
Holmes Ian
doaj   +1 more source

Evolutionary Parsing for a Probabilistic Context Free Grammar [PDF]

open access: yes, 2001
Classic parsing methods are based on complete search techniques to find the different interpretations of a sentence. However, the size of the search space increases exponentially with the length of the sentence or text to be parsed, so that exhaustive search methods can fail to reach a solution in a reasonable time.
openaire   +1 more source

LLM‐Integrated Human–Robot Interaction System for Microrobots

open access: yesAdvanced Robotics Research, EarlyView.
This paper proposes an LLM‐based control framework for guiding microrobots using human natural language. This framework can convert the natural human speech into safe and executable command sets for reliable navigation in complex environments. The experimental results show high accuracy and robustness in task performance, demonstrating the potential of
Bairong Zhu, Amar Salehi, Tingting Yu
wiley   +1 more source

Evaluating Computational Language Models with Scaling Properties of Natural Language

open access: yesComputational Linguistics, 2019
In this article, we evaluate computational models of natural language with respect to the universal statistical behaviors of natural language. Statistical mechanical analyses have revealed that natural language text is characterized by scaling properties,
Takahashi, Shuntaro   +1 more
doaj   +1 more source

Learning probabilistic context-free grammars from treebanks [PDF]

open access: yes, 2003
This paper describes the application of a new model to learn probabilistic context-free grammars (PCFGs) from a tree bank corpus. The model estimates the probabilities according to a generalized k-gram scheme for trees.It allows for faster parsing,decreases considerably the perplexity of the test samples and tends to give more structured and refined ...
Jose L. Verdú-Mas   +2 more
openaire   +1 more source

Push the Limits: Human‐Like Multimodal Extreme Embodied Intelligence for Autonomous Racing

open access: yesAdvanced Robotics Research, EarlyView.
Autonomous racing tests embodied intelligence under extreme control limits of speed, actuation, and decision‐making. Inspired by human multimodality, we present Apex, an embodied agent deployed on a super‐formula racing car at Yas Marina. Integrating physics‐informed perception, multimodal learning, and tasking, Apex cuts lap times by 15% and achieves ...
Yanxin Zhou   +13 more
wiley   +1 more source

Mixture Probabilistic Context-Free Grammar

open access: yesJournal of Natural Language Processing, 1996
This paper proposes an improved probabilistic CFG (Context-Free Grammar), called the mixture probabilistic CFG, based on an idea of cluster-based language modeling. This model assumes that the language model parameters have different probability distributions in different topics or domains.
openaire   +3 more sources

Hidden Abstract Stack Markov Models with Learning Process

open access: yesMathematics
We present hidden abstract stack Markov models (HASMMs) with their learning process. The HASMMs we offer carry the more expressive nature of probabilistic context-free grammars (PCFGs) while allowing faster parameter fitting of hidden Markov models (HMMs)
Mete Özbaltan
doaj   +1 more source

Home - About - Disclaimer - Privacy