2015/11/08 by Glyn Morrill, Oriol Valentín
Computer Science · Mathematics · #Algorithm #Combinatory categorial grammar #Computer science #Context-free grammar #Formal Methods in Verification #Grammar #Linguistics #Logic, programming, and type systems #Mathematics #Multiplicative function #Natural language processing #Parsing #Programming language #Spurious relationship #Tree-adjoining grammar #cs.LO #semigroups and automata theory
paper · pdf · doi:10.4204/eptcs.197.4
published as EPTCS 197, 2015, pp. 29-54 · In Proceedings WoF'15, arXiv:1511.02529
openalex publication_date 2015/11/08 · arxiv created 2015/11/13 · arxiv updated 2015/11/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
Spurious ambiguity is the phenomenon whereby distinct derivations in grammar may assign the same structural reading, resulting in redundancy in the parse search space and inefficiency in parsing. Understanding the problem depends on identifying the essential mathematical structure of derivations. This is trivial in the case of context free grammar, where the parse structures are ordered trees; in the case of categorial grammar, the parse structures are proof nets. However, with respect to multiplicatives intrinsic proof nets have not yet been given for displacement calculus, and proof nets for additives, which have applications to polymorphism, are involved. Here we approach multiplicative-additive spurious ambiguity by means of the proof-theoretic technique of focalisation.