LaTeX to CAS translator
Jump to navigation
Jump to search
This mockup demonstrates the concept of TeX to Computer Algebra System (CAS) conversion.
The demo-application converts LaTeX functions which directly translate to CAS counterparts.
Functions without explicit CAS support are available for translation via a DRMF package (under development).
The following LaTeX input ...
{\displaystyle n \geq 0}
... is translated to the CAS output ...
Semantic latex: n \geq 0
Confidence: 0
Mathematica
Translation: n >= 0
Information
Sub Equations
- n >= 0
Free variables
- n
Tests
Symbolic
Test expression: n\geq0
ERROR:
{
"result": "ERROR",
"testTitle": "Simple",
"testExpression": null,
"resultExpression": null,
"wasAborted": false,
"conditionallySuccessful": false
}
Numeric
SymPy
Translation: n >= 0
Information
Sub Equations
- n >= 0
Free variables
- n
Tests
Symbolic
Numeric
Maple
Translation: n >= 0
Information
Sub Equations
- n >= 0
Free variables
- n
Tests
Symbolic
Numeric
Dependency Graph Information
Includes
Description
- recurrence relation
Complete translation information:
{
"id" : "FORMULA_44688f1fa0e40a02531aa88a17b7b6b8",
"formula" : "n \\geq 0",
"semanticFormula" : "n \\geq 0",
"confidence" : 0.0,
"translations" : {
"Mathematica" : {
"translation" : "n >= 0",
"translationInformation" : {
"subEquations" : [ "n >= 0" ],
"freeVariables" : [ "n" ]
},
"numericResults" : {
"overallResult" : "SKIPPED",
"numberOfTests" : 0,
"numberOfFailedTests" : 0,
"numberOfSuccessfulTests" : 0,
"numberOfSkippedTests" : 0,
"numberOfErrorTests" : 0,
"wasAborted" : false,
"crashed" : false,
"testCalculationsGroups" : [ ]
},
"symbolicResults" : {
"overallResult" : "ERROR",
"numberOfTests" : 1,
"numberOfFailedTests" : 0,
"numberOfSuccessfulTests" : 0,
"numberOfSkippedTests" : 0,
"numberOfErrorTests" : 1,
"crashed" : false,
"testCalculationsGroup" : [ {
"lhs" : "n",
"rhs" : "0",
"testExpression" : "n\\geq0",
"testCalculations" : [ {
"result" : "ERROR",
"testTitle" : "Simple",
"testExpression" : null,
"resultExpression" : null,
"wasAborted" : false,
"conditionallySuccessful" : false
} ]
} ]
}
},
"SymPy" : {
"translation" : "n >= 0",
"translationInformation" : {
"subEquations" : [ "n >= 0" ],
"freeVariables" : [ "n" ]
}
},
"Maple" : {
"translation" : "n >= 0",
"translationInformation" : {
"subEquations" : [ "n >= 0" ],
"freeVariables" : [ "n" ]
}
}
},
"positions" : [ {
"section" : 2,
"sentence" : 11,
"word" : 12
} ],
"includes" : [ "n" ],
"isPartOf" : [ ],
"definiens" : [ {
"definition" : "recurrence relation",
"score" : 0.6859086196238077
} ]
}