- Rating
- 2
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
This paper addresses the retro-transcription of Braille into text when the transcription “code” is unknown. All “codes” are written using the same 256 Unicode Braille cells. Direct (text-to-Braille) transcription is deterministic but not injective, so inverting it amounts to recovering both the code and the text. The authors propose to fine-tune Qwen2.5-7B with LoRA on approximately 940k synthetic pairs produced by a fork of LibLouis from Wikipedia and FLORES, covering 156 codes and 85 languages. The data mix monocode documents, intra-document code alternation, line-by-line mixtures of 2 to 4 codes, and mathematics in Nemeth. At inference, the model draws 20 candidates (best-of-20) and uses the transcriber as an exact verifier: it keeps the most probable candidate whose re-transcription exactly matches the input; otherwise it falls back to a compromise between log-probability and cell-level edit distance. Experiments on synthetic and real data show good performance (0.36% CER on synthetic data, 0.85% on real data), even though on some corpora the proposed system obtains worse results than the baselines. The authors carry out a complete and interesting error analysis.
Critical strengths
- Elegant inference strategy: the idea of using an exact verifier is an excellent way to exploit the determinism of text → Braille transcription.
- An interesting problem whose usefulness is certain.
- A particularly careful, convincing, and substantial evaluation (many languages).
These three points show that this is serious work carried out with care, and lead me to lean toward acceptance.
Critical weaknesses
- Very thin methodological novelty: to my eyes this is mostly a (very good) piece of engineering work that combines already-published methods in an interesting but straightforward way. There is no discussion of the generality of the method: are there other domains / problems falling into the same framework (non-injective deterministic inversions)?
- The construction of the baselines seems biased to me: Liblouis's overall score (11.8%) seems mostly due to a few tools whose performances look abnormally high to me (th-g2 at 108%, zh-tw at 86%, table 10). Do the conclusions still hold if one instead considers the median of the scores (or a macro-average)? The GPT-5.5 baseline is insufficiently described (no prompt), and the computed score includes empty outputs (appendix C), which unfairly penalizes the system in my view.
- A more general description of the problem is perhaps missing: as someone discovering the problem, I have difficulty grasping the extent to which code switching occurs in Braille texts (with the possible exception of texts containing mathematics). It might be useful to better describe the importance and the scope of the problem.
Questions for authors
- Could you report LibLouis's score as a macro-average per code and case-insensitively? Given the seemingly anomalous results for a few tools (th-g2 at 108%, zh-tw at 86%, table 10), does the proposed system still outperform LibLouis under this fairer metric?
- Could you provide the GPT-5.5 baseline's CER excluding the empty outputs (appendix C), as well as the exact prompt used (or state (more) explicitely that you use the same prompt for all models) ? This would allow a fairer assessment of this baseline.
Response to Reviewer kKXj
We thank Reviewer kKXj for the comments and review and also for recognizing the strength of the submission.
W1 (Novelty and generality of UBT).
Please refer to our general response #6.
W2 (Potential bias of the baseline evaluation).
W3 (Scope of code switching).
We revised our manuscript (Section 3.1, "Challenges" paragraph) to clarify this. Code switching commonly occurs in documents from non-English-speaking regions, especially educational materials (e.g., a Korean math textbook mixing the Korean, English, and math codes), which makes it particularly important for accessibility. Note that Table 2 shows that UBT maintains performance on challenging code-switching documents (demonstrated up to k=4).
Questions for authors.
We have addressed these in our responses to the weakness comments (W2) above.
Please let us know any other comments or questions.
Sincerely, Authors of UBT