21.04.2013 Views

Eckhard Bick - VISL

Eckhard Bick - VISL

Eckhard Bick - VISL

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

4.6 The transformational potential of CG<br />

4.6.1 Exploiting word based tag notation with string manipulation<br />

tools<br />

Technically, a Constraint Grammar rule can be regarded as a context dependent string<br />

manipulation command to be executed by a computer on an ambiguously tagged<br />

sentence. A whole sentence with all its words and tags could be written as one long line<br />

of text, and a given CG rule could then be rewritten as an awk or perl language<br />

substitution rule (s/.../..../g), using so called regular expressions to express optional or<br />

dummy string segments, or to bracket-mark a string of characters for conditioned<br />

deletion, repetition or movement. Thus, information from different levels of analysis<br />

(morphology, syntax, semantics etc.), both form and function, can be represented in the<br />

same formalism, and interact in transparent, string-based disambiguation process.<br />

It seems only logical, after disambiguation, to go a step further and exploit the<br />

text-tool friendliness of the tagging notation for other purposes, like corpus searches,<br />

information extraction, IT-based grammar teaching and the like. All of the application<br />

examples mentioned are about identifying, extracting and standardising string chunks<br />

from a text context. Common UNIX tools like grep in conjunction with substitution<br />

commands will do the job, and are, in fact, used at the applicational front end of my<br />

parser. In theory, however, the CG-formalism itself could be applied to the same end.<br />

The mapping operator, for example, could be used to mark corpus occurrences of<br />

certain linguistic patterns (1a), which could then be extracted by a chained grepcommand.<br />

A replace operator, as suggested in (Tapanainen, 1996), though non-existent<br />

in the cg1-compiler and inflexible in cg2, could complement the mapping operator and<br />

be used for notational standardisation (1b).<br />

(1a) MAP (@EXAMPLE) TARGET (@#ICL-SUBJ>) (*-1 @SUBJ> BARRIER NON-ADV LINK<br />

0 N) ; # Find an example of: a non-finite subclause functioning as subject that itself has a<br />

subject noun, preceding the main verb with nothing but adverbs in between<br />

(1b) REPLACE (KS) TARGET ("quando" ADV) IF (0 @#FS) ; # Replace the relative<br />

adverbial reading of "quando" by a subordination conjunction reading if the word heads a finite<br />

subclause<br />

4.6.2 Theory dependent tag filters<br />

One of the most recalcitrant problems of grammatical analysis, in both corpus<br />

annotation and grammar teaching, is - from a practical point of view - the simple fact of<br />

- 341 -

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

Saved successfully!

Ooh no, something went wrong!