Sciweavers

681 search results - page 56 / 137
» Parsing as Natural Deduction
Sort
View
SCCC
1998
IEEE
15 years 2 months ago
Dynamic Programming as Frame for Efficient Parsing
The last few years have seen a renewal of interest in the consideration of dynamic programming in compiler technology. This is due to the compactness of the representations, which...
Manuel Vilares Ferro, Miguel A. Alonso, David Cabr...
CICLING
2005
Springer
14 years 11 months ago
Lexicalized Beam Thresholding Parsing with Prior and Boundary Estimates
We use prior and boundary estimates as the approximation of outside probability and establish our beam thresholding strategies based on these estimates. Lexical items, e.g. head wo...
Deyi Xiong, Qun Liu, Shouxun Lin
EMNLP
2007
14 years 11 months ago
The CoNLL 2007 Shared Task on Dependency Parsing
The Conference on Computational Natural Language Learning features a shared task, in which participants train and test their learning systems on the same data sets. In 2007, as in...
Joakim Nivre, Johan Hall, Sandra Kübler, Ryan...
ACL
2006
14 years 11 months ago
A Pipeline Framework for Dependency Parsing
Pipeline computation, in which a task is decomposed into several stages that are solved sequentially, is a common computational strategy in natural language processing. The key pr...
Ming-Wei Chang, Quang Do, Dan Roth
EACL
1993
ACL Anthology
14 years 11 months ago
Towards efficient parsing with proof-nets
This paper presents a method for parsing associative Lambek grammars based on graphtheoretic properties. Connection graphs, which are a simplified version of proof-nets, are actua...
Alain Lecomte