26.06.2015 Views

url?sa=t&source=web&cd=4&ved=0CCAQFjAD&url=http://data.ulis.vnu.edu.vn/jspui/bitstream/123456789/1966/1/54_1405152974

url?sa=t&source=web&cd=4&ved=0CCAQFjAD&url=http://data.ulis.vnu.edu.vn/jspui/bitstream/123456789/1966/1/54_1405152974

url?sa=t&source=web&cd=4&ved=0CCAQFjAD&url=http://data.ulis.vnu.edu.vn/jspui/bitstream/123456789/1966/1/54_1405152974

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

autosegmental phonology 45<br />

theoretical and computational linguistics as part of the frame of reference<br />

for classifying languages which can be formally generated (see Chomsky hierarchy).<br />

Automata (such as computers) can be modelled in abstract terms as a<br />

series of inputs, outputs, states, and rules of operation. They typically perform<br />

operations on an input tape by moving through a series of ‘states’ (or ‘configurations’),<br />

each state being linked to the next by a ‘transition function’. The most<br />

general automata are known as ‘Turing machines’ (named after British mathematician<br />

Alan Mathison Turing (1912–<strong>54</strong>), who in 1936 devised a logical<br />

machine which defined computable numbers by working in this way). The most<br />

restricted kinds of automata are finite automata (also called ‘Markov sources’ or<br />

‘simple transition networks’), which consist of a finite number of states and<br />

state-transitions, and an input tape which can be read only in one direction, one<br />

symbol at a time. finite-state languages can be recognized by finite state<br />

automata.<br />

autonomous (adj.) (1) A term often used in discussing the status of linguistics<br />

as a science: the implication is that the subject of language is now studied in its<br />

own terms, no longer being dependent on the incidental interest of scholars<br />

from other disciplines, such as logic, literary criticism, or history. The autonomy<br />

of the subject is seen in the emergence, during the second half of the twentieth<br />

century, of a wide range of degree courses in linguistics.<br />

(2) In phonology, the term is used to characterize the notion of a phoneme<br />

when no reference is made to its relationships with grammatical (especially<br />

word) structure. The autonomous phoneme, in this sense, is contrasted<br />

with the morphophoneme, or the systematic phoneme of generative<br />

linguistics, where other factors than the strictly phonemic are allowed into the<br />

analysis.<br />

(3) Autonomous syntax is the view propounded by the standard theory<br />

of generative grammar that the syntactic component of the grammar is<br />

independent (‘autonomous’) of semantics, i.e. the factors which determine<br />

the grammaticality of a sentence operate without reference to those which<br />

determine the sentence’s meaning. For example, the sentence Colo<strong>url</strong>ess green<br />

ideas sleep furiously is semantically ill formed but syntactically well formed.<br />

This view was attacked in generative semantics, but prevails in modern<br />

linguistic theory.<br />

autonomous grid<br />

see metrical grid<br />

autonomous speech<br />

see idioglossia<br />

autosegment (n.) A term used in autosegmental phonology for a segment<br />

considered to be autonomous and represented on its own tier. The notion<br />

is applied particularly to tones, which are viewed as segments in their own<br />

right, independent of the consonant and vowel segments represented on the<br />

skeletal tier.<br />

autosegmental phonology A term used in phonological theory to refer to an<br />

approach which contrasts with strictly segmental theories of phonology. The<br />

segmental approach is seen as a set of representations which consist of a

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!