Sciweavers

1229 search results - page 16 / 246
» A New Method for Dependent Parsing
Sort
View
ACL
1996
13 years 9 months ago
The Selection of the Most Probable Dependency Structure in Japanese Using Mutual Information
We use a statistical method to select the most probable structure or parse for a given sentence. It takes as input the dependency structures generated for the sentence by a depend...
Eduardo de Paiva Alves
INTERSPEECH
2010
13 years 2 months ago
Memory-based active learning for French broadcast news
Stochastic dependency parsers can achieve very good results when they are trained on large corpora that have been manually annotated. Active learning is a procedure that aims at r...
Frédéric Tantini, Christophe Cerisar...
CC
1999
Springer
154views System Software» more  CC 1999»
13 years 12 months ago
Faster Generalized LR Parsing
Tomita devised a method of generalized LR GLR parsing to parse ambiguous grammars e ciently. A GLR parser uses linear-time LR parsing techniques as long as possible, falling back...
John Aycock, R. Nigel Horspool
AI
2009
Springer
13 years 11 months ago
Executable Specifications of Fully General Attribute Grammars with Ambiguity and Left-Recursion
Abstract. A top-down parsing algorithm has been constructed to accommodate any form of ambiguous context-free grammar, augmented with semantic rules with arbitrary attribute depend...
Rahmatullah Hafiz
ACL
2003
13 years 9 months ago
Fast Methods for Kernel-Based Text Analysis
Kernel-based learning (e.g., Support Vector Machines) has been successfully applied to many hard problems in Natural Language Processing (NLP). In NLP, although feature combinatio...
Taku Kudo, Yuji Matsumoto