Sciweavers

681 search results - page 64 / 137
» Parsing as Natural Deduction
Sort
View
RTA
2005
Springer
15 years 3 months ago
Arithmetic as a Theory Modulo
We present constructive arithmetic in Deduction modulo with rewrite rules only. In natural deduction and in sequent calculus, the cut elimination theorem and the analysis of the st...
Gilles Dowek, Benjamin Werner
ACL
2009
14 years 7 months ago
A Polynomial-Time Parsing Algorithm for TT-MCTAG
This paper investigates the class of TreeTuple MCTAG with Shared Nodes, TTMCTAG for short, an extension of Tree Adjoining Grammars that has been proposed for natural language proc...
Laura Kallmeyer, Giorgio Satta
COLING
2010
14 years 4 months ago
Using Web-scale N-grams to Improve Base NP Parsing Performance
We use web-scale N-grams in a base NP parser that correctly analyzes 95.4% of the base NPs in natural text. Web-scale data improves performance. That is, there is no data like mor...
Emily Pitler, Shane Bergsma, Dekang Lin, Kenneth W...
POPL
2004
ACM
15 years 10 months ago
Parsing expression grammars: a recognition-based syntactic foundation
For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of prog...
Bryan Ford
ACL
2006
14 years 11 months ago
Semantic Parsing with Structured SVM Ensemble Classification Models
We present a learning framework for structured support vector models in which boosting and bagging methods are used to construct ensemble models. We also propose a selection metho...
Minh Le Nguyen, Akira Shimazu, Xuan Hieu Phan