Karl-Michael Schneider


2004

pdf bib
A New Feature Selection Score for Multinomial Naive Bayes Text Classification Based on KL-Divergence
Karl-Michael Schneider
Proceedings of the ACL Interactive Poster and Demonstration Sessions

2003

pdf bib
A Comparison of Event Models for Naive Bayes Anti-Spam E-Mail Filtering
Karl-Michael Schneider
10th Conference of the European Chapter of the Association for Computational Linguistics

2000

pdf bib
Parsing Schemata for Grammars with Variable Number and Order of Constituents
Karl-Michael Schneider
COLING 2000 Volume 2: The 18th International Conference on Computational Linguistics

pdf bib
Algebraic Construction of Parsing Schemata
Karl-Michael Schneider
Proceedings of the Sixth International Workshop on Parsing Technologies

We propose an algebraic method for the design of tabular parsing algorithms which uses parsing schemata [7]. The parsing strategy is expressed in a tree algebra. A parsing schema is derived from the tree algebra by means of algebraic operations such as homomorphic images, direct products, subalgebras and quotient algebras. The latter yields a tabular interpretation of the parsing strategy. The proposed method allows simpler and more elegant correctness proofs by using general theorems and is not limited to left-right parsing strategies, unlike current automaton-based approaches. Furthermore, it allows to derive parsing schemata for linear indexed grammars (LIG) from parsing schemata for context-free grammars by means of a correctness preserving algebraic transformation. A new bottom-up head corner parsing schema for LIG is constructed to demonstrate the method.
Search
Co-authors