143 search results - page 5 / 29 » An Efficient Parser Generator for Natural Language |
EMNLP
2008
14 years 11 months ago
2008
In this paper, we present an algorithm for learning a generative model of natural language sentences together with their formal meaning representations with hierarchical structure...
80
Voted
FSMNLP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We present a formalization of lexicalized Recursive Transition Networks which we call Automaton-Based Generative Dependency Grammar (gdg). We show how to extract a gdg fr...
ACL
2012
13 years 2 days ago
2012
Stanford dependencies are widely used in natural language processing as a semanticallyoriented representation, commonly generated either by (i) converting the output of a constitu...
100
click to vote
MPC
2010
Springer
15 years 2 months ago
2010
Springer
Parser combinators are a popular tool for designing parsers in functional programming languages. If such combinators generate an abstract representation of the grammar as an interm...
CIKM
2010
Springer
14 years 7 months ago
2010
Springer
Many existing indexes on text work at the document granularity and are not effective in answering the class of queries where the desired answer is only a term or a phrase. In this...