Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
119 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

An Unsupervised Method for Uncovering Morphological Chains (1503.02335v1)

Published 8 Mar 2015 in cs.CL

Abstract: Most state-of-the-art systems today produce morphological analysis based only on orthographic patterns. In contrast, we propose a model for unsupervised morphological analysis that integrates orthographic and semantic views of words. We model word formation in terms of morphological chains, from base words to the observed words, breaking the chains into parent-child relations. We use log-linear models with morpheme and word-level features to predict possible parents, including their modifications, for each word. The limited set of candidate parents for each word render contrastive estimation feasible. Our model consistently matches or outperforms five state-of-the-art systems on Arabic, English and Turkish.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (3)
  1. Karthik Narasimhan (82 papers)
  2. Regina Barzilay (106 papers)
  3. Tommi Jaakkola (115 papers)
Citations (73)

Summary

We haven't generated a summary for this paper yet.