GTFS to OSM route matching: jbda-shiga-konancity-konansimegurukun

Every GTFS trip is matched against the OSM route relations of the same type whose bounding box covers the trip's area. A candidate must pass five gates — platform count, stop-to-stop length, direction, platform positions and platform names — and the best one is accepted when the mean of its scores exceeds 0.70. If no candidate carries the trip's own ref, the best other candidate needs a mean above 0.75 and a 0.05 lead over any other line. Trips of one stop pattern (the same stop sequence) are decided together, so each row below is one stop pattern, matched ones (green candidate cell) included so a route's matched and unmatched patterns can be compared; the candidate shown is the one that decided the result or, when nothing passed, the one that got furthest. The pink cell says why: a signal — the first gate the candidate failed; the ref — no relation of the trip's own line passed the gates (or none is a candidate at all, when the ref score is 0), so this is another line; the mean — the candidate passed every gate but the mean is not above the threshold, or, when a "lost its margin to" row follows, it leads that other line by less than 0.05. Hover a pink cell for the full wording. "map" opens the pattern over OpenStreetMap: GTFS stops in red, the candidate's platforms in green, the runner-up's in orange, and the platform–stop pairs the points signal assigned as dashed lines.