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 x(s)=s(s+1)}
... is translated to the CAS output ...
Semantic latex: x(s)=s(s+1)
Confidence: 0
Mathematica
Translation: x[s] == s*(s + 1)
Information
Sub Equations
- x[s] = s*(s + 1)
Free variables
- s
Symbol info
- Function without DLMF-Definition. We keep it like it is (but delete prefix \ if necessary).
Tests
Symbolic
Test expression: (x*(s))-(s*(s + 1))
ERROR:
{
"result": "ERROR",
"testTitle": "Simple",
"testExpression": null,
"resultExpression": null,
"wasAborted": false,
"conditionallySuccessful": false
}
Numeric
SymPy
Translation: x(s) == s*(s + 1)
Information
Sub Equations
- x(s) = s*(s + 1)
Free variables
- s
Symbol info
- Function without DLMF-Definition. We keep it like it is (but delete prefix \ if necessary).
Tests
Symbolic
Numeric
Maple
Translation: x(s) = s*(s + 1)
Information
Sub Equations
- x(s) = s*(s + 1)
Free variables
- s
Symbol info
- Function without DLMF-Definition. We keep it like it is (but delete prefix \ if necessary).
Tests
Symbolic
Numeric
Dependency Graph Information
Description
- non-uniform lattice
- parameter
Complete translation information:
{
"id" : "FORMULA_2dea6a19b040dc6a3be495c846259145",
"formula" : "x(s)=s(s+1)",
"semanticFormula" : "x(s)=s(s+1)",
"confidence" : 0.0,
"translations" : {
"Mathematica" : {
"translation" : "x[s] == s*(s + 1)",
"translationInformation" : {
"subEquations" : [ "x[s] = s*(s + 1)" ],
"freeVariables" : [ "s" ],
"tokenTranslations" : {
"x" : "Function without DLMF-Definition. We keep it like it is (but delete prefix \\ if necessary)."
}
},
"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" : "x*(s)",
"rhs" : "s*(s + 1)",
"testExpression" : "(x*(s))-(s*(s + 1))",
"testCalculations" : [ {
"result" : "ERROR",
"testTitle" : "Simple",
"testExpression" : null,
"resultExpression" : null,
"wasAborted" : false,
"conditionallySuccessful" : false
} ]
} ]
}
},
"SymPy" : {
"translation" : "x(s) == s*(s + 1)",
"translationInformation" : {
"subEquations" : [ "x(s) = s*(s + 1)" ],
"freeVariables" : [ "s" ],
"tokenTranslations" : {
"x" : "Function without DLMF-Definition. We keep it like it is (but delete prefix \\ if necessary)."
}
}
},
"Maple" : {
"translation" : "x(s) = s*(s + 1)",
"translationInformation" : {
"subEquations" : [ "x(s) = s*(s + 1)" ],
"freeVariables" : [ "s" ],
"tokenTranslations" : {
"x" : "Function without DLMF-Definition. We keep it like it is (but delete prefix \\ if necessary)."
}
}
}
},
"positions" : [ {
"section" : 0,
"sentence" : 1,
"word" : 7
} ],
"includes" : [ ],
"isPartOf" : [ ],
"definiens" : [ {
"definition" : "non-uniform lattice",
"score" : 0.722
}, {
"definition" : "parameter",
"score" : 0.6460746792928004
} ]
}