Results 131 to 140 of about 73,786 (298)
Tensor Decomposition for Fast Parsing with Latent-Variable PCFGs [PDF]
We describe an approach to speed-up inference with latent-variable PCFGs, whichhave been shown to be highly effective for natural language parsing. Our approachis based on a tensor formulation recently introduced for spectral estimation oflatent-variable
Collins, Michael, Cohen, Shay
core
A machine‐learning framework for asymmetric C–H borylation bridges multi‐entity 3D molecular graphs and chemical literature. Atom‐resolved mechanistic annotations extracted by large language models augment three‐component graph encoding of catalyst, substrate, and product. The model predicts enantioselectivity with high accuracy on unseen scaffolds and
Zhe Wang +4 more
wiley +1 more source
Automatic evaluation of generation and parsing for machine translation with automatically acquired transfer rules [PDF]
This paper presents a new method of evaluation for generation and parsing components of transfer-based MT systems where the transfer rules have been automatically acquired from parsed sentence-aligned bitext corpora.
Josef Van Genabith +5 more
core +2 more sources
Parsing of Subject-Verb Agreement by German Infants
This study investigates the early parsing of subject–verb agreement in German-acquiring infants, focusing on whether morphosyntactic dependencies are parsed in real time when φ-feature morphology is the only available disambiguating cue. German offers a
Alejandra Keidel Fernández +1 more
doaj +1 more source
LLM‐Based Scientific Assistants for Knowledge Extraction: Which Design Choices Matter?
A comprehensive framework for optimizing Large Language Models in domain‐specific applications is introduced. The LLM Playground integrates Prompt Engineering, knowledge augmentation, and advanced reasoning strategies to enable systematic comparison of architectures and base models.
David Exler +7 more
wiley +1 more source
How do treebank annotation schemes influence parsing results? : or how not to compare apples and oranges [PDF]
In the last decade, the Penn treebank has become the standard data set for evaluating parsers. The fact that most parsers are solely evaluated on this specific data set leaves the question unanswered how much these results depend on the annotation scheme
Kübler, Sandra, Sandra Kübler
core
The Interoperability Challenge in DFT Workflows Across Implementations
Interoperability and cross‐validation remain major challenges in the computational materials science. In this work, we introduce a common input/output standard that enables internal translation across multiple workflow managers—AiiDA, PerQueue, Pipeline Pilot, and SimStack—while producing results in a unified schema.
Simon K. Steensen +13 more
wiley +1 more source
An Autonomous Large Language Model‐Agent Framework for Transparent and Local Time Series Forecasting
Architecture of the proposed large language model (LLM)‐based agent framework for autonomous time series forecasting in thermal power generation systems. The framework operates through a vertical pipeline initiated by natural language queries from users, which are processed by the LLM Agent Core powered by Llama.cpp and a ReAct loop with persistent ...
William Gouvêa Buratto +5 more
wiley +1 more source
This article outlines how artificial intelligence could reshape the design of next‐generation transistors as traditional scaling reaches its limits. It discusses emerging roles of machine learning across materials selection, device modeling, and fabrication processes, and highlights hierarchical reinforcement learning as a promising framework for ...
Shoubhanik Nath +4 more
wiley +1 more source

