How small can a NFA be, compared to the minimal Unambiguous Finite Automaton (UFA) of the same regular language?
There is even a stronger result than your request:

There are exponentially-ambiguous NFAs for which the minimal polynomially-ambiguous NFAs are exponentially larger, and in particular the minimal UFAs.

Check this paper by Hing Leung.