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 \Phi_n(z)}
... is translated to the CAS output ...
Semantic latex: \Phi_n(z)
Confidence: 0
Mathematica
Translation: Subscript[\[CapitalPhi], n][z]
Information
Sub Equations
- Subscript[\[CapitalPhi], n][z]
Free variables
- Subscript[\[CapitalPhi], n]
- n
- z
Symbol info
- Function without DLMF-Definition. We keep it like it is (but delete prefix \ if necessary).
Tests
Symbolic
Numeric
SymPy
Translation: Symbol('{Symbol('Phi')}_{n}')(z)
Information
Sub Equations
- Symbol('{Symbol('Phi')}_{n}')(z)
Free variables
- Symbol('{Symbol('Phi')}_{n}')
- n
- z
Symbol info
- Function without DLMF-Definition. We keep it like it is (but delete prefix \ if necessary).
Tests
Symbolic
Numeric
Maple
Translation: Phi[n](z)
Information
Sub Equations
- Phi[n](z)
Free variables
- Phi[n]
- n
- z
Symbol info
- Function without DLMF-Definition. We keep it like it is (but delete prefix \ if necessary).
Tests
Symbolic
Numeric
Dependency Graph Information
Includes
Is part of
Description
- polynomial
- orthogonal polynomial
- term
- respect to the measure
- coefficient
- complex number with absolute value
- Szegő 's recurrence
- Verblunsky coefficient
Complete translation information:
{
"id" : "FORMULA_938bfe75e2c739585b0cf4c2897bfaf5",
"formula" : "\\Phi_n(z)",
"semanticFormula" : "\\Phi_n(z)",
"confidence" : 0.0,
"translations" : {
"Mathematica" : {
"translation" : "Subscript[\\[CapitalPhi], n][z]",
"translationInformation" : {
"subEquations" : [ "Subscript[\\[CapitalPhi], n][z]" ],
"freeVariables" : [ "Subscript[\\[CapitalPhi], n]", "n", "z" ],
"tokenTranslations" : {
"\\Phi" : "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" : "SKIPPED",
"numberOfTests" : 0,
"numberOfFailedTests" : 0,
"numberOfSuccessfulTests" : 0,
"numberOfSkippedTests" : 0,
"numberOfErrorTests" : 0,
"crashed" : false,
"testCalculationsGroup" : [ ]
}
},
"SymPy" : {
"translation" : "Symbol('{Symbol('Phi')}_{n}')(z)",
"translationInformation" : {
"subEquations" : [ "Symbol('{Symbol('Phi')}_{n}')(z)" ],
"freeVariables" : [ "Symbol('{Symbol('Phi')}_{n}')", "n", "z" ],
"tokenTranslations" : {
"\\Phi" : "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" : "SKIPPED",
"numberOfTests" : 0,
"numberOfFailedTests" : 0,
"numberOfSuccessfulTests" : 0,
"numberOfSkippedTests" : 0,
"numberOfErrorTests" : 0,
"crashed" : false,
"testCalculationsGroup" : [ ]
}
},
"Maple" : {
"translation" : "Phi[n](z)",
"translationInformation" : {
"subEquations" : [ "Phi[n](z)" ],
"freeVariables" : [ "Phi[n]", "n", "z" ],
"tokenTranslations" : {
"\\Phi" : "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" : "SKIPPED",
"numberOfTests" : 0,
"numberOfFailedTests" : 0,
"numberOfSuccessfulTests" : 0,
"numberOfSkippedTests" : 0,
"numberOfErrorTests" : 0,
"crashed" : false,
"testCalculationsGroup" : [ ]
}
}
},
"positions" : [ {
"section" : 1,
"sentence" : 1,
"word" : 9
} ],
"includes" : [ "\\alpha_n" ],
"isPartOf" : [ "\\Phi_0(z) = 1", "\\Phi_{n+1}(z)=z\\Phi_n(z)-\\overline\\alpha_n\\Phi_n^*(z)", "\\Phi_n^*(z)=z^n\\overline{\\Phi_n(1/\\overline{z})}" ],
"definiens" : [ {
"definition" : "polynomial",
"score" : 0.8639666567432684
}, {
"definition" : "orthogonal polynomial",
"score" : 0.6954080343007951
}, {
"definition" : "term",
"score" : 0.6954080343007951
}, {
"definition" : "respect to the measure",
"score" : 0.6288842031023242
}, {
"definition" : "coefficient",
"score" : 0.5775629775816605
}, {
"definition" : "complex number with absolute value",
"score" : 0.5775629775816605
}, {
"definition" : "Szegő 's recurrence",
"score" : 0.4904718574912855
}, {
"definition" : "Verblunsky coefficient",
"score" : 0.441749596053091
} ]
}