275
For non-LR grammars the time-complexity of our parser is cubic if the functions that constitute the parser are implemented as memo-functions , i.e. functions that memorize the results of previous invocations .
 evaluate for: time-complexity, parser; used for: parser, non-LR grammars; used for: memo-functions, parser
Given a phrase that describes the relationship between two words, extract the words and the lexical relationship between them. The output format should be "relation1: word1, word2; relation2: word3, word4". 
Option: conjunction, feature of, hyponym of, used for, part of, compare, evaluate for 
Text: {0} 
Answer:
 evaluate for: time-complexity, parser; used for: parser, non-LR grammars; used for: memo-functions, parser