View article

Lottg alld eolni) licated seltteltces prov (: to b (: a. stumbling block for current systems relying on N [, input. These systenls stand to gaill frolil ntethods that syntacti<: aHy sim-plily su<: h sentences.'] b simplify a sen= tence, we nee< t an idea of tit (." structure of the sentence, to identify the<: omponents to be separated out. Obviously a parser couhl be used to obtain the complete structure of the sentence.][owever, hill parsing is slow a+ nd i) rone to fa. ilure, especially on<: omph! x sentences. In this l) aper, we consider two alternatives to fu] l parsing which could be use< l for simplification. The tirst al) l) roach uses a Finite State Grammar (FSG) to prodn<: e noun and verb groups while the second uses a Superta. gging model to i) roduce dependency linkages. We discuss the impact of these two input representations on the simplification pro (: ess.