An efficient context-free parsing algorithm
Communications of the ACM
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
Feature logic with disjunctive unification
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
LACL '98 Selected papers from the Third International Conference, on Logical Aspects of Computational Linguistics
Efficient construction of underspecified semantics under massive ambiguity
ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
Ambiguity preserving machine translation using packed representations
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
Building an end-to-end text reading system based on a packed representation
FAM-LbR '10 Proceedings of the NAACL HLT 2010 First International Workshop on Formalisms and Methodology for Learning by Reading
Pythia: compositional meaning construction for ontology-based question answering on the semantic web
NLDB'11 Proceedings of the 16th international conference on Natural language processing and information systems
Large scale semantic construction for tree adjoining grammars
LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics
| Hi-index | 0.00 |
The paper describes a system which uses packed parser output directly to build semantic representations. More specifically, the system takes as input Packed Shared Forests in the sense of Tomita (Tomita, 1985) and produces packed Underspecified Discourse Representation Structures. The algorithm visits every node in the Parse Forest only a bounded number of times, so that a significant increase in efficiency is registered for ambiguous sentences.