Home
Search
Classification
About BLLDB
Contact
Privacy
Help
Deutsch
STATUS
Guest (Restricted Access)
SELECTED TITLES
Selected titles:
0
Export:
Text
|
Dublin Core
|
RIS
Journal article
[Search Result]
|
[save]
|
Bibliographic description
Author
Bird, Steven;
Ellison, T. Mark
Title
One-level phonology
autosegmental representations and rules as finite automata
Written in
English
Notes
60 Literaturangaben
Source
Computational linguistics. - Cambridge, Mass. : MIT Press
Volume
20
Year
1994
Issue
1
Page
55-90
Classification
Domains / Computational linguistics
Domains / Computational linguistics / Parsing / Grammar types (computational linguistics) / Automata (theory of)
Domains / Grammaticography / Theory of grammar / Rule (theory of grammar) / Rule ordering
Levels / Phonology / Rule (phonem.)
Levels / Phonology / Theory (phonem.) / Non-linear phonology
Redirected from
Computational linguistics ; Theory of automata; Automata (theory of) ; Feeding (theory of grammar) ; Bleeding (theory of grammar) ; Counterfeeding (theory of grammar) ; Counterbleeding (theory of grammar) ; Elsewhere condition; Rule ordering ; Rule (phonem.) ; Autosegmentale Phonologie; Phonology, non-linear; Three-dimensional phonology; Non-linear phonology
