Phonology (journal)
Phonology is a British peer-reviewed journal of phonology published by Cambridge University Press, the only journal devoted exclusively to this subfield of linguistics. The current editors are Prof. Colin J. Ewen (Leiden University) and Prof. Ellen Kaisse (University of Washington). The volumes from 1997 on are available electronically with subscription via the site of the publisher.
.jpg) | |
| Discipline | Phonology |
|---|---|
| Language | English |
| Edited by | Colin J. Ewen Ellen Kaisse |
| Publication details | |
| History | 1984–present |
| Publisher | Cambridge University Press (United Kingdom) |
| Frequency | Triannual |
| 1.08 (2012) | |
| Standard abbreviations | |
| ISO 4 | Phonology |
| Indexing | |
| ISSN | 0952-6757 (print) 1469-8188 (web) |
| Links | |
Now published three times a year, in its first three years (1984–1987) it appeared once a year under the name Phonology Yearbook.
Most cited articles
As of January 2011, the top 5 most cited articles were (Note that the years indicate "online publication"; so Clements 2008 is, for example, actually Clements 1985, when it was first published in paper format):[1]
- Clements, G. N. (2008). "The geometry of phonological features". Phonology. 2: 225–252. doi:10.1017/S0952675700000440.
- Kiparsky, P. (2008). "Some consequences of Lexical Phonology". Phonology. 2: 85–138. doi:10.1017/S0952675700000397.
- Archangeli, D. (2008). "Aspects of underspecification theory". Phonology. 5 (2): 183–207. doi:10.1017/S0952675700002268.
- Kaye, J.; Lowenstamm, J.; Vergnaud, J. R. (2008). "The internal structure of phonological elements: a theory of charm and government". Phonology. 2: 305–328. doi:10.1017/S0952675700000476.
- Browman, C. P.; Goldstein, L. (2008). "Articulatory gestures as phonological units". Phonology. 6 (2): 201–251. CiteSeerX 10.1.1.469.2241. doi:10.1017/S0952675700001019.
gollark: Doesn't it just segfault at some point?
gollark: It was more elegance™ to just make it able to do tail-call optimization.
gollark: I actually stole this particular quicksort from a r/haskell post talking about it.
gollark: ```lisp (let (partition_rec xs pred acc) (cond ((= xs '()) acc) (true (partition_rec (tail xs) pred (cond ((pred (head xs)) (list (cons (head xs) (head acc)) (snd acc))) (true (list (head acc) (cons (head xs) (snd acc)))) ))) )) (let (qsort xs cont) (cond ((= xs '()) (cont '())) (true (do (let h (head xs)) (let t (tail xs)) (let part_result (partition_rec t (lambda (x) (< x h)) '(() ()))) (qsort (head part_result) (lambda (ls) (qsort (snd part_result) (lambda (rs) (cont (+ ls (list h) rs)))))) )) ))```These all have to be done tail recursively or it could overflow.
gollark: Continuation passing style quicksort in a hilariously slow interpreter.
References
- "Most cited". Cambridge University Press. 2011. Retrieved 2011-01-28.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.