9113
Because exact parsing with a PCFG-LA is NP-hard , several approximations are described and empirically compared .
 PCFG-LA, exact parsing
Please list all entity pairs containing a certain relationship in the given options.Output format is "word1, word2; word3, word4". 
Option: conjunction, feature of, hyponym of, used for, part of, compare, evaluate for 
Text: {0} 
Answer:
 PCFG-LA, exact parsing