[Mova](https://md.mova.elamur.ai/free/en/) · [this page in HTML](https://mova.elamur.ai/free/en/docs/papers/authors/idan-szpektor/)

[home](https://md.mova.elamur.ai/free/en/) / [docs](https://md.mova.elamur.ai/free/en/docs/) / [papers](https://md.mova.elamur.ai/free/en/docs/papers/) / [authors](https://md.mova.elamur.ai/free/en/docs/papers/authors/) / Idan Szpektor

# Idan Szpektor

2 paper cards in Mova's library · 2007–2023

Idan Szpektor wrote 2 of the papers Mova reads, in 2007–2023; often with Hila Noga, Iddo Greental, [Ido Dagan](https://md.mova.elamur.ai/free/en/docs/papers/authors/ido-dagan/).

[OpenAlex](https://openalex.org/A5026091724) · [ORCID](https://orcid.org/0009-0002-2746-4027) · [**h-index 30**](https://openalex.org/authors/A5026091724) · [2655 citations](https://openalex.org/authors/A5026091724) · [145 works](https://openalex.org/works?filter=author.id:A5026091724) — openalex, 2026-10-18

The profile is the library's match of the name; two people with one name are not always told apart.

Elsewhere: [Google Scholar](https://scholar.google.com/citations?view_op=search_authors&mauthors=Idan+Szpektor) · [Semantic Scholar](https://www.semanticscholar.org/search?q=Idan+Szpektor) · [dblp](https://dblp.org/search?q=Idan+Szpektor) · [ACL Anthology](https://aclanthology.org/search/?q=Idan+Szpektor) · [ORCID](https://orcid.org/orcid-search/search?searchQuery=Idan+Szpektor)

## Papers

1. **[Multilingual Sequence-to-Sequence Models for Hebrew NLP](https://md.mova.elamur.ai/free/en/docs/papers/findings-2023-eyal-multilingual-sequence-sequence-models-hebrew/)** *(2023)* The authors argue that Hebrew encoder-only models (AlephBERT, AlephBERT-Gimmel, HeBERT) cannot emit morphemes or labels that are not in the input, so they need extra segment-then-tag components.
2. **[Semantic Inference at the Lexical-Syntactic Level for Textual Entailment Recognition](https://md.mova.elamur.ai/free/en/docs/papers/haim-2007-semantic-inference-lexical-syntactic-level/)** *(2007)* The paper proposes a proof system for textual entailment that works directly on dependency trees. Entailment rules, manual or acquired from WordNet and from DIRT-style paraphrase data, rewrite the text tree step by step towards the hypothesis, and a cost function measures the remaining distance when no full proof is…

## Co-authors (8)

- Hila Noga
- Iddo Greental
- [Ido Dagan](https://md.mova.elamur.ai/free/en/docs/papers/authors/ido-dagan/)
- [Matan Eyal](https://md.mova.elamur.ai/free/en/docs/papers/authors/matan-eyal/)
- Moshe Friedman
- [Reut Tsarfaty](https://md.mova.elamur.ai/free/en/docs/papers/authors/reut-tsarfaty/)
- [Roee Aharoni](https://md.mova.elamur.ai/free/en/docs/papers/authors/roee-aharoni/)
- [Roy Bar-Haim](https://md.mova.elamur.ai/free/en/docs/papers/authors/roy-bar-haim/)
- [← previous Idan Brusilovsky](https://md.mova.elamur.ai/free/en/docs/papers/authors/idan-brusilovsky/)
- [next → Ido Dagan](https://md.mova.elamur.ai/free/en/docs/papers/authors/ido-dagan/)
- [↑ back to Authors](https://md.mova.elamur.ai/free/en/docs/papers/authors/)