We use the same search algorithm as one proposed by <cite>Yoshida et al. (2014)</cite> , which can efficiently find the approximate solution from a huge number of candidates of the pattern by extending CYK algorithm used in conventional dependency parsing.