The reviewed record of science sign in
Pith

arxiv: 2406.05424 · v1 · pith:EW4WAT4X · submitted 2024-06-08 · cs.CL · cs.LG

Recent advancements in computational morphology : A comprehensive survey

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:EW4WAT4Xrecord.jsonopen to challenge →

classification cs.CL cs.LG
keywords computationalmorphologyrecentsurveylevelmethodsmorphologicalneural
0
0 comments X
read the original abstract

Computational morphology handles the language processing at the word level. It is one of the foundational tasks in the NLP pipeline for the development of higher level NLP applications. It mainly deals with the processing of words and word forms. Computational Morphology addresses various sub problems such as morpheme boundary detection, lemmatization, morphological feature tagging, morphological reinflection etc. In this paper, we present exhaustive survey of the methods for developing computational morphology related tools. We survey the literature in the chronological order starting from the conventional methods till the recent evolution of deep neural network based approaches. We also review the existing datasets available for this task across the languages. We discuss about the effectiveness of neural model compared with the traditional models and present some unique challenges associated with building the computational morphology tools. We conclude by discussing some recent and open research issues in this field.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Comonadic Morphophonology: A Compositional Framework for Context-Dependent Morphological Rules in Finnish

    cs.CL 2026-05 unverdicted novelty 7.0

    Presents the Writer comonad (DeletionSet x Zipper) as a new compositional framework for Finnish morphophonological rules, reducing representation from 874 continuation classes to 13 coKleisli arrows with 83.92% UPOS a...