Files in this item
A short proof that O2 is an MCFL
Item metadata
dc.contributor.author | Nederhof, Mark Jan | |
dc.date.accessioned | 2016-08-06T23:31:35Z | |
dc.date.available | 2016-08-06T23:31:35Z | |
dc.date.issued | 2016-08-07 | |
dc.identifier.citation | Nederhof , M J 2016 , A short proof that O 2 is an MCFL . in 54th Annual meeting of the Association for Computational Linguistics : Proceedings of the Conference . Association for Computational Linguistics , Berlin , 54th Annual meeting of the Association for Computational Linguistics , Berlin , Germany , 7/08/16 . | en |
dc.identifier.citation | conference | en |
dc.identifier.other | PURE: 243243685 | |
dc.identifier.other | PURE UUID: fe9b625c-d10e-45a7-8ee6-a25dd3fa04c8 | |
dc.identifier.other | ORCID: /0000-0002-1845-6829/work/46002722 | |
dc.identifier.other | Scopus: 85011930977 | |
dc.identifier.uri | https://hdl.handle.net/10023/9268 | |
dc.description.abstract | We present a new proof that O2 is a multiple context-free language. It contrasts with a recent proof by Salvati (2015) in its avoidance of concepts that seem specific to two-dimensional geometry, such as the complex exponential function. Our simple proof creates realistic prospects of widening the results to higher dimensions. This finding is of central importance to the relation between extreme free word order and classes of grammars used to describe the syntax of natural language. | |
dc.format.extent | 10 | |
dc.language.iso | eng | |
dc.publisher | Association for Computational Linguistics | |
dc.relation.ispartof | 54th Annual meeting of the Association for Computational Linguistics | en |
dc.rights | © 2016, the Author(s). This work is made available online in accordance with the publisher’s policies. This is the author created, accepted version manuscript following peer review and may differ slightly from the final published version. The final published version of this work is available at http://aclweb.org/anthology/ | en |
dc.subject | Computational linguistics | en |
dc.subject | Formal language theory | en |
dc.subject | QA75 Electronic computers. Computer science | en |
dc.subject | P Language and Literature | en |
dc.subject | Computational Theory and Mathematics | en |
dc.subject | Linguistics and Language | en |
dc.subject | NDAS | en |
dc.subject.lcc | QA75 | en |
dc.subject.lcc | P | en |
dc.title | A short proof that O2 is an MCFL | en |
dc.type | Conference item | en |
dc.description.version | Postprint | en |
dc.contributor.institution | University of St Andrews. School of Computer Science | en |
dc.date.embargoedUntil | 2016-08-07 |
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.