A Finite-State Morphological Grammar of Hebrew

Shlomo Yona, Shuly Wintner

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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. 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
Title of host publicationProceedings of the ACL Workshop on Computational Approaches to Semitic Languages
Place of PublicationUSA
PublisherAssociation for Computational Linguistics
Pages9–16
StatePublished - 2005

Publication series

NameSemitic '05
PublisherAssociation for Computational Linguistics

Cite this