List your company

Semantic Parsing on UCCA Wiki in-domain (test)

80.5Primary Labeled F-scoreJiang et al. (2019)
50.02857.93965.8573.761Apr 3, 2017Aug 28, 2017Jan 23, 2018Jun 19, 2018Nov 14, 2018Apr 10, 2019Sep 5, 2019

Evaluation results

MethodLinks
Jiang et al. (2019)2019.0980.5—————
attention-based neural transducer2019.0976.6—————
attention-based neural transducernode labels=w/o non-terminal node labels2019.0975.7—————
Hershcovich et al. (2018)Learning setup=MTL2019.0974.3—————
TUPABiLSTMDecoding Strategy=Greedy, Feature Type=Neural (BiLSTM)2017.0473.574.472.747.451.649.4
Hershcovich et al. (2018)Learning setup=single2019.0971.2—————
Hershcovich et al. (2017)2019.0971.1—————
LSTM ParserApproximation Method=Bilexical Tree Approximation (Dependency Tree Parsers), Decoding Strategy=Greedy2017.0469.973.266.9———
TUPAMLPDecoding Strategy=Greedy, Feature Type=Neural (MLP)2017.0464.965.264.623.713.216.9
TUPAsparseDecoding Strategy=Greedy, Feature Type=Sparse2017.0464.164.563.719.813.416
UPARSEApproximation Method=Tree Approximation (Constituency Tree Parser), Decoding Strategy=Beam Search (size 4)2017.0461.160.961.2———
MaltParserApproximation Method=Bilexical Tree Approximation (Dependency Tree Parsers), Decoding Strategy=Greedy2017.0460.262.857.7———
DAGParserApproximation Method=Bilexical Approximation (Dependency DAG Parsers), Decoding Strategy=Beam Search (size 5)2017.0458.661.855.89.50.51
TurboParserApproximation Method=Bilexical Approximation (Dependency DAG Parsers), Decoding Strategy=Greedy2017.0451.257.74677.81.83.7