<?xml version="1.0" encoding="UTF-8"?>

<rdf:RDF
   xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
   xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#"
   xmlns="http://purl.org/rss/1.0/"
   xmlns:dc="http://purl.org/dc/elements/1.1/"
   xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/"
   xmlns:dcterms="http://purl.org/dc/terms/"

>
<channel rdf:about="http://www.citeulike.org/about">
<pubDate>Thu, 21 Aug 2008 07:22:28 BST</pubDate>


	<title>CiteULike: zeichnendes language</title>
	<description>CiteULike: zeichnendes language</description>


	<link>http://www.citeulike.org/user/zeichnendes/tag/language</link>
	<dc:publisher>CiteULike.org</dc:publisher>
	<dc:language>en-gb</dc:language>
	<dc:rights>Copyright &#169; 2004-2008 citeulike.org</dc:rights>
	<items>
    <rdf:Seq>
        <rdf:li rdf:resource="http://www.citeulike.org/user/zeichnendes/article/158531"/>

	</rdf:Seq>
	</items>
	</channel>


<item rdf:about="http://www.citeulike.org/user/zeichnendes/article/158531">
    <title>Three models for the description of language</title>
    <link>http://www.citeulike.org/user/zeichnendes/article/158531</link>
    <description>&lt;i&gt;Information Theory, IEEE Transactions on, Vol. 2, No. 3. (1956), pp. 113-124.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;We investigate several conceptions of linguistic structure to determine whether or not they can provide simple and &#34;revealing&#34; grammars that generate all of the sentences of English and only these. We find that no finite-state Markov process that produces symbols with transition from state to state can serve as an English grammar. Furthermore, the particular subclass of such processes that produce&#60;tex&#62;n&#60;/tex&#62;-order statistical approximations to English do not come closer, with increasing&#60;tex&#62;n&#60;/tex&#62;, to matching the output of an English grammar. We formalize-the notions of &#34;phrase structure&#34; and show that this gives us a method for describing language which is essentially more powerful, though still representable as a rather elementary type of finite-state process. Nevertheless, it is successful only when limited to a small subset of simple sentences. We study the formal properties of a set of grammatical transformations that carry sentences with phrase structure into new sentences with derived phrase structure, showing that transformational grammars are processes of the same elementary type as phrase-structure grammars; that the grammar of English is materially simplified if phrase structure description is limited to a kernel of simple sentences from which all other sentences are constructed by repeated transformations; and that this view of linguistic structure gives a certain insight into the use and understanding of language.</description>
    <dc:title>Three models for the description of language</dc:title>

    <dc:creator>N Chomsky</dc:creator>
    <dc:source>Information Theory, IEEE Transactions on, Vol. 2, No. 3. (1956), pp. 113-124.</dc:source>
    <dc:date>2005-04-11T17:57:26-00:00</dc:date>
    <prism:publicationYear>1956</prism:publicationYear>
    <prism:publicationName>Information Theory, IEEE Transactions on</prism:publicationName>
    <prism:volume>2</prism:volume>
    <prism:number>3</prism:number>
    <prism:startingPage>113</prism:startingPage>
    <prism:endingPage>124</prism:endingPage>
    <prism:category>cfg</prism:category>
    <prism:category>cs</prism:category>
    <prism:category>fsm</prism:category>
    <prism:category>grammar</prism:category>
    <prism:category>language</prism:category>
    <prism:category>linguistics</prism:category>
</item>



</rdf:RDF>

