<?xml version="1.0" standalone="yes"?>
<Paper uid="W98-1231">
  <Title>Shallow Post Morphological Processing with KURD</Title>
  <Section position="18" start_page="0" end_page="0" type="concl">
    <SectionTitle>
8 Conclusion
</SectionTitle>
    <Paragraph position="0"> In this paper we have presented a constraint-based formalism (KURD) that manipulates morphological analysis in order to kill, unify, replace or delete parts of the structure. The formalism reafizes a pattern matching approach that is suitable for shallow and/or partial NLP.</Paragraph>
    <Paragraph position="1"> First, we give a formal definition of the data structure and of the formalism and discuss a few example rules in order to present the capacities of the formalism.</Paragraph>
    <Paragraph position="2"> KURD is then compared to another slmilax formalism (CGP) and it is found that both formalisms have a comparable expressiveness.</Paragraph>
    <Paragraph position="3"> Whereas in KURD the use of variables and markers makes the rule writing easier, CGP allows for the simplification of rules by means of sets or the clause boundary mode.</Paragraph>
    <Paragraph position="4"> Two applications of KURD axe presented. In two laxge-scale experiments it could be shown that style-checking can be realized by KURD with a reasonable result. In a small experiment it is shown that KURD can be used for shallow parsing and refinement in a MT application.</Paragraph>
  </Section>
class="xml-element"></Paper>