Sciweavers

213 search results - page 1 / 43
» Experiments with Learning Parsing Heuristics
Sort
View
ACL
1998
13 years 6 months ago
Experiments with Learning Parsing Heuristics
Any large language processing software relies in its operation on heuristic decisions concerning the strategy of processing. These decisions are usually "hard-wired" int...
Sylvain Delisle, Sylvain Létourneau, Stan M...
TSD
2009
Springer
13 years 11 months ago
Intraclausal Coordination and Clause Detection as a Preprocessing Step to Dependency Parsing
Abstract. The impact of clause and intraclausal coordination detection to dependency parsing of Slovene is examined. New methods based on machine learning and heuristic rules are p...
Domen Marincic, Matjaz Gams, Tomaz Sef
EACL
2006
ACL Anthology
13 years 6 months ago
Online Learning of Approximate Dependency Parsing Algorithms
In this paper we extend the maximum spanning tree (MST) dependency parsing framework of McDonald et al. (2005c) to incorporate higher-order feature representations and allow depen...
Ryan T. McDonald, Fernando C. N. Pereira
ACL
2009
13 years 2 months ago
Bayesian Learning of a Tree Substitution Grammar
Tree substitution grammars (TSGs) offer many advantages over context-free grammars (CFGs), but are hard to learn. Past approaches have resorted to heuristics. In this paper, we le...
Matt Post, Daniel Gildea