Browse DORAS
Browse Theses
Latest Additions
Creative Commons License
Except where otherwise noted, content on this site is licensed for use under a:

Quasi-logical forms from f-structures for the Penn treebank

Cahill, Aoife and McCarthy, Mairéad and van Genabith, Josef and Way, Andy (2003) Quasi-logical forms from f-structures for the Penn treebank. In: IWCS 2003 - Fifth International Workshop on Computational Semantics, 15-17 January 2003, Tilburg, The Netherlands.

Full text available as:

[img]PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader


In this paper we show how the trees in the Penn treebank can be associated automatically with simple quasi-logical forms. Our approach is based on combining two independent strands of work: the first is the observation that there is a close correspondence between quasi-logical forms and LFG f-structures [van Genabith and Crouch, 1996]; the second is the development of an automatic f-structure annotation algorithm for the Penn treebank [Cahill et al, 2002a; Cahill et al, 2002b]. We compare our approach with that of [Liakata and Pulman, 2002].

Item Type:Conference or Workshop Item (Paper)
Event Type:Workshop
Subjects:Computer Science > Machine translating
DCU Faculties and Centres:Research Initiatives and Centres > National Centre for Language Technology (NCLT)
DCU Faculties and Schools > Faculty of Engineering and Computing > School of Computing
Official URL:
Use License:This item is licensed under a Creative Commons Attribution-NonCommercial-Share Alike 3.0 License. View License
ID Code:15311
Deposited On:15 Mar 2010 16:11 by DORAS Administrator. Last Modified 27 Oct 2016 16:49

Download statistics

Archive Staff Only: edit this record