Information-based syntax and semantics: Vol. 1: fundamentals
Information-based syntax and semantics: Vol. 1: fundamentals
A computational basis for phonology
Advances in neural information processing systems 2
Languages generated by two-level morphological rules
Computational Linguistics
Phonological analysis in typed feature systems
Computational Linguistics - Special issue on computational phonology
Computational Phonology: A Constraint-Based Approach
Computational Phonology: A Constraint-Based Approach
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Morphological Processing in the Two-Level Paradigm
Text Understanding in LILOG, Integrating Computational Linguistics and Artificial Intelligence, Final Report on the IBM Germany LILOG-Project
On abstract finite-state morphology
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
Nonconcatenative finite-state morphology
EACL '87 Proceedings of the third conference on European chapter of the Association for Computational Linguistics
A morphological recognizer with syntactic and phonological rules
COLING '86 Proceedings of the 11th coference on Computational linguistics
Finite-state phonology in HPSG
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
Phonological analysis in typed feature systems
Computational Linguistics - Special issue on computational phonology
Learning bias and phonological-rule induction
Computational Linguistics
Multitiered nonlinear morphology using multitape finite automata: a case study on Syriac and Arabic
Computational Linguistics - Special issue on finite-state methods in NLP
Optimality theory and the generative complexity of constraint violability
Computational Linguistics
Finite-state reduplication in one-level prosodic morphology
NAACL 2000 Proceedings of the 1st North American chapter of the Association for Computational Linguistics conference
Efficient generation in primitive Optimality Theory
ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
SEMHE: a generalised two-level system
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Phonological derivation in optimality theory
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2
Finite-state multimodal integration and understanding
Natural Language Engineering
MAGEAD: a morphological analyzer and generator for the Arabic dialects
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
On Insertion Grammars with Maximum Parallel Derivation
Fundamenta Informaticae
Morphological analysis and generation for Arabic dialects
Semitic '05 Proceedings of the ACL Workshop on Computational Approaches to Semitic Languages
Automatic acquisition of feature-based phonotactic resources
SIGMorPhon '04 Proceedings of the 7th Meeting of the ACL Special Interest Group in Computational Phonology: Current Themes in Computational Phonology and Morphology
Verifying vowel harmony typologies
SIGMORPHON '10 Proceedings of the 11th Meeting of the ACL Special Interest Group on Computational Morphology and Phonology
A parallel approach to syllabification
CICLing'05 Proceedings of the 6th international conference on Computational Linguistics and Intelligent Text Processing
On Insertion Grammars with Maximum Parallel Derivation
Fundamenta Informaticae
| Hi-index | 0.00 |
When phonological rules are regarded as declarative descriptions, it is possible to construct a model of phonology in which rules and representations are no longer distinguished and such procedural devices as rule-ordering are absent. In this paper we present a finite-state model of phonology in which automata are the descriptions and tapes (or strings) are the objects being described. This provides the formal semantics for an autosegmental phonology without structure-changing rules. Logical operations on the phonological domain---such as conjunction, disjunction, and negation---make sense since the phonological domain consists of descriptions rather than objects. These operations as applied to automata are the straightforward operations of intersection, union, and complement. If the arrow in a rewrite rule is viewed as logical implication, then a phonological rule can also be represented as an automaton, albeit a less restrictive automaton than would be required for a lexical representaton. The model is then compared with the transducer models for autosegmental phonology of Kay (1987), Kornai (1991), and Wiebe (1992). We conclude that the declarative approach to phonology presents an attractive way of extending finite-state techniques to autosegmental phonology while remaining within the confines of regular grammar.