Characterizing mildly context-sensitive grammar formalisms
Characterizing mildly context-sensitive grammar formalisms
Long-distance scrambling and tree adjoining grammars
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
The structure of shared forests in ambiguous parsing
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
Interleaving syntax and semantics in an efficient bottom-up parser
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
Capturing CFLs with Tree Adjoining Grammars
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
A fully statistical approach to natural language interfaces
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Exploiting a sensed environment to improve human-agent communication
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Probabilistic grounding of situated speech using plan recognition and reference resolution
ICMI '05 Proceedings of the 7th international conference on Multimodal interfaces
A salience driven approach to robust input interpretation in multimodal conversational systems
HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
Grounded semantic composition for visual scenes
Journal of Artificial Intelligence Research
Learning dependency-based compositional semantics
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
EACL '12 Proceedings of the 13th Conference of the European Chapter of the Association for Computational Linguistics
Learning dependency-based compositional semantics
Computational Linguistics
| Hi-index | 0.00 |
This paper describes an extension of the semantic grammars used in conventional statistical spoken language interfaces to allow the probabilities of derived analyses to be conditioned on the meanings or denotations of input utterances in the context of an interface's underlying application environment or world model. Since these denotations will be used to guide disambiguation in interactive applications, they must be efficiently shared among the many possible analyses that may be assigned to an input utterance. This paper therefore presents a formal restriction on the scope of variables in a semantic grammar which guarantees that the denotations of all possible analyses of an input utterance can be calculated in polynomial time, without undue constraints on the expressivity of the derived semantics. Empirical tests show that this model-theoretic interpretation yields a statistically significant improvement on standard measures of parsing accuracy over a baseline grammar not conditioned on denotations.