Programming by Examples Meets Historical Linguistics: A Large Language Model Based Approach to Sound Law Induction
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915125762457600 |
|---|---|
| author | Naik, Atharva Agrawal, Darsh Sng, Hong Marr, Clayton Zhang, Kexun Robinson, Nathaniel R Chang, Kalvin Byrnes, Rebecca Mysore, Aravind Rose, Carolyn Mortensen, David R |
| author_facet | Naik, Atharva Agrawal, Darsh Sng, Hong Marr, Clayton Zhang, Kexun Robinson, Nathaniel R Chang, Kalvin Byrnes, Rebecca Mysore, Aravind Rose, Carolyn Mortensen, David R |
| contents | Historical linguists have long written "programs" that convert reconstructed words in an ancestor language into their attested descendants via ordered string rewrite functions (called sound laws) However, writing these programs is time-consuming, motivating the development of automated Sound Law Induction (SLI) which we formulate as Programming by Examples (PBE) with Large Language Models (LLMs) in this paper. While LLMs have been effective for code generation, recent work has shown that PBE is challenging but improvable by fine-tuning, especially with training data drawn from the same distribution as evaluation data. In this paper, we create a conceptual framework of what constitutes a "similar distribution" for SLI and propose four kinds of synthetic data generation methods with varying amounts of inductive bias to investigate what leads to the best performance. Based on the results we create a SOTA open-source model for SLI as PBE (+6% pass rate with a third of the parameters of the second-best LLM) and also highlight exciting future directions for PBE research. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_16524 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Programming by Examples Meets Historical Linguistics: A Large Language Model Based Approach to Sound Law Induction Naik, Atharva Agrawal, Darsh Sng, Hong Marr, Clayton Zhang, Kexun Robinson, Nathaniel R Chang, Kalvin Byrnes, Rebecca Mysore, Aravind Rose, Carolyn Mortensen, David R Computation and Language Historical linguists have long written "programs" that convert reconstructed words in an ancestor language into their attested descendants via ordered string rewrite functions (called sound laws) However, writing these programs is time-consuming, motivating the development of automated Sound Law Induction (SLI) which we formulate as Programming by Examples (PBE) with Large Language Models (LLMs) in this paper. While LLMs have been effective for code generation, recent work has shown that PBE is challenging but improvable by fine-tuning, especially with training data drawn from the same distribution as evaluation data. In this paper, we create a conceptual framework of what constitutes a "similar distribution" for SLI and propose four kinds of synthetic data generation methods with varying amounts of inductive bias to investigate what leads to the best performance. Based on the results we create a SOTA open-source model for SLI as PBE (+6% pass rate with a third of the parameters of the second-best LLM) and also highlight exciting future directions for PBE research. |
| title | Programming by Examples Meets Historical Linguistics: A Large Language Model Based Approach to Sound Law Induction |
| topic | Computation and Language |
| url | https://arxiv.org/abs/2501.16524 |