1942 search results - page 198 / 389 » Parse |
207
click to vote
DLT
2003
15 years 8 months ago
2003
A new generalization of context-free grammars is introduced: Boolean grammars allow the use of all set-theoretic operations as an integral part of the formalism of rules. Rigorous...
188
click to vote
NIPS
2001
15 years 8 months ago
2001
We describe the application of kernel methods to Natural Language Processing (NLP) problems. In many NLP tasks the objects being modeled are strings, trees, graphs or other discre...
154
click to vote
IJCAI
2003
15 years 7 months ago
2003
After many successes, statistical approaches that have been popular in the parsing community are now making headway into Natural Language Generation (NLG). These systems are aimed...
168
click to vote
ACL
1998
15 years 7 months ago
1998
Several methods are known for parsing languages generated by Tree Adjoining Grammars (TAGs) in O(n 6) worst case running time. In this paper we investigate which restrictions on T...
136
click to vote
ANLP
2000
15 years 7 months ago
2000
This paper reports on work carried out to develop a spelling and grammar corrector for Danish, addressing in particular the issue of how a form of shallow parsing is combined with...