Sciweavers

2750 search results - page 10 / 550
» Learning Efficient Parsing
Sort
View
EACL
2006
ACL Anthology
13 years 10 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
ICWS
2008
IEEE
13 years 10 months ago
High-Performance XML Parsing and Validation with Permutation Phrase Grammar Parsers
The extensibility, flexibility, expressiveness, and platform-neutrality of XML delivers key advantages for interoperability. The interoperability of XML Web services often comes a...
Wei Zhang, Robert A. van Engelen
DCC
1999
IEEE
14 years 27 days ago
The Effect of Flexible Parsing for Dynamic Dictionary Based Data Compression
We report on the performance evaluation of greedy parsing with a single step lookahead, denoted as flexible parsing. We also introduce a new fingerprint based data structure which...
Yossi Matias, Nasir Rajpoot, Süleyman Cenk Sa...
AAAI
2007
13 years 11 months ago
Ungreedy Methods for Chinese Deterministic Dependency Parsing
Deterministic dependency parsing has often been regarded as an efficient parsing algorithm while its parsing accuracy is a little lower than the best results reported by more comp...
Xiangyu Duan, Jun Zhao, Bo Xu
EMNLP
2008
13 years 10 months ago
Better Binarization for the CKY Parsing
We present a study on how grammar binarization empirically affects the efficiency of the CKY parsing. We argue that binarizations affect parsing efficiency primarily by affecting ...
Xinying Song, Shilin Ding, Chin-Yew Lin