The paper describes an application-oriented system that corrects agreement errors. In order to correct a sentence with such errors, an extended morphological structure is created ...
The (unweighted) Maximum Satisfiability problem (MaxSat) is: given a boolean formula in conjunctive normal form, find a truth assignment that satisfies the most number of clauses....
The number of documents published via WWW in form of SGML/HTML has been rapidly growing for years. Efficient, declarative access mechanisms for this type of documents