|
Research@StAndrews:FullText >
University of St Andrews Research >
University of St Andrews Research >
University of St Andrews Research >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/10023/1655
| Title: | Transforming lexica as trees |
| Authors: | Nederhof, Mark Jan |
| Keywords: | QA75 Electronic computers. Computer science |
| Issue Date: | Oct-2010 |
| 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 . |
| 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. |
| Version: | Postprint |
| URI: | http://hdl.handle.net/10023/1655 |
| ISBN: | 9781617388095 |
| Type: | Conference item |
| Rights: | This 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/) |
| Publisher: | Curran Associates, Inc. |
| Appears in Collections: | University of St Andrews Research
Computer Science Research
|
This item is protected by original copyright
|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
|
