Tootfinder

With the advent of ELIZA, Joseph Weizenbaum's first psychotherapist chatbot, NLP took another major step with pattern-based substitution algorithms based on simple regular expressions.
Weizenbaum, Joseph (1966). ELIZA—a computer program for the study of natural language communication between man and machine. Com. of the ACM. 9: 36–45.

This https://arxiv.org/abs/2506.03903 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csSE_…

Multi-Language Detection of Design Pattern Instances
Code comprehension is often supported by source code analysis tools which provide more abstract views over software systems, such as those detecting design patterns. These tools encompass analysis of source code and ensuing extraction of relevant information. However, the analysis of the source code is often specific to the target programming language. We propose DP-LARA, a multi-language pattern detection tool that uses the multi-language capability of the LARA framework to support finding p…

Multi-Language Detection of Design Pattern Instances
Hugo Andrade, Jo\~ao Bispo, Filipe F. Correia
https://arxiv.org/abs/2506.03903 https://

Multi-Language Detection of Design Pattern Instances
Code comprehension is often supported by source code analysis tools which provide more abstract views over software systems, such as those detecting design patterns. These tools encompass analysis of source code and ensuing extraction of relevant information. However, the analysis of the source code is often specific to the target programming language. We propose DP-LARA, a multi-language pattern detection tool that uses the multi-language capability of the LARA framework to support finding p…

Benford's Curse: Tracing Digit Bias to Numerical Hallucination in LLMs
Jiandong Shao, Yao Lu, Jianfei Yang
https://arxiv.org/abs/2506.01734 https://

Benford's Curse: Tracing Digit Bias to Numerical Hallucination in LLMs
Large Language Models (LLMs) exhibit impressive performance on complex reasoning tasks, yet they frequently fail on basic numerical problems, producing incorrect outputs. Inspired by Benford's Law -- a statistical pattern where lower digits occur more frequently as leading digits -- we hypothesize that the long-tailed digit distributions in web-collected corpora may be learned by LLMs during pretraining, leading to biased numerical generation. To investigate the hypothesis, we first examine whe…

This https://arxiv.org/abs/2505.19988 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csDB_…

Automatic Metadata Extraction for Text-to-SQL
Large Language Models (LLMs) have recently become sophisticated enough to automate many tasks ranging from pattern finding to writing assistance to code generation. In this paper, we examine text-to-SQL generation. We have observed from decades of experience that the most difficult part of query development lies in understanding the database contents. These experiences inform the direction of our research. Text-to-SQL benchmarks such as SPIDER and Bird contain extensive metadata that is gener…

We have been public about not using Go as the bootstrap language. We started with a compiler in C for a number of reasons, mostly for ease of bootstrapping but also to avoid making a compiler-optimized language instead of a general purpose one. Once the language was designed, we ported the code to Go for ease of maintenance and development.
Well here is a variant of that pattern: the TypeScript compiler is also being ported to Go: https://www.youtube.com/watch?v=pNlq-EVld70
The video is worth watching for the reasons why. Turns out a general purpose language is indeed a good compiler language.

This https://arxiv.org/abs/2405.07671 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csFL_…

Constructing a BPE Tokenization DFA
Many natural language processing systems operate over tokenizations of text to address the open-vocabulary problem. In this paper, we give and analyze an algorithm for the efficient construction of deterministic finite automata (DFA) designed to operate directly on tokenizations produced by the popular byte pair encoding (BPE) technique. This makes it possible to apply many existing techniques and algorithms to the tokenized case, such as pattern matching, equivalence checking of tokenization d…