Can Large Language Models Code Like a Linguist?: A Case Study in Low Resource Sound Law Induction
<|reference_start|>Can Large Language Models Code Like a Linguist?: A Case Study in Low Resource Sound Law Induction: Historical linguists have long written a kind of incompletely formalized ''program'' that converts reconstructed words in an ancestor language into words in one of its attested descendants that consist of a series of ordered string rewrite functions (called sound laws). They do this by observing pairs of words in the reconstructed language (protoforms) and the descendent language (reflexes) and constructing a program that transforms protoforms into reflexes. However, writing these programs is error-prone and time-consuming. Prior work has successfully scaffolded this process computationally, but fewer researchers have tackled Sound Law Induction (SLI), which we approach in this paper by casting it as Programming by Examples. We propose a language-agnostic solution that utilizes the programming ability of Large Language Models (LLMs) by generating Python sound law programs from sound change examples. We evaluate the effectiveness of our approach for various LLMs, propose effective methods to generate additional language-agnostic synthetic data to fine-tune LLMs for SLI, and compare our method with existing automated SLI methods showing that while LLMs lag behind them they can complement some of their weaknesses.<|reference_end|>
@article{naik2024can,
    title={Can Large Language Models Code Like a Linguist?: A Case Study in Low
  Resource Sound Law Induction},
    author={Atharva Naik, Kexun Zhang, Nathaniel Robinson, Aravind Mysore, Clayton
  Marr, Hong Sng Rebecca Byrnes, Anna Cai, Kalvin Chang, David Mortensen},
    journal={arXiv preprint arXiv:2406.12725},
    year={2024},
    archivePrefix={arXiv},
    eprint={2406.12725},
    primaryClass={cs.CL cs.AI}
}