Greek2MathTex: A Greek Speech-to-Text Framework for LaTeX Equations Generation

• URL: http://arxiv.org/abs/2412.12167v1
• Date: Wed, 11 Dec 2024 22:29:44 GMT
• Title: Greek2MathTex: A Greek Speech-to-Text Framework for LaTeX Equations Generation
• Abstract summary: We present a novel speech-to-La equations system specifically designed for the Greek language.<n>We propose an end-to-end system that harnesses the power of Automatic Speech Recognition (ASR) and Natural Language Processing (NLP) techniques.
• Score: 1.7660225024861564
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In the vast majority of the academic and scientific domains, LaTeX has established itself as the de facto standard for typesetting complex mathematical equations and formulae. However, LaTeX's complex syntax and code-like appearance present accessibility barriers for individuals with disabilities, as well as those unfamiliar with coding conventions. In this paper, we present a novel solution to this challenge through the development of a novel speech-to-LaTeX equations system specifically designed for the Greek language. We propose an end-to-end system that harnesses the power of Automatic Speech Recognition (ASR) and Natural Language Processing (NLP) techniques to enable users to verbally dictate mathematical expressions and equations in natural language, which are subsequently converted into LaTeX format. We present the architecture and design principles of our system, highlighting key components such as the ASR engine, the LLM-based prompt-driven equations generation mechanism, as well as the application of a custom evaluation metric employed throughout the development process. We have made our system open source and available at https://github.com/magcil/greek-speech-to-math.

Related papers

• Code as Representation: A Compilable Parsing Paradigm for Academic Documents [50.40789738182074]
  Compilable Academic Document Parsing (CADP) is a paradigm that reconstructs a full page as contextual La plus executable Python.<n>We introduce CADP-Bench, an expert-verified benchmark of full academic pages containing text and multiple SAE types.<n>Results show that even frontier models still struggle to produce high-fidelity executable reconstructions.
  arXiv  Detail & Related papers  (2026-08-18T09:10:43Z)
• AI-Friendly LaTeX: Using LaTeX Code as a Knowledge Source for Retrieval-Augmented Generation [0.0]
  Large language models can answer questions about textbooks, lecture notes, and programming exercises more reliably when their answers are grounded in an explicit knowledge source.<n>For mathematical and technical material, the original source can be a better starting point than a PDF, because it contains structural information, labels, sectioning commands, macros, and authorial intent that are often lost or distorted in PDF extraction.<n>This article describes a focused preprocessing approach for turning source, together with its compiled auxiliary files and optional author annotations, into chunks suitable for indexing in a vector database.
  arXiv  Detail & Related papers  (2026-05-21T18:01:51Z)
• LaTeXTrans: Structured LaTeX Translation with Multi-Agent Coordination [46.53643691093418]
  We introduce MTTrans, a collaborative multi-agent system designed to translate structured-formatted documents.<n>Trans ensures format preservation, structural fidelity, and consistency through six specialized agents.
  arXiv  Detail & Related papers  (2025-08-26T08:17:26Z)
• $A^2R^2$: Advancing Img2LaTeX Conversion via Visual Reasoning with Attention-Guided Refinement [53.14935624161711]
  Vision-language models (VLMs) have achieved remarkable progress across a range of visual understanding tasks.<n>We propose $A2R2$: Advancing Img2La Conversion via Visual Reasoning with Attention-Guided Refinement.<n>For effective evaluation, we introduce a new dataset, Img2LaTex-Hard-1K, consisting of 1,100 carefully curated and challenging examples.
  arXiv  Detail & Related papers  (2025-07-28T14:41:57Z)
• Guided Tensor Lifting [54.10411390218929]
  Domain-specific languages (s) for machine learning are revolutionizing the speed and efficiency of machine learning workloads. To take advantage of these capabilities, a user must first translate their legacy code from the language it is currently written in, into the new DSL. Process of automatically lifting code into these DSLs has been identified by several recent works, which propose program synthesis as a solution.
  arXiv  Detail & Related papers  (2025-04-28T12:00:10Z)
