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

Anssi Yli-Jyrä. An Efficient Double Complementation Algorithm for Superposition-Based Finite-State Morphology. In Kristiina Jokinen, Eckhard Bick, editors, Proceedings of the 17th Nordic Conference of Computational Linguistics, NODALIDA 2009, Odense, Denmark, May 14-16, 2009. pages 206-213, Northern European Association for Language Technology (NEALT), 2009. [doi]

@inproceedings{Yli-Jyra09,
  title = {An Efficient Double Complementation Algorithm for Superposition-Based Finite-State Morphology},
  author = {Anssi Yli-Jyrä},
  year = {2009},
  url = {https://aclanthology.info/papers/W09-4629/w09-4629},
  researchr = {https://researchr.org/publication/Yli-Jyra09},
  cites = {0},
  citedby = {0},
  pages = {206-213},
  booktitle = {Proceedings of the 17th Nordic Conference of Computational Linguistics, NODALIDA 2009, Odense, Denmark, May 14-16, 2009},
  editor = {Kristiina Jokinen and Eckhard Bick},
  publisher = {Northern European Association for Language Technology (NEALT)},
}