Skip to Main content Skip to Navigation
Conference papers

Un algorithme universel pour l'abstraction automatique d'alternances morphophonologiques

Sacha Beniamine 1
1 LLF UMR7110 - Laboratoire de Linguistique Formelle
Abstract : We present an implemented algorithm for the inference of morphophonological alternation patterns between word-forms. It is universal in that it leads to comparable classifications across languages without expectations on the shape of the alternations it searches for. Alternation patterns are a necessary first step for the quantitative study of morphology in the Word and Paradigm framework.
Keywords : typology quantitative linguistics Alternation patterns Quantitative morphology Word and Paradigm Morphology Morphology Computational morphology Inflection morphophonology
Document type :
Conference papers
Complete list of metadata

Cited literature [21 references]  Display  Hide  Download
https://hal.inria.fr/hal-01615899
Contributor : Sacha Beniamine <>
Submitted on : Thursday, October 12, 2017 - 6:14:59 PM
Last modification on : Tuesday, April 14, 2020 - 12:33:33 PM

File

Vignette du document
tipapatternspaper.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01615899, version 1

Collections

CNRS | UNIV-PARIS7 | LLF | USPC | UNIV-PARIS | UP-SOCIETES-HUMANITES

Citation

Sacha Beniamine. Un algorithme universel pour l'abstraction automatique d'alternances morphophonologiques. 24e Conférence sur le Traitement Automatique des Langues Naturelles (TALN), Jun 2017, Orléans, France. ⟨hal-01615899⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

130

Files downloads

218

 

Contact                    Legal Notice                    Personal Data