<?xml version="1.0" standalone="yes"?>
<Paper uid="C94-2146">
  <Title>A GRAMMAR BASED APPROACH TO A GRAMMAR CHECKING OF FREE WORD ORDER LANGUAGES</Title>
  <Section position="4" start_page="908" end_page="909" type="concl">
    <SectionTitle>
3. CONCLUSION
</SectionTitle>
    <Paragraph position="0"> In the previous paragraphs we have sketched tile specifications li)r a grammar based grammar checker lk)r a free word order language, as it is viewed from the perspective o1' our approach to the project I,ATESI,AV. The main goal of the project is to develop a methodology of solving tire problem of &amp;quot;grammar based&amp;quot; grammar checking of relevant languages. We hope that the ideas presented in the paper nmy hell ) us to achieve this goal successfully.</Paragraph>
    <Paragraph position="1"> The paper shows that it is possible to make a clear distinction between two parts of the grammar checker, namely line part (automaton P) which is based on rnJcs which describe correct subparts of a given inpul sentence and therefore is very close to a standard dependency syntactic parsing, and between the part (automaton N) which is based on rules which are to a great extent similar to the rules used in standard &amp;quot;pattern based&amp;quot; approach to grammar checking. The combination of these two parts provides a tool more powerful (in the formal sense) than if both approaches are applied m isolation.</Paragraph>
    <Paragraph position="2"> The architecture of the system also makes it possible to re-use the existing linguistic knowledge about the computational grammar of Czech. 11 also allows to divide the enormous task of ilnplementalion of a grammar checker in smaller specialized subparts (c.g. rules for 1 ) and N), which may be deveh)ped independently.</Paragraph>
    <Paragraph position="3"> As shown in \[41, similar specifications, based on the slune principle, can also be used in the area of robust syntactic i)arsing.</Paragraph>
  </Section>
class="xml-element"></Paper>