A proper edge colouring of a graph G is neighbour-distinguishing provided that it distinguishes adjacent vertices by sets of colours of their incident edges. It is proved that for any planar bipartite graph G with ?(G) = 12 there is a neighbour-distinguishing edge colouring of G using at most ?(G)+1 colours. Colourings distinguishing pairs of vertices that satisfy other requirements are also considered.