Unsupervised Induction of Natural Language Morphology Inflection Classes
C. Monson, A. Lavie, J. Carbonell, and L. Levin. In Proceedings of the Seventh Meeting of the ACL Special Interest Group in Computational Phonology (SIGPHON ’04, page 52--61. (2004)
Abstract
We propose a novel language-independent framework for inducing a collection of morphological inflection classes from a monolingual corpus of full form words. Our approach involves two main stages. In the first stage, we generate a large data structure of candidate inflection classes and their interrelationships. In the second stage, search and filtering techniques are applied to this data structure, to identify a select collection of "true " inflection classes of the language. We describe the basic methodology involved in both stages of our approach and present an evaluation of our baseline techniques applied to induction of major inflection classes of Spanish. The preliminary results on an initial training corpus already surpass an F1 of 0.5 against ideal Spanish inflectional morphology classes. 1
Description
Unsupervised Induction of Natural Language Morphology Inflection Classes
%0 Conference Paper
%1 Monson04unsupervisedinduction
%A Monson, Christian
%A Lavie, Alon
%A Carbonell, Jaime
%A Levin, Lori
%B In Proceedings of the Seventh Meeting of the ACL Special Interest Group in Computational Phonology (SIGPHON ’04
%D 2004
%K class induction inflection long morphology suffix trie
%P 52--61
%T Unsupervised Induction of Natural Language Morphology Inflection Classes
%U http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.132.4004
%X We propose a novel language-independent framework for inducing a collection of morphological inflection classes from a monolingual corpus of full form words. Our approach involves two main stages. In the first stage, we generate a large data structure of candidate inflection classes and their interrelationships. In the second stage, search and filtering techniques are applied to this data structure, to identify a select collection of "true " inflection classes of the language. We describe the basic methodology involved in both stages of our approach and present an evaluation of our baseline techniques applied to induction of major inflection classes of Spanish. The preliminary results on an initial training corpus already surpass an F1 of 0.5 against ideal Spanish inflectional morphology classes. 1
@inproceedings{Monson04unsupervisedinduction,
abstract = {We propose a novel language-independent framework for inducing a collection of morphological inflection classes from a monolingual corpus of full form words. Our approach involves two main stages. In the first stage, we generate a large data structure of candidate inflection classes and their interrelationships. In the second stage, search and filtering techniques are applied to this data structure, to identify a select collection of "true " inflection classes of the language. We describe the basic methodology involved in both stages of our approach and present an evaluation of our baseline techniques applied to induction of major inflection classes of Spanish. The preliminary results on an initial training corpus already surpass an F1 of 0.5 against ideal Spanish inflectional morphology classes. 1},
added-at = {2011-08-14T01:55:40.000+0200},
author = {Monson, Christian and Lavie, Alon and Carbonell, Jaime and Levin, Lori},
biburl = {https://www.bibsonomy.org/bibtex/21f51af293f207d84a93a807ff7e2d9de/jil},
booktitle = {In Proceedings of the Seventh Meeting of the ACL Special Interest Group in Computational Phonology (SIGPHON ’04},
description = {Unsupervised Induction of Natural Language Morphology Inflection Classes},
interhash = {8e03c8daee0be8ef271dbf18c962d5b0},
intrahash = {1f51af293f207d84a93a807ff7e2d9de},
keywords = {class induction inflection long morphology suffix trie},
pages = {52--61},
timestamp = {2013-11-23T20:11:51.000+0100},
title = {Unsupervised Induction of Natural Language Morphology Inflection Classes},
url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.132.4004},
year = 2004
}