A Finite-State Morphological Grammar of Hebrew

Shlomo Yona; Shuly Wintner

A Finite-State Morphological Grammar of Hebrew

Shlomo Yona
, Shuly Wintner

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 language	English
Title of host publication	Proceedings of the ACL Workshop on Computational Approaches to Semitic Languages
Place of Publication	USA
Publisher	Association for Computational Linguistics
Pages	9-16
Number of pages	8
State	Published - 2005
Event	2005 Workshop on Computational Approaches to Semitic Languages, SEMITIC@ACL 2005 - Ann Arbor, United States Duration: 29 Jun 2005 → …

Publication series

Name	Semitic '05
Publisher	Association for Computational Linguistics

Conference

Conference	2005 Workshop on Computational Approaches to Semitic Languages, SEMITIC@ACL 2005
Country/Territory	United States
City	Ann Arbor
Period	29/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

Access to Document

https://dl.acm.org/doi/pdf/10.5555/1621787.1621790

Cite this

@inproceedings{c923a02afda147b4b077589723675b43,

title = "A Finite-State Morphological Grammar of Hebrew",

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.",

author = "Shlomo Yona and Shuly Wintner",

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: {\textcopyright} 2005 Association for Computational Linguistics.; 2005 Workshop on Computational Approaches to Semitic Languages, SEMITIC@ACL 2005 ; Conference date: 29-06-2005",

year = "2005",

language = "English",

series = "Semitic '05",

publisher = "Association for Computational Linguistics",

pages = "9--16",

booktitle = "Proceedings of the ACL Workshop on Computational Approaches to Semitic Languages",

address = "United States",

}

Yona, S & Wintner, S 2005, A Finite-State Morphological Grammar of Hebrew. in Proceedings of the ACL Workshop on Computational Approaches to Semitic Languages. Semitic '05, Association for Computational Linguistics, USA, pp. 9-16, 2005 Workshop on Computational Approaches to Semitic Languages, SEMITIC@ACL 2005, Ann Arbor, United States, 29/06/05. <https://dl.acm.org/doi/pdf/10.5555/1621787.1621790>

TY - GEN

T1 - A Finite-State Morphological Grammar of Hebrew

AU - Yona, Shlomo

AU - Wintner, Shuly

N1 - 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.

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/33646819875

M3 - Conference contribution

T3 - Semitic '05

SP - 9

EP - 16

BT - Proceedings of the ACL Workshop on Computational Approaches to Semitic Languages

PB - Association for Computational Linguistics

CY - USA

T2 - 2005 Workshop on Computational Approaches to Semitic Languages, SEMITIC@ACL 2005

Y2 - 29 June 2005

ER -

A Finite-State Morphological Grammar of Hebrew

Abstract

Publication series

Conference

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this