Sciweavers

742 search results - page 105 / 149
» Formal Grammar for Java
Sort
View
NAACL
2007
13 years 9 months ago
Semi-Supervised Learning for Semantic Parsing using Support Vector Machines
We present a method for utilizing unannotated sentences to improve a semantic parser which maps natural language (NL) sentences into their formal meaning representations (MRs). Gi...
Rohit J. Kate, Raymond J. Mooney
ACL
2004
13 years 9 months ago
Wrapping of Trees
We explore the descriptive power, in terms of syntactic phenomena, of a formalism that extends TreeAdjoining Grammar (TAG) by adding a fourth level of hierarchical decomposition t...
James Rogers
ACL
1997
13 years 9 months ago
Fast Context-Free Parsing Requires Fast Boolean Matrix Multiplication
Valiant showed that Boolean matrix multiplication (BMM) can be used for CFG parsing. We prove a dual result: CFG parsers running in time O([Gl[w[3-e) on a grammar G and a string w...
Lillian Lee
ACL
1993
13 years 9 months ago
A Complete and Recursive Feature Theory
Various feature descriptions are being employed in constrained-based grammar formalisms. The common notational primitive of these descriptions are functional attributes called fea...
Rolf Backofen, Gert Smolka
ANLP
1994
105views more  ANLP 1994»
13 years 9 months ago
The Delphi Natural Language Understanding System
This paper presents Delphi, the natural language component of the BBN Spoken Language System. Delphi is a domainindependent natural language question answering system that is soli...
Madeleine Bates, Robert J. Bobrow, Robert Ingria, ...