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 \lambda = n \in \mathbb{N}_0 }
... is translated to the CAS output ...
Semantic latex: \lambda = n \in \mathbb{N}_0
Confidence: 0
Mathematica
Translation: \[Lambda] == n \[Element]Subscript[N, 0]
Information
Sub Equations
- \[Lambda] = n
Free variables
- Subscript[N, 0]
- \[Lambda]
- n
Tests
Symbolic
Numeric
SymPy
Translation: Symbol('lambda') == n null Symbol('{N}_{0}')
Information
Sub Equations
- Symbol('lambda') = n
Free variables
- Symbol('lambda')
- Symbol('{N}_{0}')
- n
Tests
Symbolic
Numeric
Maple
Translation: lambda = n in N[0]
Information
Sub Equations
- lambda = n
Free variables
- N[0]
- lambda
- n
Tests
Symbolic
Numeric
Dependency Graph Information
Includes
Description
- integer degree
- nonpolynomial solution for the special case
Complete translation information:
{
"id" : "FORMULA_70355bf6f0a8d6bf8c1649a2648dc1c2",
"formula" : "\\lambda = n \\in \\mathbb{N}_0",
"semanticFormula" : "\\lambda = n \\in \\mathbb{N}_0",
"confidence" : 0.0,
"translations" : {
"Mathematica" : {
"translation" : "\\[Lambda] == n \\[Element]Subscript[N, 0]",
"translationInformation" : {
"subEquations" : [ "\\[Lambda] = n" ],
"freeVariables" : [ "Subscript[N, 0]", "\\[Lambda]", "n" ]
},
"numericResults" : {
"overallResult" : "SKIPPED",
"numberOfTests" : 0,
"numberOfFailedTests" : 0,
"numberOfSuccessfulTests" : 0,
"numberOfSkippedTests" : 0,
"numberOfErrorTests" : 0,
"wasAborted" : false,
"crashed" : false,
"testCalculationsGroups" : [ ]
},
"symbolicResults" : {
"overallResult" : "SKIPPED",
"numberOfTests" : 0,
"numberOfFailedTests" : 0,
"numberOfSuccessfulTests" : 0,
"numberOfSkippedTests" : 0,
"numberOfErrorTests" : 0,
"crashed" : false,
"testCalculationsGroup" : [ ]
}
},
"SymPy" : {
"translation" : "Symbol('lambda') == n null Symbol('{N}_{0}')",
"translationInformation" : {
"subEquations" : [ "Symbol('lambda') = n" ],
"freeVariables" : [ "Symbol('lambda')", "Symbol('{N}_{0}')", "n" ]
},
"numericResults" : {
"overallResult" : "SKIPPED",
"numberOfTests" : 0,
"numberOfFailedTests" : 0,
"numberOfSuccessfulTests" : 0,
"numberOfSkippedTests" : 0,
"numberOfErrorTests" : 0,
"wasAborted" : false,
"crashed" : false,
"testCalculationsGroups" : [ ]
},
"symbolicResults" : {
"overallResult" : "SKIPPED",
"numberOfTests" : 0,
"numberOfFailedTests" : 0,
"numberOfSuccessfulTests" : 0,
"numberOfSkippedTests" : 0,
"numberOfErrorTests" : 0,
"crashed" : false,
"testCalculationsGroup" : [ ]
}
},
"Maple" : {
"translation" : "lambda = n in N[0]",
"translationInformation" : {
"subEquations" : [ "lambda = n" ],
"freeVariables" : [ "N[0]", "lambda", "n" ]
},
"numericResults" : {
"overallResult" : "SKIPPED",
"numberOfTests" : 0,
"numberOfFailedTests" : 0,
"numberOfSuccessfulTests" : 0,
"numberOfSkippedTests" : 0,
"numberOfErrorTests" : 0,
"wasAborted" : false,
"crashed" : false,
"testCalculationsGroups" : [ ]
},
"symbolicResults" : {
"overallResult" : "SKIPPED",
"numberOfTests" : 0,
"numberOfFailedTests" : 0,
"numberOfSuccessfulTests" : 0,
"numberOfSkippedTests" : 0,
"numberOfErrorTests" : 0,
"crashed" : false,
"testCalculationsGroup" : [ ]
}
}
},
"positions" : [ {
"section" : 3,
"sentence" : 0,
"word" : 10
}, {
"section" : 4,
"sentence" : 0,
"word" : 10
} ],
"includes" : [ "\\lambda" ],
"isPartOf" : [ ],
"definiens" : [ {
"definition" : "integer degree",
"score" : 0.8869384888466118
}, {
"definition" : "nonpolynomial solution for the special case",
"score" : 0.7869654366758058
} ]
}