Skip to main content
DORAS
DCU Online Research Access Service
Login (DCU Staff Only)
LFG without C-structures

Cetinoglu, Ozlem, Foster, Jennifer ORCID: 0000-0002-7789-4853, Nivre, Joakim, Hogan, Deirdre, Cahill, Aoife ORCID: 0000-0002-3519-7726 and van Genabith, Josef ORCID: 0000-0003-1322-7944 (2010) LFG without C-structures. In: the 9th International Workshop on Treebanks and Linguistic Theories, 3 - 4 Dec. 2010, Tartu Estonia..

Full text available as:

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

Abstract

We explore the use of two dependency parsers, Malt and MST, in a Lexical Functional Grammar parsing pipeline. We compare this to the traditional LFG parsing pipeline which uses constituency parsers. We train the dependency parsers not on classical LFG f-structures but rather on modified dependency-tree versions of these in which all words in the input sentence are represented and multiple heads are removed. For the purposes of comparison, we also modify the existing CFG-based LFG parsing pipeline so that these "LFG-inspired" dependency trees are produced. We find that the differences in parsing accuracy over the various parsing architectures is small.

Item Type:Conference or Workshop Item (Paper)
Event Type:Conference
Refereed:Yes
Uncontrolled Keywords:LFG structures; Lexical Functional Grammar
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
Use License:This item is licensed under a Creative Commons Attribution-NonCommercial-Share Alike 3.0 License. View License
ID Code:15982
Deposited On:07 Jun 2011 13:22 by Shane Harper . Last Modified 20 Jan 2022 16:03

Downloads

Downloads per month over past year

Archive Staff Only: edit this record

Altmetric
- Altmetric
+ Altmetric
  • Student Email
  • Staff Email
  • Student Apps
  • Staff Apps
  • Loop
  • Disclaimer
  • Privacy
  • Contact Us