A recursive typed hypergraph representation of natural language, parsed with a random forest and search tree, is enough to rank first on the WiRe57 open information extraction benchmark.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IR 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Semantic Hypergraphs
A recursive typed hypergraph representation of natural language, parsed with a random forest and search tree, is enough to rank first on the WiRe57 open information extraction benchmark.