2000/06/30 by Kenneth R. Beesley, Beesley, Kenneth R., Lauri Karttunen +1 · 12 citations
Computer Science · Psychology · #A0 #Algorithm #Arabic #Compiler #Computation and Language (cs.CL) #Computer science #Expression (computer science) #F1.1 #FOS: Computer and information sciences #Finite state #Implementation #J5 #Linguistics #Machine learning #Natural Language Processing Techniques #Phonetics and Phonology Research #Programming language #Reduplication #Scale (ratio) #Speech and dialogue systems #State (computer science) #cs.CL
paper · pdf · doi:10.48550/arxiv.cs/0006044
published in arXiv (Cornell University) (Cornell University) · SIGPHON-2000, Proceedings of the Fifth Workshop of the ACL Special Interest Group in Computational Phonology, p. 1-12. Aug. 6, 2000. Luxembourg
arxiv created 2000/06/30 · openalex publication_date 2000/06/30 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/08
Finite-state morphology in the general tradition of the Two-Level and Xerox implementations has proved very successful in the production of robust morphological analyzer-generators, including many large-scale commercial systems. However, it has long been recognized that these implementations have serious limitations in handling non-concatenative phenomena. We describe a new technique for constructing finite-state transducers that involves reapplying the regular-expression compiler to its own output. Implemented in an algorithm called compile-replace, this technique has proved useful for handling non-concatenative phenomena; and we demonstrate it on Malay full-stem reduplication and Arabic stem interdigitation.