An Efficient Double Complementation Algorithm for Superposition-Based Finite-State Morphology

Anssi Yli-Jyrä


Anthology ID:
W09-4629
Volume:
Proceedings of the 17th Nordic Conference of Computational Linguistics (NODALIDA 2009)
Month:
May
Year:
2009
Address:
Odense, Denmark
Venue:
NoDaLiDa
SIG:
Publisher:
Northern European Association for Language Technology (NEALT)
Note:
Pages:
206–213
Language:
URL:
https://aclanthology.org/W09-4629
DOI:
Bibkey:
Cite (ACL):
Anssi Yli-Jyrä. 2009. An Efficient Double Complementation Algorithm for Superposition-Based Finite-State Morphology. In Proceedings of the 17th Nordic Conference of Computational Linguistics (NODALIDA 2009), pages 206–213, Odense, Denmark. Northern European Association for Language Technology (NEALT).
Cite (Informal):
An Efficient Double Complementation Algorithm for Superposition-Based Finite-State Morphology (Yli-Jyrä, NoDaLiDa 2009)
Copy Citation:
PDF:
https://preview.aclanthology.org/nodalida-main-page/W09-4629.pdf