<?xml version="1.0" encoding="ISO-8859-1"?><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id>1870-9044</journal-id>
<journal-title><![CDATA[Polibits]]></journal-title>
<abbrev-journal-title><![CDATA[Polibits]]></abbrev-journal-title>
<issn>1870-9044</issn>
<publisher>
<publisher-name><![CDATA[Instituto Politécnico Nacional, Centro de Innovación y Desarrollo Tecnológico en Cómputo]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1870-90442008000200002</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[Natural Language Syntax Description using Generative Dependency Grammar]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Diaconescu]]></surname>
<given-names><![CDATA[&#350;tefan]]></given-names>
</name>
<xref ref-type="aff" rid="A01"/>
</contrib>
</contrib-group>
<aff id="A01">
<institution><![CDATA[,SOFTWIN SRL  ]]></institution>
<addr-line><![CDATA[Bucharest ]]></addr-line>
<country>Romania</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>12</month>
<year>2008</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>12</month>
<year>2008</year>
</pub-date>
<numero>38</numero>
<fpage>5</fpage>
<lpage>18</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1870-90442008000200002&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_abstract&amp;pid=S1870-90442008000200002&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_pdf&amp;pid=S1870-90442008000200002&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[The paper presents a practical solution to describe natural language syntax. This solution is based on a Generative Dependency Grammar (GDG). A theoretical definition of these grammars and some of their proprieties is given. GDG are implemented in a declarative computer language GRAALAN (Grammar Abstract Language). The paper shortly present the features of GRAALAN and, after that, a more detailed implementation of natural language syntax description is given. GRAALAN offers for natural language syntactic description some strong features that respond to the following requests: a compact description, the possibility to express the syntax and the agreement and to specify the errors met in a text. The description has also the feature of reversibility. The paper presents some conclusions concerning the using of GRAALAN to describe the syntax (among others natural language features).]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Dependency grammar]]></kwd>
<kwd lng="en"><![CDATA[natural language syntax]]></kwd>
</kwd-group>
</article-meta>
</front><body><![CDATA[  	    <p align="justify"><font face="verdana" size="4">Special section: natural language processing</font></p>  	    <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>  	    <p align="center"><font face="verdana" size="4"><b>Natural Language Syntax Description using Generative Dependency Grammar</b></font></p>  	    <p align="center"><font face="verdana" size="2">&nbsp;</font></p>  	    <p align="center"><font face="verdana" size="2"><b>&#350;tefan Diaconescu</b></font></p>  	    <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>  	    <p align="justify"><font face="verdana" size="2"><i>SOFTWIN SRL, Bucharest, Romania (email:</i> <a href="mailto:sdiaconescu@softwin.ro">sdiaconescu@softwin.ro</a><i>).</i></font></p>  	    <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>  	    <p align="justify"><font face="verdana" size="2">Manuscript received July 10, 2008.    ]]></body>
<body><![CDATA[<br> 	Manuscript accepted for publication October 20, 2008.</font></p>  	    <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>  	    <p align="justify"><font face="verdana" size="2"><b>Abstract</b></font></p>  	    <p align="justify"><font face="verdana" size="2">The paper presents a practical solution to describe natural language syntax. This solution is based on a Generative Dependency Grammar (GDG). A theoretical definition of these grammars and some of their proprieties is given. GDG are implemented in a declarative computer language GRAALAN (Grammar Abstract Language). The paper shortly present the features of GRAALAN and, after that, a more detailed implementation of natural language syntax description is given. GRAALAN offers for natural language syntactic description some strong features that respond to the following requests: a compact description, the possibility to express the syntax and the agreement and to specify the errors met in a text. The description has also the feature of reversibility. The paper presents some conclusions concerning the using of GRAALAN to describe the syntax (among others natural language features).</font></p>  	    <p align="justify"><font face="verdana" size="2"><b>Key words:</b> Dependency grammar, natural language syntax.</font></p>  	    <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>  	    <p align="justify"><font face="verdana" size="2"><a href="/pdf/poli/n38/n38a2.pdf" target="_blank">DESCARGAR ART&Iacute;CULO EN FORMATO PDF</a></font></p>  	    <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>  	    <p align="justify"><font face="verdana" size="2"><b>REFERENCES</b></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;1&#93; H. Alshawi, D. J. Arnold, R. Backofen, D. M. Carter, J. Lindop, K. Netter, S. G. Pulman, J. Tsujii, H. Uszkoreit. EurotraET6/1: Rule Formalism and Virtual Machine Study. Final Report. Commission of the European Communities, 1991.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6041040&pid=S1870-9044200800020000200001&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;2&#93; R. Backofen et al. EAGLES Formalism Working Group Final Report. Expert Advisory Group on Language Engineering Standards, 1996.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6041042&pid=S1870-9044200800020000200002&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;3&#93; S. Diaconescu. Natural Language Understanding Using Generative Dependency Grammar. In: M. Bramer, A. Preece and F. Coenen (Eds), <i>Twenty second SGAI International Conference on Knowledge Based</i> <i>Systems and Applied Artificial Intelligence,</i> pp.439&#150;452, Cambridge UK, Springer, 2002.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6041044&pid=S1870-9044200800020000200003&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;4&#93; S. Diaconescu. Morphological Categorization Attribute Value Trees and XML. In: M. A. Klopotek, S. T. Wierzchon, K. Trojanowski (Eds), <i>Intelligent Information Processing and Web Mining,</i> Proceedings of the International IIS: IIPWM'03 Conference, pp. 131&#150;138, Zakopane, Poland, Springer, 2003.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6041046&pid=S1870-9044200800020000200004&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;5&#93; S. Diaconescu. Natural Language Agreement Description for Reversible Grammars. In: T. D. Gedeon, L. C. C. Fung (Eds.), <i>Advances in Artificial Intelligence, 16<sup>th</sup> Australian Conference on AI,</i> pp. 161&#150;172, Perth, Australia, Springer, 2003.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6041048&pid=S1870-9044200800020000200005&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;6&#93; S. Diaconescu. Natural Language Processing Using Generative Indirect Dependency Grammar. In: M. A. Klopotek, S. T. Wierzchon, K. Trojanowski (Eds), <i>Intelligent Information Processing and Web Mining,</i> Proceedings of the International IIS, IIPWM'04 Conference, pp. 414418, Zakopane, Poland, Springer, 2004.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6041050&pid=S1870-9044200800020000200006&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;7&#93; S. Diaconescu. Multiword Expression Translation Using Generative Dependency Grammar. In: J. L. Vicedo, P. Martinez&#150;Barco, R. Mu&ntilde;oz, M. S. Noeda (Eds.), <i>Advances in Natural Language Processing,</i> Proceedings of 4th International Conference, ESTAL 2004, pp. 243&#150;254, Alicante, Spain, Springer, 2004.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6041052&pid=S1870-9044200800020000200007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;8&#93; S. Diaconescu. GRAALAN &#150; Grammar Abstract Language Basics. In: J. M. Jun, B. M. Bae, K. Y. Lee (Eds) <i>GESTS International Transaction on Computer Science and Engineering,    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6041054&pid=S1870-9044200800020000200008&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --></i> Vol.10, No.1: Sunjin Publishing Co., 2005.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6041055&pid=S1870-9044200800020000200009&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;9&#93; S. Diaconescu. Some Properties of the Attribute Value Trees Used for Linguistic Knowledge Representation. In: <i>2nd Indian International Conference on Artificial Intelligence (IICAI&#150;05),</i> Pune, INDIA, 2005.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6041057&pid=S1870-9044200800020000200010&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;10&#93; S. Diaconescu. Creation of the linguistic resources using a specialised language. (Crearea resurselor lingvistice cu ajutorul unui limbaj specializat), In C. For&#259;scu, D. Tufi&#351;., D. Cristea (Eds.), <i>Workshop on Linguistic resources and tools for Romanian Language Processing,</i> pp. 39&#150;44, Iassi, Romania, Editura Universit&#259;tii A. I. Cuza, 2006.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6041059&pid=S1870-9044200800020000200011&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    ]]></body>
<body><![CDATA[<!-- ref --><p align="justify"><font face="verdana" size="2">&#91;11&#93; S. Diaconescu. Complex Natural Language Processing System Architecture. In: Corneliu Burileanu, Horia&#150;Nicolai Teodorescu (Eds.), <i>Advances in Spoken Language Technology,</i> pp. 228&#150;240, Bucharest, Romania: The Publishing House of the Romanian Academy, 2007.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6041061&pid=S1870-9044200800020000200012&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;12&#93; EAGLES Formalism Working Group Final Report, Version of september 1996.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6041063&pid=S1870-9044200800020000200013&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;13&#93; IPA International Phonetic Association. Handbook of the International Phonetic Association, A Guide to the Use of the International Phonetic Alphabet. Cambridge, UK: Cambridge University Press, 2005.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6041065&pid=S1870-9044200800020000200014&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;14&#93; ISO/IEC 10646. Information technology &#150;&#150; Universal Multiple&#150;Octet Coded Character Set (UCS). Geneva, International Organization for Standardization, 1992.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6041067&pid=S1870-9044200800020000200015&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;15&#93; ISO 639 (E). Code for the representation of names of languages. Geneva, International Organization for Standardization, 1998.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6041069&pid=S1870-9044200800020000200016&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    ]]></body>
<body><![CDATA[<!-- ref --><p align="justify"><font face="verdana" size="2">&#91;16&#93; A. Joshi, L. Levi, L. Takabashi. Tree Adjunct Grammars. <i>Journal of the</i> <i>Computer and System Sciences,</i> 1975.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6041071&pid=S1870-9044200800020000200017&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;17&#93; C. Pollard, I. Sag. Head&#150;Driven Phrase Structure Grammar. Stanford: CSLI &amp; Chicago: U Chicago Press, 1994.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6041073&pid=S1870-9044200800020000200018&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;18&#93; S. Kahane. Grammaire d'Unification Sens&#150;Texte. Vers un mod&egrave;le math&eacute;matique articul&eacute; de la langue. Document de synth&egrave;se, Paris, France: Univ. Paris 7, 2002.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6041075&pid=S1870-9044200800020000200019&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;19&#93; R. Kaplan, J. Bresnan. Lexical Functional Grammar. A Formal System for Grammatical Representation. In: J. Bresnan (ed), <i>The Mental</i> <i>Representation of Grammatical Relations:</i> Massachusetts USA: MIT Press, 1982</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6041077&pid=S1870-9044200800020000200020&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">&#91;20&#93; J. Landsbergen. Isomorphic grammars and their use in the ROSETTA translation system. In: <i>Machine Translation Today: The State of the Art,</i> Edinburgh UK: Edinburgh University Press, 1987.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6041078&pid=S1870-9044200800020000200021&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;21&#93; L. Tesni&egrave;re. &Eacute;l&eacute;ments de syntaxe structurelle, Paris France: Klincksieck, 1959.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6041080&pid=S1870-9044200800020000200022&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;22&#93; W3C. Extensible Markup Language (XML) 1.0, Recommendation. 10&#150;Feb&#150;98, pp. 24&#150;25, 1998.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=6041082&pid=S1870-9044200800020000200023&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>  	    <p align="justify"><font face="verdana" size="2"><b>NOTE</b></font></p>  	    <p align="justify"><font face="verdana" size="2">This work was supported in part by SOFTWIN SRL, Bucharest, Romania.</font></p>      ]]></body><back>
<ref-list>
<ref id="B1">
<label>1</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Alshawi]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Arnold]]></surname>
<given-names><![CDATA[D. J.]]></given-names>
</name>
<name>
<surname><![CDATA[Backofen]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Carter]]></surname>
<given-names><![CDATA[D. M.]]></given-names>
</name>
<name>
<surname><![CDATA[Lindop]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Netter]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Pulman]]></surname>
<given-names><![CDATA[S. G.]]></given-names>
</name>
<name>
<surname><![CDATA[Tsujii]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Uszkoreit]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<source><![CDATA[EurotraET6/1: Rule Formalism and Virtual Machine Study]]></source>
<year>1991</year>
<publisher-name><![CDATA[Commission of the European Communities]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B2">
<label>2</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Backofen]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<source><![CDATA[EAGLES Formalism Working Group Final Report]]></source>
<year>1996</year>
<publisher-name><![CDATA[Expert Advisory Group on Language Engineering Standards]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B3">
<label>3</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Diaconescu]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Natural Language Understanding Using Generative Dependency Grammar]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Bramer]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Preece]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Coenen]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<source><![CDATA[]]></source>
<year></year>
<conf-name><![CDATA[Twenty second SGAI International Conference on Knowledge Based Systems and Applied Artificial Intelligence]]></conf-name>
<conf-date>2002</conf-date>
<conf-loc>Cambridge </conf-loc>
</nlm-citation>
</ref>
<ref id="B4">
<label>4</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Diaconescu]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Morphological Categorization Attribute Value Trees and XML]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Klopotek]]></surname>
<given-names><![CDATA[M. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Wierzchon]]></surname>
<given-names><![CDATA[S. T.]]></given-names>
</name>
<name>
<surname><![CDATA[Trojanowski]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
</person-group>
<source><![CDATA[Intelligent Information Processing and Web Mining]]></source>
<year></year>
<conf-name><![CDATA[ Proceedings of the International IIS: IIPWM'03 Conference]]></conf-name>
<conf-date>2003</conf-date>
<conf-loc>Zakopane </conf-loc>
</nlm-citation>
</ref>
<ref id="B5">
<label>5</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Diaconescu]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Natural Language Agreement Description for Reversible Grammars]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Gedeon]]></surname>
<given-names><![CDATA[T. D.]]></given-names>
</name>
<name>
<surname><![CDATA[Fung]]></surname>
<given-names><![CDATA[L. C. C.]]></given-names>
</name>
</person-group>
<source><![CDATA[Advances in Artificial Intelligence]]></source>
<year></year>
<conf-name><![CDATA[16 Australian Conference on AI]]></conf-name>
<conf-date>2003</conf-date>
<conf-loc>Perth </conf-loc>
</nlm-citation>
</ref>
<ref id="B6">
<label>6</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Diaconescu]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Natural Language Processing Using Generative Indirect Dependency Grammar]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Klopotek]]></surname>
<given-names><![CDATA[M. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Wierzchon]]></surname>
<given-names><![CDATA[S. T.]]></given-names>
</name>
<name>
<surname><![CDATA[Trojanowski]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
</person-group>
<source><![CDATA[Intelligent Information Processing and Web Mining]]></source>
<year></year>
<conf-name><![CDATA[ Proceedings of the International IIS, IIPWM'04 Conference]]></conf-name>
<conf-date>2004</conf-date>
<conf-loc>Zakopane </conf-loc>
</nlm-citation>
</ref>
<ref id="B7">
<label>7</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Diaconescu]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Multiword Expression Translation Using Generative Dependency Grammar]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Vicedo]]></surname>
<given-names><![CDATA[J. L.]]></given-names>
</name>
<name>
<surname><![CDATA[Martinez-Barco]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Muñoz]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Noeda]]></surname>
<given-names><![CDATA[M. S.]]></given-names>
</name>
</person-group>
<source><![CDATA[Advances in Natural Language Processing]]></source>
<year></year>
<conf-name><![CDATA[4 International Conference, ESTAL 2004]]></conf-name>
<conf-date>2004</conf-date>
<conf-loc>Alicante </conf-loc>
</nlm-citation>
</ref>
<ref id="B8">
<label>8</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Diaconescu]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[GRAALAN - Grammar Abstract Language Basics]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Jun]]></surname>
<given-names><![CDATA[J. M.]]></given-names>
</name>
<name>
<surname><![CDATA[Bae]]></surname>
<given-names><![CDATA[B. M.]]></given-names>
</name>
<name>
<surname><![CDATA[Lee]]></surname>
<given-names><![CDATA[K. Y.]]></given-names>
</name>
</person-group>
<source><![CDATA[]]></source>
<year></year>
</nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="journal">
<source><![CDATA[GESTS International Transaction on Computer Science and Engineering]]></source>
<year>2005</year>
<volume>10</volume>
<numero>1</numero>
<issue>1</issue>
<publisher-name><![CDATA[Sunjin Publishing Co.]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B10">
<label>9</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Diaconescu]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Some Properties of the Attribute Value Trees Used for Linguistic Knowledge Representation]]></article-title>
<source><![CDATA[]]></source>
<year></year>
<conf-name><![CDATA[2 Indian International Conference on Artificial Intelligence (IICAI-05)]]></conf-name>
<conf-date>2005</conf-date>
<conf-loc>Pune </conf-loc>
</nlm-citation>
</ref>
<ref id="B11">
<label>10</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Diaconescu]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Creation of the linguistic resources using a specialised language. (Crearea resurselor lingvistice cu ajutorul unui limbaj specializat)]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[For&#259;scu]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Tufi&#351;]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Cristea]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Cuza]]></surname>
<given-names><![CDATA[A. I.]]></given-names>
</name>
</person-group>
<source><![CDATA[Workshop on Linguistic resources and tools for Romanian Language Processing]]></source>
<year>2006</year>
<page-range>39-44</page-range><publisher-loc><![CDATA[Iassi ]]></publisher-loc>
<publisher-name><![CDATA[Editura Universit&#259;tii]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B12">
<label>11</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Diaconescu]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Complex Natural Language Processing System Architecture]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Burileanu]]></surname>
<given-names><![CDATA[Corneliu]]></given-names>
</name>
<name>
<surname><![CDATA[Teodorescu]]></surname>
<given-names><![CDATA[Horia-Nicolai]]></given-names>
</name>
</person-group>
<source><![CDATA[Advances in Spoken Language Technology]]></source>
<year>2007</year>
<page-range>228-240</page-range><publisher-loc><![CDATA[Bucharest ]]></publisher-loc>
<publisher-name><![CDATA[The Publishing House of the Romanian Academy]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B13">
<label>12</label><nlm-citation citation-type="">
<collab>EAGLES</collab>
<source><![CDATA[Formalism Working Group Final Report]]></source>
<year>sept</year>
<month>em</month>
<day>be</day>
</nlm-citation>
</ref>
<ref id="B14">
<label>13</label><nlm-citation citation-type="book">
<collab>International Phonetic Association</collab>
<source><![CDATA[Handbook of the International Phonetic Association, A Guide to the Use of the International Phonetic Alphabet]]></source>
<year>2005</year>
<publisher-loc><![CDATA[Cambridge ]]></publisher-loc>
<publisher-name><![CDATA[Cambridge University Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B15">
<label>14</label><nlm-citation citation-type="book">
<source><![CDATA[ISO/IEC 10646. Information technology -- Universal Multiple-Octet Coded Character Set (UCS)]]></source>
<year>1992</year>
<publisher-loc><![CDATA[Geneva ]]></publisher-loc>
<publisher-name><![CDATA[International Organization for Standardization]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B16">
<label>15</label><nlm-citation citation-type="book">
<source><![CDATA[ISO 639 (E). Code for the representation of names of languages]]></source>
<year>1998</year>
<publisher-loc><![CDATA[Geneva ]]></publisher-loc>
<publisher-name><![CDATA[International Organization for Standardization]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B17">
<label>16</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Joshi]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Levi]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Takabashi]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Tree Adjunct Grammars]]></article-title>
<source><![CDATA[Journal of the Computer and System Sciences]]></source>
<year>1975</year>
</nlm-citation>
</ref>
<ref id="B18">
<label>17</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pollard]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Sag]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
</person-group>
<source><![CDATA[Head-Driven Phrase Structure Grammar]]></source>
<year>1994</year>
<publisher-loc><![CDATA[Stanford ]]></publisher-loc>
<publisher-name><![CDATA[CSLI & ChicagoU Chicago Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B19">
<label>18</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kahane]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<source><![CDATA[Grammaire d'Unification Sens-Texte. Vers un modèle mathématique articulé de la langue. Document de synthèse]]></source>
<year>2002</year>
<publisher-loc><![CDATA[Paris ]]></publisher-loc>
<publisher-name><![CDATA[Univ. Paris]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B20">
<label>19</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kaplan]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Bresnan]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Lexical Functional Grammar. A Formal System for Grammatical Representation]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Bresnan]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[The Mental Representation of Grammatical Relations]]></source>
<year>1982</year>
<publisher-loc><![CDATA[^eMassachusetts Massachusetts]]></publisher-loc>
<publisher-name><![CDATA[MIT Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B21">
<label>20</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Landsbergen]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Isomorphic grammars and their use in the ROSETTA translation system]]></article-title>
<source><![CDATA[Machine Translation Today: The State of the Art]]></source>
<year>1987</year>
<publisher-loc><![CDATA[Edinburgh ]]></publisher-loc>
<publisher-name><![CDATA[Edinburgh University Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B22">
<label>21</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Tesnière]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
</person-group>
<source><![CDATA[Éléments de syntaxe structurelle]]></source>
<year>1959</year>
<publisher-loc><![CDATA[Paris ]]></publisher-loc>
<publisher-name><![CDATA[Klincksieck]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B23">
<label>22</label><nlm-citation citation-type="">
<source><![CDATA[W3C. Extensible Markup Language (XML) 1.0, Recommendation]]></source>
<year>10-F</year>
<month>eb</month>
<day>-9</day>
<page-range>24-25</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
