Files in this item
Splittability of bilexical context-free grammars is undecidable
Item metadata
dc.contributor.author | Nederhof, Mark Jan | |
dc.contributor.author | Satta, Giorgio | |
dc.date.accessioned | 2012-03-15T12:31:03Z | |
dc.date.available | 2012-03-15T12:31:03Z | |
dc.date.issued | 2011-12 | |
dc.identifier.citation | Nederhof , M J & Satta , G 2011 , ' Splittability of bilexical context-free grammars is undecidable ' , Computational Linguistics , vol. 37 , no. 4 , pp. 867-879 . https://doi.org/10.1162/COLI_a_00079 | en |
dc.identifier.issn | 0891-2017 | |
dc.identifier.other | PURE: 17631495 | |
dc.identifier.other | PURE UUID: 702e2da0-ec5a-4286-b1ea-0bebdfe172b5 | |
dc.identifier.other | Scopus: 82255170447 | |
dc.identifier.other | WOS: 000298118200009 | |
dc.identifier.other | ORCID: /0000-0002-1845-6829/work/46002704 | |
dc.identifier.uri | https://hdl.handle.net/10023/2415 | |
dc.description.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. | |
dc.format.extent | 13 | |
dc.language.iso | eng | |
dc.relation.ispartof | Computational Linguistics | en |
dc.rights | (c) 2011 Association for Computational Linguistics | en |
dc.subject | Parsing algorithms | en |
dc.subject | Natural language processing | en |
dc.subject | QA75 Electronic computers. Computer science | en |
dc.subject.lcc | QA75 | en |
dc.title | Splittability of bilexical context-free grammars is undecidable | en |
dc.type | Journal article | en |
dc.description.version | Publisher PDF | en |
dc.contributor.institution | University of St Andrews. School of Computer Science | en |
dc.identifier.doi | https://doi.org/10.1162/COLI_a_00079 | |
dc.description.status | Peer reviewed | en |
dc.identifier.url | http://aclweb.org/anthology-new/J/J11/J11-4009.pdf | en |
dc.identifier.url | http://www.mitpressjournals.org/toc/coli/37/4 | en |
This item appears in the following Collection(s)
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.