Résumé
In this paper we investigate the possibility of a syntax- semantics inferface between a framework for Model-Theoretic Syntax on one hand and a semantic network on the other hand. We focus on exploring the ability of such a pairing to solve a collection of grammar checking problems, with an emphasis on cases of missing words. We dis- cuss a solution where constraint violations are interpreted as grammar errors and yield the re-generation of new candidate parses (partially un- realised) through tree operations. Follows a surface realisation phase, where missing words are filled through semantic network exploration.