Paradigm Function Morphology Engine (PFME)

Version 1.7. Manual for this program (PDF). Other available versions: 1.1 1.2 1.3 1.4 1.5 1.6 2.0 2.1 2.2 2.3 .

Here are some PFM files you can download and then submit. They meant as examples of our PFM syntax, not linguistic theories of the languages represented. Not all provide correct results or even reasonable approaches to the problems they try to solve. However, they are generally syntactically correct input to the PFM engine.

Or submit from a file:

Or enter using this form:

Language
Paradigm function, like PF(<L, σ>) = III(II(I(Stem(<L,σ>))))
PF(<L, σ>) =
Rules of referral, like PF(<L, σ:{ 3 sg pres indic }>) = (Y, σ), where PF(<L, σ>) = <Y, τ> and τ = σ/{ 3 sg pres }
Stem-selection rules, like Stem(<BRJÓTA , σ:{ past indic }>)= brut
Rules of exponence, like I, XV[ V2 ], σ:{ sg pres indic } → Xi

Phonological classes, like vowel = a e i o u y
Sandhi, like i → Ø / _u, u_
Lexical entries, like Lexeme BRJÓTA Meaning break Category V Inflection class S2a
Paradigm schemata, Inflection class V-S2a { {1/2/3 sg/pl pres/past indic/subj} {1/2 pl impv} },
Show only queries for which we know the true results
Known truths, like GRÍPA:{indic pres sg 3} = grípur,