-
Notifications
You must be signed in to change notification settings - Fork 122
Description
Question asks: Distribute all the unique city pairs into the distance ranges 0, 1000, 2000, 3000, 4000, 5000, and 6000+, based on their average distance of all routes between them. Then how many pairs are there in the distance range with the fewest unique city paires?
https://github.com/xlang-ai/Spider2/blob/main/spider2-lite/evaluation_suite/gold/exec_result/local010.csv
The solution answer is given as 6.
Problem: The corresponding gold sql which produces answer of 6 illustrates the issue: https://github.com/xlang-ai/Spider2/blob/main/spider2-snow/evaluation_suite/gold/sql/sf_local010.sql
It treats ("from_city","to_city") as ordered, so flights A→B and B→A become two “unique city pairs”, which contradicts the prompt’s requirement to combine directions into a single pair.
Recommendation:
Modify existing answer to 3 or add as alternative answer 3.