The University of St Andrews

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:
This item has been viewed 5 times in the last year. View Statistics

Files in This Item:

File Description SizeFormat
J11_4009.pdf132.96 kBAdobe PDFView/Open
Title: Splittability of bilexical context-free grammars is undecidable
Authors: Nederhof, Mark Jan
Satta, Giorgio
Keywords: Parsing algorithms
Natural language processing
QA75 Electronic computers. Computer science
Issue Date: Dec-2011
Citation: Nederhof , M J & Satta , G 2011 , ' Splittability of bilexical context-free grammars is undecidable ' Computational Linguistics , vol 37 , no. 4 , pp. 867-879 . , 10.1162/COLI_a_00079
Abstract: Bilexical context-free grammars (2-LCFGs) have proved to be accurate models for statistical natural language parsing. Existing dynamic programming algorithms used to parse sentences under these models have running time of O(|w|^4), where w is the input string. A 2-LCFG is splittable if the left arguments of a lexical head are always independent of the right arguments, and vice versa. When a 2-LCFGs is splittable, parsing time can be asymptotically improved to O(|w|^3). Testing this propertyis therefore of central interest to parsing efficiency. In this article, however, we show the negative result that splittability of 2-LCFGs is undecidable.
Version: Publisher PDF
Status: Peer reviewed
ISSN: 0891-2017
Type: Journal article
Rights: (c) 2011 Association for Computational Linguistics
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.


DSpace Software Copyright © 2002-2012  Duraspace - Feedback
For help contact: | Copyright for this page belongs to St Andrews University Library | Terms and Conditions (Cookies)