Transforming lexica as trees

dc.contributor.author	Nederhof, Mark Jan
dc.date.accessioned	2011-01-06T11:44:01Z
dc.date.available	2011-01-06T11:44:01Z
dc.date.issued	2010-10
dc.identifier	5095277
dc.identifier	8d60f405-ece0-4fe8-ad20-2764ef1b1209
dc.identifier	85120045727
dc.identifier.citation	Nederhof , 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.isbn	9781617388095
dc.identifier.other	ORCID: /0000-0002-1845-6829/work/46002708
dc.identifier.uri	https://hdl.handle.net/10023/1655
dc.description.abstract	We 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.extent	9
dc.format.extent	88545
dc.language.iso	eng
dc.publisher	Curran Associates, Inc.
dc.relation.ispartof	Workshop on Applications of Tree Automata in Natural Language Processing	en
dc.subject	QA75 Electronic computers. Computer science	en
dc.subject.lcc	QA75	en
dc.title	Transforming lexica as trees	en
dc.type	Conference item	en
dc.contributor.institution	University of St Andrews. School of Computer Science	en