Sciweavers

675 search results - page 21 / 135
» On Compression of Parse Trees
Sort
View
SIGCSE
1997
ACM
158views Education» more  SIGCSE 1997»
13 years 11 months ago
A collection of tools for making automata theory and formal languages come alive
We present a collection of new and enhanced tools for experimenting with concepts in formal languages and automata theory. New tools, written in Java, include JFLAP for creating a...
Susan H. Rodger, Anna O. Bilska, Kenneth H. Leider...
AI
2002
Springer
13 years 7 months ago
A Constructive Approach to Parsing with Neural Networks - The Hybrid Connectionist Parsing Method
The concept of Dynamic Neural Networks (DNN) is a new approach within the Neural Network paradigm, which is based on the dynamic construction of Neural Networks during the processi...
Christel Kemke
EMNLP
2009
13 years 5 months ago
Improving Dependency Parsing with Subtrees from Auto-Parsed Data
This paper presents a simple and effective approach to improve dependency parsing by using subtrees from auto-parsed data. First, we use a baseline parser to parse large-scale una...
Wenliang Chen, Jun'ichi Kazama, Kiyotaka Uchimoto,...
ICONIP
2007
13 years 9 months ago
Classification of Documents Based on the Structure of Their DOM Trees
In this paper, we discuss kernels that can be applied for the classification of XML documents based on their DOM trees. DOM trees are ordered trees in which every node might be la...
Peter Geibel, Olga Pustylnikov, Alexander Mehler, ...
EMNLP
2007
13 years 9 months ago
A Constraint Satisfaction Approach to Dependency Parsing
We present an adaptation of constraint satisfaction inference (Canisius et al., 2006b) for predicting dependency trees. Three different classifiers are trained to predict weighte...
Sander Canisius, Erik Tjong Kim Sang