TL;DR
This paper investigates the use of large language models for log parsing, demonstrating that LLMs can outperform traditional parsers in accuracy, with smaller models sometimes being more effective and pre-training effects being inconsistent.
Contribution
The study introduces LLMParser, an LLM-based log parser, and provides empirical analysis on model size, training data, and pre-training effects, highlighting limitations and future directions.
Findings
LLMParser achieves 96% parsing accuracy, outperforming state-of-the-art parsers.
Smaller LLMs like Flan-T5-base can match larger models with faster inference.
Pre-training on logs does not always improve parsing accuracy, sometimes decreasing it.
Abstract
Logs are important in modern software development with runtime information. Log parsing is the first step in many log-based analyses, that involve extracting structured information from unstructured log data. Traditional log parsers face challenges in accurately parsing logs due to the diversity of log formats, which directly impacts the performance of downstream log-analysis tasks. In this paper, we explore the potential of using Large Language Models (LLMs) for log parsing and propose LLMParser, an LLM-based log parser based on generative LLMs and few-shot tuning. We leverage four LLMs, Flan-T5-small, Flan-T5-base, LLaMA-7B, and ChatGLM-6B in LLMParsers. Our evaluation of 16 open-source systems shows that LLMParser achieves statistically significantly higher parsing accuracy than state-of-the-art parsers (a 96% average parsing accuracy). We further conduct a comprehensive empirical…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsLLaMA
