Universitat Politècnica de Catalunya. Departament de Ciències de la Computació
Universitat Politècnica de Catalunya. LARCA - Laboratori d'Algorísmia Relacional, Complexitat i Aprenentatge
2018-06
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 type logical 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 not easy to characterize. In this context we approach here multiplicative-additive spurious ambiguity by means of the proof-theoretic technique of focalization.
Peer Reviewed
Postprint (published version)
Article
English
Àrees temàtiques de la UPC::Informàtica::Intel·ligència artificial::Llenguatge natural; Computational linguistics; Categorial grammar; Lingüística computacional; Gramàtica categorial
https://www.mitpressjournals.org/doi/abs/10.1162/coli_a_00316
info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2013-2016/TIN2017-89244-R/ES/GESTION Y ANALISIS DE DATOS COMPLEJOS/
http://creativecommons.org/licenses/by-nc-nd/3.0/es/
Open Access
Attribution-NonCommercial-NoDerivs 3.0 Spain
E-prints [73024]