no code implementations • 31 Oct 2023 • Ari Rappoport
Competition resolution crucially depends on the formation of membrane lipid rafts, which requires astrocyte-produced cholesterol.
1 code implementation • 31 Dec 2020 • Omri Abend, Nathan Schneider, Dotan Dvir, Jakob Prange, Ari Rappoport
This is the annotation manual for Universal Conceptual Cognitive Annotation (UCCA; Abend and Rappoport, 2013), specifically the Foundational Layer.
1 code implementation • Joint Conference on Lexical and Computational Semantics 2020 • Elior Sulem, Omri Abend, Ari Rappoport
Building on recent advances in semantic parsing and text simplification, we investigate the use of semantic splitting of the source sentence as preprocessing for machine translation.
1 code implementation • WS 2019 • Adi Shalev, Jena D. Hwang, Nathan Schneider, Vivek Srikumar, Omri Abend, Ari Rappoport
Research on adpositions and possessives in multiple languages has led to a small inventory of general-purpose meaning classes that disambiguate tokens.
2 code implementations • NAACL 2019 • Daniel Hershcovich, Omri Abend, Ari Rappoport
Syntactic analysis plays an important role in semantic parsing, but the nature of this role remains a topic of ongoing debate.
1 code implementation • 15 Mar 2019 • Daniel Hershcovich, Omri Abend, Ari Rappoport
Syntactic analysis plays an important role in semantic parsing, but the nature of this role remains a topic of ongoing debate.
no code implementations • SEMEVAL 2019 • Daniel Hershcovich, Zohar Aizenbud, Leshem Choshen, Elior Sulem, Ari Rappoport, Omri Abend
We present the SemEval 2019 shared task on UCCA parsing in English, German and French, and discuss the participating systems and results.
1 code implementation • EMNLP 2018 • Elior Sulem, Omri Abend, Ari Rappoport
BLEU is widely considered to be an informative metric for text-to-text generation, including Text Simplification (TS).
no code implementations • ACL 2018 • Elior Sulem, Omri Abend, Ari Rappoport
Here we present a simple and efficient splitting algorithm based on an automatic semantic parser.
Ranked #19 on Text Simplification on TurkCorpus
1 code implementation • NAACL 2018 • Elior Sulem, Omri Abend, Ari Rappoport
Current measures for evaluating text simplification systems focus on evaluating lexical text aspects, neglecting its structural aspects.
1 code implementation • CONLL 2018 • Daniel Hershcovich, Omri Abend, Ari Rappoport
This paper presents our experiments with applying TUPA to the CoNLL 2018 UD shared task.
no code implementations • 16 Aug 2018 • Effi Levi, Saggy Herman, Ari Rappoport
Clustering a lexicon of words is a well-studied problem in natural language processing (NLP).
no code implementations • 31 May 2018 • Daniel Hershcovich, Leshem Choshen, Elior Sulem, Zohar Aizenbud, Ari Rappoport, Omri Abend
Given the success of recent semantic parsing shared tasks (on SDP and AMR), we expect the task to have a significant contribution to the advancement of UCCA parsing in particular, and semantic parsing in general.
1 code implementation • ACL 2018 • Daniel Hershcovich, Omri Abend, Ari Rappoport
The ability to consolidate information of different types is at the core of intelligence, and has tremendous practical value in allowing learning for one task to benefit from generalizations learned for others.
Ranked #3 on UCCA Parsing on SemEval 2019 Task 1
no code implementations • ACL 2017 • Omri Abend, Ari Rappoport
Semantic representation is receiving growing attention in NLP in the past few years, and many proposals for semantic schemes (e. g., AMR, UCCA, GMB, UDS) have been put forth.
1 code implementation • ACL 2017 • Daniel Hershcovich, Omri Abend, Ari Rappoport
We present the first parser for UCCA, a cross-linguistically applicable framework for semantic representation, which builds on extensive typological work and supports rapid annotation.
Ranked #4 on UCCA Parsing on SemEval 2019 Task 1
no code implementations • CONLL 2017 • Ivan Vulić, Roy Schwartz, Ari Rappoport, Roi Reichart, Anna Korhonen
With our selected context configurations, we train on only 14% (A), 26. 2% (V), and 33. 6% (N) of all dependency-based contexts, resulting in a reduced training time.
no code implementations • ACL 2016 • Effi Levi, Roi Reichart, Ari Rappoport
The run time complexity of state-of-the-art inference algorithms in graph-based dependency parsing is super-linear in the number of input words (n).