Constraint grammar as a framework for parsing running text

摘要: 1. Outline Grammars which are used in parsers often directly imported from autonomous grammar theory and descriptive practice that were not exercised for the explicit purpose of parsing. Parsers have been designed English based on e.g. Government Binding Theory, Generalized Phrase Structure Grammar, LexicaI-Functional Grammar. We present a formalism to be parsing where statements closer real text sentences more address some notorious problems, especially ambiguity. The is linguistic one. It relies transitional probabilities an indirect way. part description. statements, constraints, do ordinary task defining notion 'correct sentence L'. They less categorical nature, closely tied morphological features, geared towards basic see this as one inferring surface structure stream concrete tokens basically bottom-up mode. Constraints formulated basis extensive corpus studies. may reflect absolute, ruleqike facts, or probabilistic tendencies certain risk judged proper take. former rule-like type course preferable. ensemble constraints language L constitute Constraint Grammar (CG) L. A CG intended by Parser CGP, implemented Lisp interpreter. Our input CGP morphologically analyzed word-forms. One central idea maximize use information purposes. All relevant assigned via lexicon, morphology, simple mappings morphology syntax. ]he discard many alternatives possible, optimum being fully disambiguated with syntactic reading only. second treat disambiguation labelling same mechanism discarding improper alternatives.