The Constraint Dependency Grammar SoftwareIntroductionThe WCDG-System is based on the Weighted Constraint Dependency Grammar formalism which describes natural language exclusively as dependency structure, i.e. ordered, labeled pairs of words in the input text. It performs natural language analysis under the paradigm of constraint optimization, where the analysis that best conforms to all rules of the grammar is returned. The rules are explicit descriptions of well-formed tree structures, allowing a modular and fine grained description of grammatical knowledge. In general these constraints are defeasible, since many rules about language are not absolute, but can be preempted by more important rules. The strength of constraining information is controlled by the grammar writer: fundamental rules must always hold, principles of different import have to be weighted against each other and general preferences that only take effect when no other disambiguating knowledge is available can be formulated in a uniform way.Features
News2012-03-08: Java Reimplementation Released!For the last few months we, NielsBeuck and ArneKoehn, have worked on a reimplementation of cdg in Java, called jwcdg. This work is now usable (but doesn't contain all the features of cdg). The following things are missing in jwcdg at the moment:
2011-03-23: New Version ReleasedWe are proud to present the newest version of CDG. Version 0.97 features:
ContactWolfgang MenzelNatural Language Systems Department of Computer Science University of Hamburg Vogt-Kölln-Straße 30 22527 Hamburg _email1 | |