1993 · 14 citations · 16 references
ComputingComputer ScienceLinguisticsComputational LinguisticsMorphologyNatural Language ProcessingAutomata TheoryComputational ModelsFinite AutomataFinite-state MachinesMorphological TheoryAllomorphyAutomata-theoretic SemanticsFinite Automata Theory
Morphotactics and allomorphy are usually modeled in different components, leading to interface problems. To describe both uniformly, we define finite automata (FA) for allomorphy in the same feature description language used for morphotactics. Nonphonologically conditioned allomorphy is problematic in FA models but submits readily to treatment in a uniform formalism.
16
An algorithm for functional uncertainty
Ronald M. Kaplan, John T. Maxwell · 1988 · 66 citations · Full text
Richard Sproat · Language · 1993 · 64 citations
Computers & Mathematics with Applications · 1993 · 50 citations