A finite-state morphological grammar of Hebrew

Shlomo Yona, Shuly Wintner

Research output: Contribution to conferencePaperpeer-review


Morphological analysis is a crucial component of several natural language processing tasks, especially for languages with a highly productive morphology, where stipulating a full lexicon of surface forms is not feasible. We describe HAMSAH (HAifa Morphological System for Analyzing Hebrew), a morphological processor for Modern Hebrew, based on finite-state linguistically motivated rules and a broad coverage lexicon. The set of rules comprehensively covers the morphological, morpho-phonological and orthographic phenomena that are observable in contemporary Hebrew texts. Reliance on finite-state technology facilitates the construction of a highly efficient, completely bidirectional system for analysis and generation. HAMSAH is currently the broadest-coverage and most accurate freely-available system for Hebrew.

Original languageEnglish
Number of pages8
StatePublished - 2005
Event2005 Workshop on Computational Approaches to Semitic Languages, SEMITIC@ACL 2005 - Ann Arbor, United States
Duration: 29 Jun 2005 → …


Conference2005 Workshop on Computational Approaches to Semitic Languages, SEMITIC@ACL 2005
Country/TerritoryUnited States
CityAnn Arbor
Period29/06/05 → …

Bibliographical note

Funding Information:
This work was funded by the Israeli Ministry of Science and Technology, under the auspices of the Knowledge Center for Processing Hebrew. We are grateful to Yael Cohen-Sygal, Shira Schwartz and Alon Itai for their help.

Publisher Copyright:
© 2005 Association for Computational Linguistics.

ASJC Scopus subject areas

  • Language and Linguistics
  • Linguistics and Language


Dive into the research topics of 'A finite-state morphological grammar of Hebrew'. Together they form a unique fingerprint.

Cite this