Show simple item record

Files in this item

Thumbnail

Item metadata

dc.contributor.authorNederhof, Mark Jan
dc.date.accessioned2011-01-06T11:44:01Z
dc.date.available2011-01-06T11:44:01Z
dc.date.issued2010-10
dc.identifier.citationNederhof , M J 2010 , Transforming lexica as trees . in Workshop on Applications of Tree Automata in Natural Language Processing : Proceedings of a meeting held 16 July 2010, Uppsala, Sweden. Held at ACL 2010 . Curran Associates, Inc. , Sweden , pp. 37-45 .en
dc.identifier.isbn9781617388095
dc.identifier.otherPURE: 5095277
dc.identifier.otherPURE UUID: 8d60f405-ece0-4fe8-ad20-2764ef1b1209
dc.identifier.otherORCID: /0000-0002-1845-6829/work/46002708
dc.identifier.otherScopus: 85120045727
dc.identifier.urihttps://hdl.handle.net/10023/1655
dc.description.abstractWe investigate the problem of structurally changing lexica, while preserving the information. We present a type of lexicon transformation that is complete on an interesting class of lexica. Our work is motivated by the problem of merging one or more lexica into one lexicon. Lexica, lexicon schemas, and lexicon transformations are all seen as particular kinds of trees.
dc.format.extent9
dc.language.isoeng
dc.publisherCurran Associates, Inc.
dc.relation.ispartofWorkshop on Applications of Tree Automata in Natural Language Processingen
dc.rightsThis is the author version of the conference contribution. A definitive version is available from http://www.aclweb.org/anthology/W/W10/#2500 licensed under a Creative Commons licence for use in teaching and research (http://creativecommons.org/licenses/by-nc-sa/3.0/)en
dc.subjectQA75 Electronic computers. Computer scienceen
dc.subject.lccQA75en
dc.titleTransforming lexica as treesen
dc.typeConference itemen
dc.description.versionPostprinten
dc.contributor.institutionUniversity of St Andrews. School of Computer Scienceen


This item appears in the following Collection(s)

Show simple item record