Inferencia gramatical para la detección de spam

El spam representa un problema de mala utilización de recursos técnicos y una molestia para los usuarios de correo electrónico. Tomando este problema como aplicación práctica, se pretende mostrar, con su justificación teórica, decisiones de diseño de un posible sistema inteligente destinado a controlarlo. El trabajo que se describe está actualmente en curso en el marco de un proyecto de investigación de la Universidad Nacional del Comahue.Eje: Inteligencia Computacional - MetaheurísticasRed de Universidades con Carreras en Informática (RedUNCI

Inferencia gramatical para la detección de spam

El spam representa un problema de mala utilización de recursos técnicos y una molestia para los usuarios de correo electrónico. Tomando este problema como aplicación práctica, se pretende mostrar, con su justificación teórica, decisiones de diseño de un posible sistema inteligente destinado a controlarlo. El trabajo que se describe está actualmente en curso en el marco de un proyecto de investigación de la Universidad Nacional del Comahue.Eje: Inteligencia Computacional - MetaheurísticasRed de Universidades con Carreras en Informática (RedUNCI

Practical experiments with regular approximation of context-free languages

Several methods are discussed that construct a finite automaton given a context-free grammar, including both methods that lead to subsets and those that lead to supersets of the original context-free language. Some of these methods of regular approximation are new, and some others are presented here in a more refined form with respect to existing literature. Practical experiments with the different methods of regular approximation are performed for spoken-language input: hypotheses from a speech recognizer are filtered through a finite automaton.Comment: 28 pages. To appear in Computational Linguistics 26(1), March 200

Dependency parsing with an extended finite-state approach

This article presents a dependency parsing scheme using an extended finite-state approach. The parser augments input representation with "channels" so that links representing syntactic dependency relations among words can be accommodated and iterates on the input a number of times to arrive at a fixed point. Intermediate configurations violating various constraints of projective dependency representations such as no crossing links and no independent items except sentential head are filtered via finite-state filters. We have applied the parser to dependency parsing of Turkish

From UBGs to CFGs A practical corpus-driven approach

We present a simple and intuitive unsound corpus-driven approximation method for turning unification-based grammars (UBGs), such as HPSG, CLE, or PATR-II into context-free grammars (CFGs). The method is unsound in that it does not generate a CFG whose language is a true superset of the language accepted by the original unification-based grammar. It is a corpus-driven method in that it relies on a corpus of parsed sentences and generates broader CFGs when given more input samples. Our open approach can be fine-tuned in different directions, allowing us to monotonically come close to the original parse trees by shifting more information into the context-free symbols. The approach has been fully implemented in JAVA. This report updates and extends the paper presented at the International Colloquium on Grammatical Inference (ICGI 2004) and presents further measurements