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

Simple item page
dc.contributor.authorYli-Jyrä, Anssi
dc.date.accessioned2009-05-13T12:11:00Z
dc.date.available2009-05-13T12:11:00Z
dc.date.issued2009-05-13T12:11:00Z
dc.descriptionProceedings of the 17th Nordic Conference of Computational Linguistics NODALIDA 2009. Editors: Kristiina Jokinen and Eckhard Bick. NEALT Proceedings Series, Vol. 4 (2009), 206-213. © 2009 The editors and contributors. Published by Northern European Association for Language Technology (NEALT) http://omilia.uio.no/nealt . Electronically published at Tartu University Library (Estonia) http://hdl.handle.net/10062/9206 .et
dc.identifier.issn1736-6305
dc.identifier.urihttp://hdl.handle.net/10062/9765
dc.language.isoenet
dc.titleAn Efficient Double Complementation Algorithm for Superposition-Based Finite-State Morphologyet
dc.typeArticleet

Files

Original bundle

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

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.79 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

NEALT Proceedings Series Vol. 4