Here, two matches are possible x 1 =b and x 2 =nana and x 1 =ban and x 2 =na.
there are three possible matching 1. shortest match (x 1 =b and x 2 =nana) 2. longest match (x 1 =ban and x 2 =na) 3. try all matching combinations The matching strategy that tends to be successful is somewhat language-dependent: for a language with a preference for suffixation, longest match is typically preferred, while for others shortest match or trying all combinations may be the best choice.