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 F(x) = D_+(x)}

... is translated to the CAS output ...

Semantic latex: F(x) = D_+(x)

Confidence: 0

Mathematica

Translation: F[x] == Subscript[D, +][x]

Information

Sub Equations

  • F[x] = Subscript[D, +][x]

Free variables

  • x

Symbol info

  • Function without DLMF-Definition. We keep it like it is (but delete prefix \ if necessary).
  • Function without DLMF-Definition. We keep it like it is (but delete prefix \ if necessary).

Tests

Symbolic
Numeric

SymPy

Translation: F(x) == Symbol('{D}_{+}')(x)

Information

Sub Equations

  • F(x) = Symbol('{D}_{+}')(x)

Free variables

  • x

Symbol info

  • Function without DLMF-Definition. We keep it like it is (but delete prefix \ if necessary).
  • Function without DLMF-Definition. We keep it like it is (but delete prefix \ if necessary).

Tests

Symbolic
Numeric

Maple

Translation: F(x) = D[+](x)

Information

Sub Equations

  • F(x) = D[+](x)

Free variables

  • x

Symbol info

  • Function without DLMF-Definition. We keep it like it is (but delete prefix \ if necessary).
  • Function without DLMF-Definition. We keep it like it is (but delete prefix \ if necessary).

Tests

Symbolic
Numeric

Dependency Graph Information

Includes

Complete translation information:

{
  "id" : "FORMULA_c4610b416b4a20eddf672d86dcb2ac20",
  "formula" : "F(x) = D_+(x)",
  "semanticFormula" : "F(x) = D_+(x)",
  "confidence" : 0.0,
  "translations" : {
    "Mathematica" : {
      "translation" : "F[x] == Subscript[D, +][x]",
      "translationInformation" : {
        "subEquations" : [ "F[x] = Subscript[D, +][x]" ],
        "freeVariables" : [ "x" ],
        "tokenTranslations" : {
          "D" : "Function without DLMF-Definition. We keep it like it is (but delete prefix \\ if necessary).",
          "F" : "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" : "F(x) == Symbol('{D}_{+}')(x)",
      "translationInformation" : {
        "subEquations" : [ "F(x) = Symbol('{D}_{+}')(x)" ],
        "freeVariables" : [ "x" ],
        "tokenTranslations" : {
          "D" : "Function without DLMF-Definition. We keep it like it is (but delete prefix \\ if necessary).",
          "F" : "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" : "F(x) = D[+](x)",
      "translationInformation" : {
        "subEquations" : [ "F(x) = D[+](x)" ],
        "freeVariables" : [ "x" ],
        "tokenTranslations" : {
          "D" : "Function without DLMF-Definition. We keep it like it is (but delete prefix \\ if necessary).",
          "F" : "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" : [ ],
  "includes" : [ "F(x)", "x", "F(y)" ],
  "isPartOf" : [ ],
  "definiens" : [ ]
}

Specify your own input