@inproceedings{azadegan-2026-compiling,
    title = "Compiling Search {\&} Change Rules into Subsequential Finite-State Transducers",
    author = "Azadegan, Malek",
    editor = "Voigt, Rob  and
      Warstadt, Alex  and
      Feldman, Naomi  and
      Linzen, Tal",
    booktitle = "Proceedings of the Society for Computation in Linguistics 2026",
    month = jul,
    year = "2026",
    address = "San Diego, CA",
    publisher = "Association for Computational Linguistics",
    url = "https://preview.aclanthology.org/ingest-acl-workshops/2026.scil-main.17/",
    pages = "171--179",
    ISBN = "979-8-89176-412-5",
    abstract = "Search {\&} Change (S{\&}C) is a procedural model of phonological rule application that is conceptually clear and linguistically motivated, but whose computational properties have not been fully characterized. This paper provides a formal specification of S{\&}C within the framework of Logical Phonology, presents a linear-time algorithm for rule application with a proof of correctness, and gives a compilation procedure mapping S{\&}C rules to a single transition structure that is subsequential in one scan orientation and reverse-subsequential in the other, situating S{\&}C within a well-understood subclass of regular string-to-string functions with known learnability guarantees and algebraic characterizations, implying that S{\&}C-definable mappings are learnable from positive input/output pairs and amenable to algebraic classification."
}