informal description of the PEG morphology algorithm: Difference between revisions
Jump to navigation
Jump to search
m (Text replace - "Morphology: special characters au" to "Morphology: special characters|pau") |
No edit summary |
||
| (9 intermediate revisions by 3 users not shown) | |||
| Line 1: | Line 1: | ||
This is a description of the formal PEG morphology algorithm. If there are or appear to be discrepancies between this description and the formal grammar, the formal grammar wins. | This is a description of the formal PEG morphology algorithm. If there are or appear to be discrepancies between this description and the formal grammar, the formal grammar wins. | ||
| Line 5: | Line 4: | ||
We examine the string from the left, and words are extracted one by one from the left. | We examine the string from the left, and words are extracted one by one from the left. | ||
# Extract all [[Morphology: special characters|pauses]], if there are any. | |||
# Extract a [[Morphology: words|word]] and then any following [[Morphology: special characters|pauses]], if there are any. | |||
# Repeat 2 until there is nothing left.<noinclude> | |||
See also [[Morphology: Rules of formation]] | See also [[Morphology: Rules of formation]] | ||
=Sections= | |||
*[[Morphology: words]] | |||
*[[morphology: cmevla|Morphology: cmevla]] | |||
*[[Morphology: cmavo]] | |||
*[[Morphology: brivla]] | |||
*[[Morphology: fu'ivla]] | |||
*[[Morphology: extended rafsi]] | |||
*[[Morphology: gismu]] | |||
*[[Morphology: rafsi]] | |||
*[[Morphology: syllables]] | |||
*[[Morphology: vowels]] | |||
*[[Morphology: consonants]] | |||
*[[Morphology: special characters]] | |||
*[[informal description of the PEG morphology algorithm/condensed|Another informal description of the morphology, less tied to the PEG rules]] | |||
</noinclude> | |||
[[ | |||
Latest revision as of 12:43, 17 May 2017
This is a description of the formal PEG morphology algorithm. If there are or appear to be discrepancies between this description and the formal grammar, the formal grammar wins.
Given any string of characters, this algorithm will split it uniquely into words, including possibly some non-lojban words.
We examine the string from the left, and words are extracted one by one from the left.
- Extract all pauses, if there are any.
- Extract a word and then any following pauses, if there are any.
- Repeat 2 until there is nothing left.
See also Morphology: Rules of formation