Computational Morphology
@inproceedings{Trost2003ComputationalM,
title={Computational Morphology},
author={Harald Trost},
year={2003}
}Computational morphology deals with the processing of words and word forms, in both their graphemic, i.e., written form, and their phonemic, i.e., spoken form. It has a wide range of practical applications. Probably every one of you has already come across some of them. Ever used spelling correction? Or wondered about some strange hyphenation in a newspaper article? This is computational morphology at work. To solve such seemingly simple tasks often poses hard problems for a computer program…
Figures from this paper
34 Citations
2 Sub-Sentential Processing 1113 . 2 Sub-Sentential Processing 1
- Linguistics, Computer Science
- 2007
This chapter discusses language technology products that employ annotated grammar, which consists of a lexicon, and rules that syntactically and semantically combine words and phrases into larger phrases and sentences.
Inducing Morphemes Using Light Knowledge
- Computer ScienceTALIP
- 2010
A hybrid approach that uses a small amount of linguistic knowledge in the form of orthographic rewrite rules to help refine an existing MI-produced segmentation to learn morphemes and derive underlying analyses of morphs from an existing surface morph segmentation, and from these learn a morpheme-level segmentation.
Phonetic Spelling and Heuristic Search
- Computer ScienceECAI
- 2006
A new approach to spellchecking for languages with extreme phonetic irregularities by describing the main building blocks to tackle this problem with heuristic search with SMARTSPELL algorithm.
Morphology-based language modeling for amharic
- Computer Science
- 2010
The study showed that using morphemes in modeling morphologically rich languages is advantageous, especially in reducing the OOV rate, which improves word recognition accuracy of small vocabulary morpheme-based speech recognition systems.
Chapter 3 Language Analysis and Understanding ( Taken from the Book : “ Survey of the state of the art in human language technology ” ) 3 . 1 Overview
- Linguistics
We understand larger textual units by combining our understanding of smaller ones. The main aim of linguistic theory is to show how these larger units of meaning arise out of the combination of the…
Compositional-ly Derived Representations of Morphologically Complex Words in Distributional Semantics
- Computer Science, LinguisticsACL
- 2013
This work adapts compositional methods originally developed for phrases to the task of deriving the distributional meaning of morphologically complex words from their parts, and demonstrates the usefulness of a compositional morphology component in distributional semantics.
Corpus-size Quantification for Computational Morphological Analysis of Igbo Language
- Linguistics
- 2017
Data-driven approaches to morphology learning have gained popularity over rule-based approaches. This development favours languages with rich electronic linguistic resources because that is a major…
Language Analysis and Understanding 3 . 1 Overview
- Linguistics
- 2001
We understand larger textual units by combining our understanding of smaller ones. The main aim of linguistic theory is to show how these larger units of meaning arise out of the combination of the…
Comparing languages from vocabulary growth to inflection paradigms: A study run on parallel corpora and multilingual lexicons
- LinguisticsProces. del Leng. Natural
- 2008
A corpora and lexical comparative study on how to compare the difficulties of five languages for morphosyntactic analysis and the development of lexicographic resources and offers some surprising quantitative results on differences in languages.
An LVQ connectionist solution to the non-determinacy problem in Arabic morphological analysis: a learning hybrid algorithm
- Computer ScienceNatural Language Engineering
- 2002
This paper describes an LVQ-based learning pattern association system that uniquely maps a given Arabic word to its corresponding morphological pattern, and therefore deduces its morphological properties.
References
SHOWING 1-10 OF 18 REFERENCES
A General Computational Model For Word-Form Recognition And Production
- Computer ScienceCOLING
- 1984
A language independent model for recognition and production of word forms is presented, based on a new way of describing morphological alternations that is capable of both analyzing and synthesizing word-forms.
The Sound Pattern of English
- Linguistics
- 1968
Since this classic work in phonology was published in 1968, there has been no other book that gives as broad a view of the subject, combining generally applicable theoretical contributions with…
Formalisms for Morphographemic Description
- LinguisticsEACL
- 1987
An alternative specification formalism is possible which solves some of the problems of the Koskenniemi model, and can be viewed as a variant of the "pure" Kosk Kennemi model with certain constraints relaxed.
Coping With Derivation in a Morphological Component
- LinguisticsEACL
- 1993
A morphological component with a limited capability to automatically interpret (and generate) derived words is presented and allows to minimize redundancy in the lexicon because derived words that are transparent need note to be stored explicitly.
DATR: A Language for Lexical Knowledge Representation
- Linguistics, Computer ScienceCL
- 1996
The paper provides an informal example-based introduction to DATR and to techniques for its use, including finite-state transduction, the encoding of DAGs and lexical rules, and the representation of ambiguity and alternation.
TRIPLE TAKE: TIGRE AND THE CASE OF INTERNAL REDUPLICATION *
- Linguistics
- 2003
The characteristics of Tigre reduplication are described here, and are shown to diverge from the other languages in two main respects: i) the meaning and ii) the ability to incur multiple reduplications of the reduplicative syllable.
Nonconcatenative Finite-State Morphology
- Computer ScienceEACL
- 1987
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.
SEMHE: A Generalised Two-Level System
- Computer ScienceACL
- 1996
A generalised two-level implementation which can handle linear and non- linear morphological operations and a number of issues which arise when developing non-linear grammars are discussed with examples from Syriac.
Compiling Regular Formalisms with Rule Features into Finite-State Automata
- Computer ScienceACL
- 1997
This paper presents an algorithm for the compilation of regular formalisms with rule features into finite-state automata. Rule features are incorporated into the right context of rules. This general…