Recent advances have significantly improved the performance of Abstract Meaning Representation (AMR) parsers, yet determining when their outputs can be trusted remains largely unexplored.
This work presents the first study of uncertainty estimation for AMR parsers in a black-box setting using top-k beam-search candidates.
Uncertainty is estimated from pairwise candidate similarities and evaluated using the Prediction Rejection Ratio.
This work characterises the relationship between parsing performance and uncertainty, evaluates the reliability of beam candidate distributions, analyses the effect of evaluation metrics on uncertainty assessment, and identifies parsers that provide the strongest balance between performance and reliability.
Experimental results show the value of uncertainty estimation as a complementary dimension for evaluating AMR parsers.