{"url":"/sota/handwritten-mathmatical-expression","task":{"name":"Handwritten Mathmatical Expression Recognition","url":"/task/handwritten-mathmatical-expression","note":null},"dataset":{"name":"CROHME 2014","url":"/dataset/crohme-2014"},"category":"Computer Vision","categories":["Computer Vision"],"category_note":null,"description":"Offline Handwritten mathematical Expression Recognition aims to convert 2D images into a 1D structured sequences(LaTeX or MathML)","description_from":"task","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","rank":"the archive's row order at snapshot; not re-ranked","rows_end_at":"2025-07-28","rows_withheld_as_spam":0,"metric_values":"the archive's strings, untouched"},"metrics":["ExpRate"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction); null = not inferred, chart draws points only","by_metric":{"ExpRate":null}},"counts":{"rows":17,"rows_with_code":15,"rows_with_paper_page":17,"rows_dated":16,"rows_using_additional_data":1},"rows":[{"rank_in_archive_order":1,"model":"Uni-MuMER","metrics":{"ExpRate":"82.05"},"uses_additional_data":true,"paper_date":"2025-05-29","paper":"/paper/uni-mumer-unified-multi-task-fine-tuning-of","paper_url":"https://arxiv.org/abs/2505.23566v1","paper_title":"Uni-MuMER: Unified Multi-Task Fine-Tuning of Vision-Language Model for Handwritten Mathematical Expression Recognition","code":"https://github.com/bflameswift/uni-mumer","n_code_links":1,"syntology":{"n_ran":7,"n_unverified":0,"n_samples":7,"n_pointer_only_licence":0}},{"rank_in_archive_order":2,"model":"Uni-MuMER","metrics":{"ExpRate":"75.36"},"uses_additional_data":false,"paper_date":"2025-05-29","paper":"/paper/uni-mumer-unified-multi-task-fine-tuning-of","paper_url":"https://arxiv.org/abs/2505.23566v1","paper_title":"Uni-MuMER: Unified Multi-Task Fine-Tuning of Vision-Language Model for Handwritten Mathematical Expression Recognition","code":"https://github.com/bflameswift/uni-mumer","n_code_links":1,"syntology":{"n_ran":7,"n_unverified":0,"n_samples":7,"n_pointer_only_licence":0}},{"rank_in_archive_order":3,"model":"TAMER","metrics":{"ExpRate":"61.23"},"uses_additional_data":false,"paper_date":"2024-08-16","paper":"/paper/tamer-tree-aware-transformer-for-handwritten","paper_url":"https://arxiv.org/abs/2408.08578v2","paper_title":"TAMER: Tree-Aware Transformer for Handwritten Mathematical Expression Recognition","code":"https://github.com/qingzhenduyu/tamer","n_code_links":1,"syntology":{"n_ran":4,"n_unverified":3,"n_samples":7,"n_pointer_only_licence":7}},{"rank_in_archive_order":4,"model":"ICAL","metrics":{"ExpRate":"60.63"},"uses_additional_data":false,"paper_date":"2024-05-15","paper":"/paper/ical-implicit-character-aided-learning-for","paper_url":"https://arxiv.org/abs/2405.09032v4","paper_title":"ICAL: Implicit Character-Aided Learning for Enhanced Handwritten Mathematical Expression Recognition","code":"https://github.com/qingzhenduyu/ical","n_code_links":1,"syntology":null},{"rank_in_archive_order":5,"model":"NAMER","metrics":{"ExpRate":"60.51"},"uses_additional_data":false,"paper_date":"2024-07-16","paper":"/paper/namer-non-autoregressive-modeling-for","paper_url":"https://arxiv.org/abs/2407.11380v1","paper_title":"NAMER: Non-Autoregressive Modeling for Handwritten Mathematical Expression Recognition","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":6,"model":"PosFormer","metrics":{"ExpRate":"60.45"},"uses_additional_data":false,"paper_date":"2024-07-10","paper":"/paper/posformer-recognizing-complex-handwritten","paper_url":"https://arxiv.org/abs/2407.07764v1","paper_title":"PosFormer: Recognizing Complex Handwritten Mathematical Expression with Position Forest Transformer","code":"https://github.com/sjtu-deepvisionlab/posformer","n_code_links":1,"syntology":{"n_ran":8,"n_unverified":1,"n_samples":9,"n_pointer_only_licence":9}},{"rank_in_archive_order":7,"model":"CoMER","metrics":{"ExpRate":"58.38"},"uses_additional_data":false,"paper_date":"2022-07-10","paper":"/paper/comer-modeling-coverage-for-transformer-based","paper_url":"https://arxiv.org/abs/2207.04410v2","paper_title":"CoMER: Modeling Coverage for Transformer-based Handwritten Mathematical Expression Recognition","code":"https://github.com/Green-Wood/CoMER","n_code_links":2,"syntology":{"n_ran":1,"n_unverified":1,"n_samples":2,"n_pointer_only_licence":2}},{"rank_in_archive_order":8,"model":"CAN-ABM","metrics":{"ExpRate":"57.26"},"uses_additional_data":false,"paper_date":"2022-07-23","paper":"/paper/when-counting-meets-hmer-counting-aware","paper_url":"https://arxiv.org/abs/2207.11463v1","paper_title":"When Counting Meets HMER: Counting-Aware Network for Handwritten Mathematical Expression Recognition","code":"https://github.com/lbh1024/can","n_code_links":3,"syntology":{"n_ran":0,"n_unverified":6,"n_samples":6,"n_pointer_only_licence":0}},{"rank_in_archive_order":9,"model":"CAN-DWAP","metrics":{"ExpRate":"57.00"},"uses_additional_data":false,"paper_date":"2022-07-23","paper":"/paper/when-counting-meets-hmer-counting-aware","paper_url":"https://arxiv.org/abs/2207.11463v1","paper_title":"When Counting Meets HMER: Counting-Aware Network for Handwritten Mathematical Expression Recognition","code":"https://github.com/lbh1024/can","n_code_links":3,"syntology":{"n_ran":0,"n_unverified":6,"n_samples":6,"n_pointer_only_licence":0}},{"rank_in_archive_order":10,"model":"ABM","metrics":{"ExpRate":"56.85"},"uses_additional_data":false,"paper_date":"2021-12-07","paper":"/paper/handwritten-mathematical-expression-1","paper_url":"https://arxiv.org/abs/2112.03603v3","paper_title":"Handwritten Mathematical Expression Recognition via Attention Aggregation based Bi-directional Mutual Learning","code":"https://github.com/XH-B/ABM","n_code_links":1,"syntology":null},{"rank_in_archive_order":11,"model":"SAN","metrics":{"ExpRate":"56.2"},"uses_additional_data":false,"paper_date":"2022-03-03","paper":"/paper/syntax-aware-network-for-handwritten","paper_url":"https://arxiv.org/abs/2203.01601v4","paper_title":"Syntax-Aware Network for Handwritten Mathematical Expression Recognition","code":"https://github.com/tal-tech/san","n_code_links":2,"syntology":{"n_ran":0,"n_unverified":2,"n_samples":2,"n_pointer_only_licence":2}},{"rank_in_archive_order":12,"model":"BTTR","metrics":{"ExpRate":"53.96"},"uses_additional_data":false,"paper_date":"2021-05-06","paper":"/paper/handwritten-mathematical-expression","paper_url":"https://arxiv.org/abs/2105.02412v3","paper_title":"Handwritten Mathematical Expression Recognition with Bidirectionally Trained Transformer","code":"https://github.com/Green-Wood/BTTR","n_code_links":2,"syntology":{"n_ran":1,"n_unverified":2,"n_samples":3,"n_pointer_only_licence":0}},{"rank_in_archive_order":13,"model":"TDv2","metrics":{"ExpRate":"53.62"},"uses_additional_data":false,"paper_date":"2022-06-28","paper":"/paper/tdv2-a-novel-tree-structured-decoder-for","paper_url":"https://ojs.aaai.org/index.php/AAAI/article/view/20172","paper_title":"TDv2: A Novel Tree-Structured Decoder for Offline Mathematical Expression Recognition","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":14,"model":"DenseWAP-MSA","metrics":{"ExpRate":"52.8"},"uses_additional_data":false,"paper_date":"2018-01-05","paper":"/paper/multi-scale-attention-with-dense-encoder-for","paper_url":"http://arxiv.org/abs/1801.03530v2","paper_title":"Multi-Scale Attention with Dense Encoder for Handwritten Mathematical Expression Recognition","code":"https://github.com/JianshuZhang/WAP","n_code_links":2,"syntology":null},{"rank_in_archive_order":15,"model":"DenseWAP","metrics":{"ExpRate":"50.1"},"uses_additional_data":false,"paper_date":"2018-01-05","paper":"/paper/multi-scale-attention-with-dense-encoder-for","paper_url":"http://arxiv.org/abs/1801.03530v2","paper_title":"Multi-Scale Attention with Dense Encoder for Handwritten Mathematical Expression Recognition","code":"https://github.com/JianshuZhang/WAP","n_code_links":2,"syntology":null},{"rank_in_archive_order":16,"model":"TD","metrics":{"ExpRate":"49.1"},"uses_additional_data":false,"paper_date":null,"paper":"/paper/a-tree-structured-decoder-for-image-to-markup","paper_url":"https://proceedings.icml.cc/static/paper_files/icml/2020/3307-Paper.pdf","paper_title":"A Tree-Structured Decoder for Image-to-Markup Generation","code":"https://github.com/JianshuZhang/TreeDecoder","n_code_links":1,"syntology":null},{"rank_in_archive_order":17,"model":"WAP","metrics":{"ExpRate":"46.55"},"uses_additional_data":false,"paper_date":"2017-07-01","paper":"/paper/watch-attend-and-parse-an-end-to-end-neural","paper_url":"https://www.sciencedirect.com/science/article/pii/S0031320317302376","paper_title":"Watch, attend and parse: An end-to-end neural network based approach to handwritten mathematical expression recognition","code":"https://github.com/JianshuZhang/WAP","n_code_links":1,"syntology":null}],"since_archive":{"claim":"Results that newer papers report for their own method, placed here by Syntology. A model pointed at the cell in the paper's own table; the number was read from that cell and checked against this leaderboard's metric, dataset, split and scale; an independent check that saw this leaderboard's other rows and every other leaderboard on the same dataset accepted it. Not reviewed by the paper's authors or by the archive's editors, and not ranked against the archive rows.","extraction_file_present":true,"measurement":{"test_papers":883,"papers_with_output":881,"judged_true":108,"judged":110,"wilson95_lower":0.9361,"measured_on":"2026-09-24","frozen_commit":"0e3de0df94"},"measurement_note":"blind adjudication of accepted entries on a held-out split of archive papers, rules frozen before the test","coverage":{"sentence":"Syntology has checked 6,264 of the 9,581 papers on this site that are newer than the archive; results from the others appear after they are checked.","complete":false,"papers_newer_than_archive":9581,"papers_checked":6264,"papers_extracted_not_yet_verified":0,"boards_without_verdict":2,"papers_not_yet_extracted":3316},"order":"newest first by month (arXiv date, else the arXiv-id month), then arXiv id descending","columns":[],"entries":[]},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per row: N of M harvested code samples from that row's paper executed on a synthesized fixture; the other M-N are unverified. Not a reproduction of the row's number; not a correctness claim. n_pointer_only_licence counts samples the site points at rather than redistributes (a licence axis, independent of ran/unverified).","rows_with_graph_line":9,"rows_with_any_sample_ran":6,"distinct_papers_with_graph_line":7,"distinct_papers_with_any_sample_ran":5,"samples_over_distinct_papers":{"n_ran":21,"n_unverified":15,"n_samples":36,"n_pointer_only_licence":20,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":28,"n_unverified":21,"n_samples":49,"n_pointer_only_licence":20,"note":"row-weighted: a paper behind several rows is counted once per row; inflated relative to samples_over_distinct_papers by design, kept for readers summing the per-row syntology blocks"}}}