| tech,5-2-P97-1040,ak | <term> OTP </term> specifies the class of <term> | autosegmental representations | </term> , the <term> universal generator Gen | #29470 OTP specifies the class of autosegmental representations , the universal generator Gen, and the two simple families of permissible constraints. | |
| model,19-2-P97-1040,ak | </term> , and the two simple families of <term> | permissible constraints | </term> . In contrast to less restricted | #29484 OTP specifies the class of autosegmental representations, the universal generator Gen, and the two simple families of permissible constraints . | |
| tech,19-3-P97-1040,ak | forms </term> can be generated with <term> | finite-state methods | </term> adapted from ( Ellison , 1994 ) | #29506 In contrast to less restricted theories using Generalized Alignment, OTP's optimal surface forms can be generated with finite-state methods adapted from (Ellison, 1994). | |
| tech,15-7-P97-1040,ak | <term> factored automata </term> , where <term> | regular languages | </term> are represented compactly via <term> | #29589 One avenue for future improvements is a new finite-state notion, factored automata, where regular languages are represented compactly via formal intersections N~=IAi of FSAs. | |
| other,21-7-P97-1040,ak | </term> are represented compactly via <term> | formal intersections | </term> N ~ = IAi of <term> FSAs </term> . We | #29595 One avenue for future improvements is a new finite-state notion, factored automata, where regular languages are represented compactly via formal intersections N~=IAi of FSAs. |
