Name
Abstract | ||
|---|---|---|
The basic idea behind FM is simple, instead of working with untyped reg-ular expressions, which is the state of the art of morphology in computational linguistics, we use finite functions over hereditarily finite algebraic data types. These data types and functions constitute the language-dependent part of the morphology. The language-independent part consists of an untyped dictionary format which is used for synthesis of word forms, translations to other formats, and a decorated trie, which is used for analysis. Functional Morphology builds on ideas introduced by Huet [6] in his com-putational linguistics toolkit Zen, which he has used to implement the morphol-ogy of Sanskrit. In particular, Huet's ideas about sandhi in Sanskrit have been adopted to a language independent description of compound analysis in FM. The goal of FM has been to make it easy for linguists, who are not trained as functional programmers, to implement the morphology of a new language. In addition to the ease of programming, FM attempts to exploit the high level of abstraction provided by functional programming to make it possible to capture linguistic generalizations. A morphology written in FM has a type system, which defines the inflec-tional and inherent parameters of the language described. By using algebraic data types, the type system can guarantee that no spurious parameter combina-tions appear in the morphology description, at the same time as all meaningful combinations are defined. The use of the functional language Haskell provides, besides typing, many other language features that simplify the development of a morphology: higher-order functions, functions as first class objects, give the possibility of defining |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/11780885_36 | Lecture Notes in Artificial Intelligence |
Keywords | Field | DocType |
functional programming,data type,functional language,higher order functions,type system | Functional programming,Computer science,Finite-state machine,Theoretical computer science,Natural language,Natural language processing,Artificial intelligence,Haskell,Runtime system | Conference |
Volume | ISSN | Citations |
4002 | 0302-9743 | 0 |
PageRank | References | Authors |
0.34 | 3 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Markus Forsberg | 1 | 111 | 15.77 |
| Aarne Ranta | 2 | 316 | 36.02 |