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

Simple item page
dc.contributor.authorYli-Jyrä, Anssi
dc.contributor.editorJokinen, Kristiina
dc.contributor.editorBick, Eckhard
dc.date.accessioned2023-09-22T12:49:06Z
dc.date.available2023-09-22T12:49:06Z
dc.date.issued2009
dc.identifier.issnISSN 1736-6305 (Online)
dc.identifier.urihttps://hdl.handle.net/10062/92756
dc.language.isoeng
dc.publisherOdense, Denmark, Northern European Association for Language Technology (NEALT), pp. 206--213
dc.relation.ispartofProceedings of the 17th Nordic Conference of Computational Linguistics (NODALIDA 2009)
dc.rightsopenAccessen
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 Estonia*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/ee/*
dc.titleAn Efficient Double Complementation Algorithm for Superposition-Based Finite-State Morphologyen
dc.typeArticleen

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
W09_4629.pdf
Size:
165.56 KB
Format:
Adobe Portable Document Format
Download

Collections

Proceedings of the 17th Nordic Conference of Computational Linguistics (NODALIDA 2009)