TY - GEN

T1 - Restoring natural language as a computerised mathematics input method

AU - Kamareddine, Fairouz

AU - Lamar, Robert

AU - Maarek, Manuel

AU - Wells, J. B.

PY - 2007

Y1 - 2007

N2 - Methods for computerised mathematics have found little appeal among mathematicians because they call for additional skills which are not available to the typical mathematician. We herein propose to reconcile computerised mathematics to mathematicians by restoring natural language as the primary medium for mathematical authoring. Our method associates portions of text with grammatical argumentation roles and computerises the informal mathematical style of the mathematician. Typical abbreviations like the aggregation of equations a = b > c, are not usually accepted as input to computerised languages. We propose specific annotations to explicate the morphology of such natural language style, to accept input in this style, and to expand this input in the computer to obtain the intended representation (i.e., a = b and b > c). We have named this method syntax souring in contrast to the usual syntax sugaring. All results have been implemented in a prototype editor developed on top of TEXMACS as a GUI for the core grammatical aspect of MathLang, a framework developed by the ULTRA group to computerise and formalise mathematics. © Springer-Verlag Berlin Heidelberg 2007.

AB - Methods for computerised mathematics have found little appeal among mathematicians because they call for additional skills which are not available to the typical mathematician. We herein propose to reconcile computerised mathematics to mathematicians by restoring natural language as the primary medium for mathematical authoring. Our method associates portions of text with grammatical argumentation roles and computerises the informal mathematical style of the mathematician. Typical abbreviations like the aggregation of equations a = b > c, are not usually accepted as input to computerised languages. We propose specific annotations to explicate the morphology of such natural language style, to accept input in this style, and to expand this input in the computer to obtain the intended representation (i.e., a = b and b > c). We have named this method syntax souring in contrast to the usual syntax sugaring. All results have been implemented in a prototype editor developed on top of TEXMACS as a GUI for the core grammatical aspect of MathLang, a framework developed by the ULTRA group to computerise and formalise mathematics. © Springer-Verlag Berlin Heidelberg 2007.

UR - http://www.scopus.com/inward/record.url?scp=38049056626&partnerID=8YFLogxK

M3 - Conference contribution

SN - 9783540730835

VL - 4573 LNAI

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 280

EP - 295

BT - Towards Mechanized Mathematical Assistants - 14th Symposium, Calculemus 2007 - 6th International Conference, MKM 2007, Proceedings

T2 - 14th Symposium on Calculemus 2007 and 6th International Conference on Mathematical Knowledge Management

Y2 - 27 June 2007 through 30 June 2007

ER -