Aug 2026· ACM Transactions on Software Engineering and Methodology· 0 citations· 52 references
TL;DR
This work proposes SLOPE, a fine-grained log parser combining syntax with semantics, which achieves an average parsing accuracy improvement of 61.2% and 5.9 times higher throughput over all baselines, exhibiting state-of-the-art robustness.
Abstract
Log parsing, which transforms unstructured log messages into structured formats, is a critical step in automated log analysis and directly impacts the effectiveness of downstream tasks. However, existing log parsers struggle to balance effectiveness with efficiency and show limited capability in handling log inconsistency, a common phenomenon in real-world systems where log messages follow different templates but contain semantically equivalent parameters. To address these challenges, we propose SLOPE, a fine-grained log parser combining syntax with semantics. Unlike coarse-grained template-level parsing and caching, SLOPE distills parameter-level semantics into reusable rules. Specifically, it first utilizes Large Language Models (LLMs) to extract parameters and their semantic and syntactic features from sampled logs, and stores these features in a Finite State Machine (FSM). During online parsing, SLOPE reuses these semantic-syntax rules for efficient and fine-grained parsing without relying on LLMs. We conduct comprehensive evaluations on 14 public datasets and a large-scale industrial dataset from Huawei's real-world business services on HarmonyOS. Results demonstrate that SLOPE achieves an average parsing accuracy improvement of 61.2% and 5.9 times higher throughput over all baselines. Furthermore, SLOPE maintains a high parsing accuracy with an average drop of only 1.4% under diverse log inconsistencies, exhibiting state-of-the-art robustness.
The semantic parser is treated as an existing component, and the contribution is evidence about when that component changes downstream detection behaviour enough to justify pilot testing, which supports cautious, workload-aware use of semantic parsing in observability pipelines.
Dumo Ngwenya, Patrick Wong, Dhouha Kbaier· Proceedings of the 19th ACM...· 0 citations
HGX is introduced, which natively embeds domain dependencies into an expressive parent-child hierarchy, and achieves up to a 92% reduction in ASP solver invocations compared to flat evaluation strategies, while strictly preserving extraction accuracy.
FlanBC is presented, a log parsing framework that formulates template extraction as a BIO (Beginning, Inside, Outside) sequence-labeling task and integrates a Flan-T5 semantic encoder, Bidirectional Long Short-Term Memory (BiLSTM) layers for local sequential modeling, and a Conditional Random Field (CRF) decoder for st...
Jinhui Yuan, Bin Guan, Kun Wen et al.· Information· 0 citations
PASK (Parser-Aware Structural KV Persistence), which turns parser-derived structure into layer-group-specific KV persistence decisions by using task-error sensitivity to set minimum protection floors and attention-output distortion to allocate residual KV capacity.
This paper measures and analytically derive an optimal size for in-prompt document batching to effectively amortize this overhead of LLM calls over public APIs, cutting end-to-end semantic operator latency by up to 14 × with no meaningful accuracy loss.
A scalable framework that leverages LLMs as data translators to bridge the gap between unstructured textual resources and structured event data is proposed, and finetuning LLMs on a newly created text-to-log dataset shows that the resulting models can extract high-fidelity event logs from unstructured resources.
Maximilian Seeth, G. Tavares, Daniel Schuster· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.