ACL
2010
14 years 10 days ago
2010
We show that using confidence-weighted classification in transition-based parsing gives results comparable to using SVMs with faster training and parsing time. We also compare wit...
ACL
2010
14 years 10 days ago
2010
Nivre's method was improved by enhancing deterministic dependency parsing through application of a tree-based model. The model considers all words necessary for selection of ...
ACL
2010
14 years 10 days ago
2010
This paper explores joint syntactic and semantic parsing of Chinese to further improve the performance of both syntactic and semantic parsing, in particular the performance of sem...
ACL
2010
14 years 10 days ago
2010
We investigate active learning methods for Japanese dependency parsing. We propose active learning methods of using partial dependency relations in a given sentence for parsing an...
ACL
2010
14 years 10 days ago
2010
We show how web mark-up can be used to improve unsupervised dependency parsing. Starting from raw bracketings of four common HTML tags (anchors, bold, italics and underlines), we ...
TSD
2010
Springer
14 years 20 days ago
2010
Springer
Abstract. Maltparser is a contemporary dependency parsing machine learningbased system that shows great accuracy. However 90% for Labelled Attachment Score (LAS) seems to be a de f...
TCS
2010
14 years 20 days ago
2010
Robustness, the ability to analyze any input regardless of its grammaticality, is a desirable property for any system dealing with unrestricted natural language text. Error-repair...
CORR
2010
Springer
14 years 26 days ago
2010
Springer
Abstract. We present two novel approaches to parsing context-free languages. The first approach is based on an extension of Brzozowski’s derivative from regular expressions to c...
TCS
1998
14 years 1 months ago
1998
Parsing schemata provide a high-level formal description of parsers. These can be used, among as an intermediate level of abstraction for deriving the formal correctness of a pars...
JACM
2002
14 years 1 months ago
2002
In 1975, Valiant showed that Boolean matrix multiplication can be used for parsing contextfree grammars (CFGs), yielding the asympotically fastest (although not practical) CFG par...