Finite-State Registered Automata for Non-Concatenative Morphology | Citedby Results | Computational Linguistics | MIT Press

Skip to Main Content

Skip Nav Destination

Finite-State Registered Automata for Non-Concatenative Morphology

Computational Linguistics (2006) 32 (1): 49–82.

This article has been cited by the following articles in journals that are participating in Crossref Cited-by Linking.

Regular and polyregular theories of reduplication

Jonathan Rawski
Hossep Dolatian
Jeffrey Heinz
Eric Raimy

Glossa: a journal of general linguistics (2023) 8 (1)

Reduplication in Assamese: Identification and Modeling

Dhrubajyoti Pathak
Sukumar Nandi
Priyankoo Sarmah

ACM Transactions on Asian and Low-Resource Language Information Processing (2022) 21 (5): 1.

Ressources morphologiques

Fabrice Issac

Éla. Études de linguistique appliquée (2016) N° 180 (4): 449.

Multilingual part-of-speech tagging with weightless neural networks

Hugo C.C. Carneiro
Felipe M.G. França
Priscila M.V. Lima

Neural Networks (2015) 66: 11.

Strengths and weaknesses of finite-state technology: a case study in morphological grammar development

SHULY WINTNER

Natural Language Engineering (2008) 14 (4): 457.

Kenneth R. Beesley & Lauri Karttunen, Finite State Morphology. Stanford, CA: CSLI Publications (distributed by the University of Chicago Press), 2003. xviii + 505pp. and CD-ROM. ISBN hardbound 1-57586-433-9, paperbound 1-57586-434-7.

Erwin Chan
Charles Yang

Word Structure (2008) 1 (2): 246.