Show simple item record

Files in this item


Item metadata

dc.contributor.authorNederhof, Mark Jan
dc.identifier.citationNederhof , 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.otherPURE: 243243685
dc.identifier.otherPURE UUID: fe9b625c-d10e-45a7-8ee6-a25dd3fa04c8
dc.identifier.otherORCID: /0000-0002-1845-6829/work/46002722
dc.description.abstractWe 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.publisherAssociation for Computational Linguistics
dc.relation.ispartof54th Annual meeting of the Association for Computational Linguisticsen
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
dc.subjectComputational linguisticsen
dc.subjectFormal language theoryen
dc.subjectQA75 Electronic computers. Computer scienceen
dc.subjectP Language and Literatureen
dc.subjectComputational Theory and Mathematicsen
dc.subjectLinguistics and Languageen
dc.titleA short proof that O2 is an MCFLen
dc.typeConference itemen
dc.contributor.institutionUniversity of St Andrews.School of Computer Scienceen

This item appears in the following Collection(s)

Show simple item record