• TeXBLEU: Automatic Metric for Evaluate LaTeX Format [4.337656290539519]
  We propose BLEU, a metric for evaluating mathematical expressions in the format built on the n-gram-based BLEU metric. The proposed BLEU consists of a tokenizer trained on the arXiv paper dataset and a fine-tuned embedding model with positional encoding.
  arXiv  Detail & Related papers  (2024-09-10T16:54:32Z)
• MathBridge: A Large Corpus Dataset for Translating Spoken Mathematical Expressions into $LaTeX$ Formulas for Improved Readability [10.757551947236879]
  We introduce MathBridge, the first extensive dataset for translating mathematical spoken sentences into formulas. MathBridge significantly enhances the capabilities of pretrained language models for converting to formulas from mathematical spoken sentences.
  arXiv  Detail & Related papers  (2024-08-07T18:07:15Z)
• Towards Semantic Markup of Mathematical Documents via User Interaction [0.0]
  We present an approach to semantic markup of formulas by (semi-)automatically generating grammars from existing s macro definitions and parsing formulas with them. We also present a GUI-based tool for the disambiguation of parse results and showcase its potential using a grammar for parsing untyped $lambda$-terms.
  arXiv  Detail & Related papers  (2024-08-05T12:36:40Z)
• Integration of LaTeX formula in computer-based test application for academic purposes [0.21748200848556345]
  Computer-based testing (CBT) has become widespread in recent years. Most establishments now use it to deliver assessments as an alternative to using the pen-paper method. Existing CBT applications lack the capacity to handle advanced formulas, programming codes, and tables.
  arXiv  Detail & Related papers  (2024-01-13T16:36:51Z)
• LILO: Learning Interpretable Libraries by Compressing and Documenting Code [71.55208585024198]
  We introduce LILO, a neurosymbolic framework that iteratively synthesizes, compresses, and documents code. LILO combines LLM-guided program synthesis with recent algorithmic advances in automated from Stitch. We find that AutoDoc boosts performance by helping LILO's synthesizer to interpret and deploy learned abstractions.
  arXiv  Detail & Related papers  (2023-10-30T17:55:02Z)
• Tree-Based Representation and Generation of Natural and Mathematical Language [77.34726150561087]
  Mathematical language in scientific communications and educational scenarios is important yet relatively understudied. Recent works on mathematical language focus either on representing stand-alone mathematical expressions, or mathematical reasoning in pre-trained natural language models. We propose a series of modifications to existing language models to jointly represent and generate text and math.
  arXiv  Detail & Related papers  (2023-02-15T22:38:34Z)
• JiuZhang: A Chinese Pre-trained Language Model for Mathematical Problem Understanding [74.12405417718054]
  This paper aims to advance the mathematical intelligence of machines by presenting the first Chinese mathematical pre-trained language model(PLM) Unlike other standard NLP tasks, mathematical texts are difficult to understand, since they involve mathematical terminology, symbols and formulas in the problem statement. We design a novel curriculum pre-training approach for improving the learning of mathematical PLMs, consisting of both basic and advanced courses.
  arXiv  Detail & Related papers  (2022-06-13T17:03:52Z)
• TexSmart: A Text Understanding System for Fine-Grained NER and Enhanced Semantic Analysis [61.28407236720969]
  This technique report introduces TexSmart, a text understanding system that supports fine-grained named entity recognition (NER) and enhanced semantic analysis functionalities. TexSmart holds some unique features. First, the NER function of TexSmart supports over 1,000 entity types, while most other public tools typically support several to (at most) dozens of entity types. Second, TexSmart introduces new semantic analysis functions like semantic expansion and deep semantic representation, that are absent in most previous systems.
  arXiv  Detail & Related papers  (2020-12-31T14:58:01Z)
• Reproducible Science with LaTeX [4.09920839425892]
  This paper proposes a procedure to execute external source codes from a document. It includes the calculation outputs in the resulting Portable Document Format (pdf) file automatically.
  arXiv  Detail & Related papers  (2020-10-04T04:04:07Z)
• Generative Language Modeling for Automated Theorem Proving [94.01137612934842]
  This work is motivated by the possibility that a major limitation of automated theorem provers compared to humans might be addressable via generation from language models. We present an automated prover and proof assistant, GPT-f, for the Metamath formalization language, and analyze its performance.
  arXiv  Detail & Related papers  (2020-09-07T19:50:10Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.