A finite-state morphological grammar of hebrew

  • Authors:
  • S. Yona;S. Wintner

  • Affiliations:
  • Department of computer science, university of haifa, 31905 haifa, israel e-mail: shlomo@cs.haifa.ac.il, shuly@cs.haifa.ac.il;Department of computer science, university of haifa, 31905 haifa, israel e-mail: shlomo@cs.haifa.ac.il, shuly@cs.haifa.ac.il

  • Venue:
  • Natural Language Engineering
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

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. This paper describes 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.