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
The interface between phrasal and functional constraints
Computational Linguistics
The structure of shared forests in ambiguous parsing
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
Semantic construction from parse forests
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2
LACL '98 Selected papers from the Third International Conference, on Logical Aspects of Computational Linguistics
An empirical assessment of semantic interpretation
NAACL 2000 Proceedings of the 1st North American chapter of the Association for Computational Linguistics conference
Ambiguity preserving machine translation using packed representations
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
Context-Free grammar rewriting and the transfer of packed linguistic representations
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 2
A cascaded finite-state parser for German
EACL '03 Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics - Volume 2
| Hi-index | 0.00 |
We investigate the problem of determining a compact underspecified semantical representation for sentences that may be highly ambiguous. Due to combinatorial explosion, the naive method of building semantics for the different syntactic readings independently is prohibitive. We present a method that takes as input a syntactic parse forest with associated constraint-based semantic construction rules and directly builds a packed semantic structure. The algorithm is fully implemented and runs in O(n4log(n)) in sentence length, if the grammar meets some reasonable 'normality' restrictions.