Interactive Word Completion for Plains Cree (2022.acl-long)

Copied to clipboard

Challenge: a tool that helps users incrementally build complex words is being developed in morphologically complex languages.
Approach: They propose a finite state approach which maps prefixes in a language to completions up to the next morpheme boundary for incremental building of complex words.
Outcome: The proposed approach shows portability to a larger, more complete morphological transducer.

Similar Papers

Interactive Word Completion for Morphologically Complex Languages (2020.coling-main)

Copied to clipboard

Challenge: morphologically complex languages have multiple morph slots with large or unbounded sets of fillers.
Approach: They propose a method for morphologically-aware text input in Kunwinjku . they modify an existing finite state recognizer to map input morph prefixes to morph completions .
Outcome: The proposed method is portable to Turkish and shows that it can be used in other languages.
Bootstrapping Techniques for Polysynthetic Morphological Analysis (2020.acl-main)

Copied to clipboard

Challenge: Polysynthetic languages have exceptionally large and sparse vocabularies due to the number of morpheme slots and combinations in a word.
Approach: They propose linguistically-informed approaches for bootstrapping a neural morphological analyzer . they use a finite state transducer to train an encoder-decoder model .
Outcome: The proposed method improves on a polysynthetic language's model by "hallucinating" missing linguistic structure and resampling from a Zipf distribution to simulate a more natural distribution of morphemes.
Morpheme Induction for Emergent Language (2025.emnlp-main)

Copied to clipboard

Challenge: CSAR is a greedy algorithm that weights morphemes based on mutual information between forms and meanings, then removes it from the corpus and repeats the process to induce more morphs.
Approach: They propose an algorithm that weights morphemes based on mutual information between forms and meanings, selects highest-weighted pair, removes it from corpus, and repeats process to induce further morphs.
Outcome: The proposed algorithm makes reasonable predictions in adjacent domains.
SAC-KG: Exploiting Large Language Models as Skilled Automatic Constructors for Domain Knowledge Graph (2024.acl-long)

Copied to clipboard

Challenge: Existing KG construction methods rely on human intervention to attain qualified KGs, which severely hinders the practical application of domain KG.
Approach: They propose a general KG construction framework that uses large language models as "S**killed" A**utomatic C**onstructors for domain knowledge (G**raph)
Outcome: The proposed framework generates specialized multi-level knowledge graphs at the scale of over one million nodes and achieves 89.32% precision rate compared to state-of-the-art methods.
Local Word Discovery for Interactive Transcription (2021.emnlp-main)

Copied to clipboard

Challenge: a new computational task supports the construction of high quality texts and lexicons for low resource languages.
Approach: They propose a computational task which is tuned to the available knowledge and interests in an Indigenous community.
Outcome: The proposed method achieves a transcription density gain of 17% in a morphologically complex language . the proposed grammar includes a description of the phonology and morphosyntax .
Fine-grained Morphosyntactic Analysis and Generation Tools for More Than One Thousand Languages (2020.lrec-1)

Copied to clipboard

Challenge: Using morphosyntactic tools, we train and distribute tools for approximately one thousand languages.
Approach: They train and distribute morphosyntactic tools for approximately one thousand languages.
Outcome: The results show that the tools generalize well across rare and common forms alike.
MorphNLI: A Stepwise Approach to Natural Language Inference Using Text Morphing (2025.findings-naacl)

Copied to clipboard

Challenge: Existing models fail to capture important semantic features of logic such as monotonicity and negation.
Approach: They propose a modular step-by-step approach to natural language inference . they use a language model to generate edits to incrementally transform the premise into the hypothesis .
Outcome: The proposed method outperforms baseline models in realistic cross-domain settings with improvements up to 12.6% (relative).
Morphological Processing of Low-Resource Languages: Where We Are and What’s Next (2022.findings-acl)

Copied to clipboard

Challenge: Existing models for morphological processing are not suitable for low-resource languages, but they are still lacking in the field of computational morphology.
Approach: They propose to bridge two unsupervised models to understand a language’s morphology from raw text alone and propose to use them to improve their models.
Outcome: The proposed models perform reasonably, but there is room for improvement.
KinyaBERT: a Morphology-aware Kinyarwanda Language Model (2022.acl-long)

Copied to clipboard

Challenge: Pre-trained language models such as BERT are sub-optimal at handling morphologically rich languages.
Approach: They propose a two-tier BERT architecture that leverages a morphological analyzer and explicitly represents morphology in a low-resource Kinyarwanda language.
Outcome: The proposed model outperforms baseline models on the low-resource morphologically rich Kinyarwanda language by 2% in F1 score and 4.3% in average score of GLUE benchmark.
To compress or not to compress? A Finite-State approach to Nen verbal morphology (2020.acl-srw)

Copied to clipboard

Challenge: a transitive verb takes up to 1,740 unique features and is highly complex, with a morphological complexity of 80.3% . a finite-state approach has been used to build morphology and phonology resources for Nen, an underresourced language in Papua New Guinea.
Approach: They propose to use Finite-State methods to build a verbal morphological parser for an under-resourced Papuan language, Nen.
Outcome: The proposed model is half the size of the full decomposed model, while the 'Chunking' model is under half the scale of the decomposer, with an overall accuracy of 80.3%.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations