Splittability of bilexical context-free grammars is undecidable
MetadataShow full item record
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.
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
(c) 2011 Association for Computational Linguistics
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.