Using descriptions of trees in a tree adjoining grammar
Computational Linguistics
An algebraic correctness criterion for intuitionistic multiplicative proof-nets
Theoretical Computer Science
Disambiguation of super parts of speech (or supertags): almost parsing
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
Polarized unification grammars
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
Associative Grammar Combination Operators for Tree-Based Grammars
Journal of Logic, Language and Information
COLING '08 22nd International Conference on on Computational Linguistics: Demonstration Papers
TuLiPA: towards a multi-formalism parsing environment for grammar engineering
GEAF '08 Proceedings of the Workshop on Grammar Engineering Across Frameworks
Interaction grammar for the Persian language: noun and adjectival phrases
ALR7 Proceedings of the 7th Workshop on Asian Language Resources
Dependency constraints for lexical disambiguation
IWPT '09 Proceedings of the 11th International Conference on Parsing Technologies
Research on Language and Computation
Lexical disambiguation with polarities and automata
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
| Hi-index | 0.00 |
In the context of lexicalized grammars, we propose general methods for lexical disambiguation based on polarization and abstraction of grammatical formalisms. Polarization makes their resource sensitivity explicit and abstraction aims at keeping essentially the mechanism of neutralization between polarities. Parsing with the simplified grammar in the abstract formalism can be used efficiently for filtering lexical selections.