MAGEAD
Published 1 January 2006Open access
Nizar Habash, Owen Rambow
Citations131
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
MAGEAD performs an on-line analysis to or generation from a root+pattern+features representation, it has separate phonological and orthographic representations, and it allows for combining morphemes from different dialects.
Abstract
We present MAGEAD, a morphological analyzer and generator for the Arabic language family. Our work is novel in that it explicitly addresses the need for processing the morphology of the dialects. MAGEAD performs an on-line analysis to or generation from a root+pattern+features representation, it has separate phonological and orthographic representations, and it allows for combining morphemes from different dialects. We present a detailed evaluation of MAGEAD.
Keywords
PsychologyComputer ScienceArts and Humanities
ScholarWorks@UMassAmherst (University of Massachusetts Amherst)A prosodic theory of nonconcatenative morphology
1,095 Citations1981John J. McCarthy
Journal of the American Society for Information Science and TechnologyArabic morphological analysis techniques: A comprehensive survey
239 Citations2003Imad A. Al‐Sughaiyer, Ibrahim A. Al‐Kharashi
This paper introduces, classifies, and surveys Arabic morphological analysis techniques, and summarizes and organize the information available in the literature in an attempt to motivate researchers to look into these techniques and try to develop more advanced ones.
Building a shallow Arabic Morphological Analyzer in one day
173 Citations2002Kareem Darwish
The paper presents a rapid method of developing a shallow Arabic morphological analyzer based on automatically derived rules and statistics that will only be concerned with generating the possible roots of any given Arabic word.
Nonconcatenative finite-state morphology
138 Citations1987Martin Kay
It follows that an arbi trary ordered set of rewrit ing rules can be modeled by a finite-state transducer which can be automatical ly constructed from them and which serves as well for analyzing surface forms as for generating them from underlying lexical strings.
UWA Profiles and Research Repository (University of Western Australia)One-level phonology: autosegmental representations and rules as finite automata
121 Citations1994Steven Bird, T. Mark Ellison
A finite-state model of phonology in which automata are the descriptions and tapes (or strings) are the objects being described provides the formal semantics for an autosegmental phonology without structure-changing rules.
Computational LinguisticsMultitiered Nonlinear Morphology Using Multitape Finite Automata: A Case Study on Syriac and Arabic
74 Citations2000George Kiraz
This paper presents a computational model for nonlinear morphology with illustrations from Syriac and Arabic that allows for multiple lexical representations corresponding to the multiple tiers of autosegmental phonology.
Morphological analysis and generation for Arabic dialects
68 Citations2005Nizar Habash, Owen Rambow +1 more
Magead provides an analysis to a root+pattern representation, it has separate phonological and orthographic representations, and it allows for combining morphemes from different dialects.
Computational Nonlinear Morphology: With Emphasis on Semitic Languages
67 Citations2001George Kiraz
Arabic morphology using only finite-state operations
66 Citations1998Kenneth R. Beesley
This paper illustrates how the morphotactics and the variation rules of Arabic have been described using only finite-state operations and how this approach has been implemented in a significant morphological analyzer/generator.
Large Scale Lexeme Based Arabic Morphological Generation
50 Citations2004Nizar Habash, Arabic Morphology
Finite-state description of semitic morphology
38 Citations1988Laura Kataja, Kimmo Koskenniemi
Computer Speech & LanguageA feature-based formalism for two-level phonology: a description and implementation
25 Citations1993Stephen Pulman, Mark Hepple
The goal of this paper is to introduce and describe a formalism for segment based phonology and phonological processing.
Computational LinguisticsOne-level phonology
16 Citations1994Steven Bird, EllisonT. Mark
When phonological rules are regarded as declarative descriptions, it is possible to construct a model of phonology in which rules and representations are no longer distinguished and such procedural rules are not distinguished.