An efficient double complementation algorithm for superposition-based finite-state morphology

Show simple item record

dc.contributor.author Yli-Jyrä, Anssi Mikael
dc.date.accessioned 2010-12-17T22:11:13Z
dc.date.available 2010-12-17T22:11:13Z
dc.date.issued 2009
dc.identifier.citation Yli-Jyrä , A M 2009 , ' An efficient double complementation algorithm for superposition-based finite-state morphology ' , NEALT Proceedings Series , vol. 4 , pp. 206-213 . < http://hdl.handle.net/10062/9765 >
dc.identifier.other PURE: 10173626
dc.identifier.other PURE UUID: 04d03414-69e9-4333-a17e-276f1b221cf4
dc.identifier.other ORCID: /0000-0003-0731-2114/work/29531057
dc.identifier.uri http://hdl.handle.net/10138/24223
dc.description Volume: 4 Host publication title: Proceedings of the 17th Nordic Conference of Computational Linguistics NODALIDA 2009
dc.format.extent 8
dc.language.iso eng
dc.relation.ispartof NEALT Proceedings Series
dc.rights.uri info:eu-repo/semantics/openAccess
dc.title An efficient double complementation algorithm for superposition-based finite-state morphology en
dc.title.alternative Tehokas kaksoikomplementointialgoritmi päällekkäinasetteluun perustuvaa äärellistilaista morfologiaa varten fi
dc.type Conference article
dc.contributor.organization Department of Modern Languages 2010-2017
dc.description.reviewstatus Peer reviewed
dc.relation.issn 1736-8197
dc.rights.accesslevel openAccess
dc.type.version publishedVersion
dc.relation.funder Unknown funder
dc.relation.grantnumber

Files in this item

Total number of downloads: Loading...

Files Size Format View
paper32.pdf 164.8Kb PDF View/Open

This item appears in the following Collection(s)

Show simple item record