ACL RD-TEC 1.0 Summarization of P97-1002
Paper Title:
FAST CONTEXT-FREE PARSING REQUIRES FAST BOOLEAN MATRIX MULTIPLICATION
FAST CONTEXT-FREE PARSING REQUIRES FAST BOOLEAN MATRIX MULTIPLICATION
Primarily assigned technology terms:
- algorithm
- bmm checking
- boolean matrix multiplication
- cfg parsing
- context-free parsing
- context-free recognition
- encoding
- information extraction
- language processing
- language understanding
- matrix multiplication
- natural language processing
- natural language understanding
- on-line recognition
- parser
- parsers
- parsing
- processing
- recognition
- retrieving
Other assigned terms:
- array
- boolean matrix
- break
- case
- chomsky normal form
- context-free grammar
- derivation
- derivations
- empty string
- fact
- forest
- formalization
- grammar
- grammars
- index
- input string
- language processing applications
- likelihood
- method
- natural language
- natural language processing applications
- nonterminal
- nonterminals
- normal form
- oracle
- parse
- parse forest
- parse tree
- process
- queries
- query
- relation
- running time
- sentence
- structural information
- substring
- symbol
- terminals
- theorem
- tree
- tree-adjoining grammars
- understanding
