Sciweavers

243 search results - page 15 / 49
» Error Mining in Parsing Results
Sort
View
ACL
2006
14 years 11 months ago
Multi-Tagging for Lexicalized-Grammar Parsing
With performance above 97% accuracy for newspaper text, part of speech (POS) tagging might be considered a solved problem. Previous studies have shown that allowing the parser to ...
James R. Curran, Stephen Clark, David Vadas
ACL
2008
14 years 11 months ago
Unlexicalised Hidden Variable Models of Split Dependency Grammars
This paper investigates transforms of split dependency grammars into unlexicalised context-free grammars annotated with hidden symbols. Our best unlexicalised grammar achieves an ...
Gabriele Antonio Musillo, Paola Merlo
ACL
2004
14 years 11 months ago
Deep Dependencies from Context-Free Statistical Parsers: Correcting the Surface Dependency Approximation
We present a linguistically-motivated algorithm for reconstructing nonlocal dependency in broad-coverage context-free parse trees derived from treebanks. We use an algorithm based...
Roger Levy, Christopher D. Manning
PKDD
2009
Springer
88views Data Mining» more  PKDD 2009»
15 years 4 months ago
Feature Weighting Using Margin and Radius Based Error Bound Optimization in SVMs
The Support Vector Machine error bound is a function of the margin and radius. Standard SVM algorithms maximize the margin within a given feature space, therefore the radius is fi...
Huyen Do, Alexandros Kalousis, Melanie Hilario
SIGSOFT
2007
ACM
15 years 10 months ago
Training on errors experiment to detect fault-prone software modules by spam filter
The fault-prone module detection in source code is of importance for assurance of software quality. Most of previous fault-prone detection approaches are based on software metrics...
Osamu Mizuno, Tohru Kikuno