Sciweavers

360 search results - page 48 / 72
» Dependency Parsing
Sort
View
DAM
2010
66views more  DAM 2010»
13 years 7 months ago
On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
Rank-width is a structural graph measure introduced by Oum and Seymour and aimed at better handling of graphs of bounded clique-width. We propose a formal mathematical framework an...
Robert Ganian, Petr Hlinený
ACL
2010
13 years 5 months ago
Accurate Context-Free Parsing with Combinatory Categorial Grammar
The definition of combinatory categorial grammar (CCG) in the literature varies quite a bit from author to author. However, the differences between the definitions are important i...
Timothy A. D. Fowler, Gerald Penn
COLING
2010
13 years 2 months ago
2D Trie for Fast Parsing
In practical applications, decoding speed is very important. Modern structured learning technique adopts template based method to extract millions of features. Complicated templat...
Xian Qian, Qi Zhang, Xuanjing Huang, Lide Wu
NAACL
2004
13 years 9 months ago
Speed and Accuracy in Shallow and Deep Stochastic Parsing
This paper reports some experiments that compare the accuracy and performance of two stochastic parsing systems. The currently popular Collins parser is a shallow parser whose out...
Ronald M. Kaplan, Stefan Riezler, Tracy H. King, J...
ACL
1990
13 years 9 months ago
Licensing and Tree Adjoining Grammar in Government Binding Parsing
This paper presents an implemented, psychologicallyplausible parsing model for Government Binding theory grammars. I make use of two main ideas: (1) a generalization of the licens...
Robert Frank