
- Harbusch, K, "An Efficient Parsing Algorithm for Tree Adjoining Grammars", in Proceedings of the Conference of the Association for Computational Linguistics,1990, pp.284-291. Google Scholar
Digital Library
- Hopcroft, j.E. and Ullman, J.D., Introduction to Automata Theory~ Languages. and Computation, Addison-Wesley, 1979. Google Scholar
Digital Library
- Kasami, T., "An Efficient Recognition and Syntax Algortihm for Context-Free Languages", Scientific Report AFCRL-65-758, Air Force Cambridge Research Laboratory, Bedford MA, 1965.Google Scholar
- Vijay-Shanker, K. and Weir, D.J., "Polynomial Time Parsing of Combinatory Categorial Grammars" in Proceedings of the Conference of the Association .for Computational Linguistics, 1990, pp. 1-8. Google Scholar
Digital Library
- Younger, D.H., "Recognition and Parsing of Context-Free Languages in Time O (n3)'', Information and Control, 10(2): 189-208, 1967.Google Scholar
Cross Ref
Index Terms
A CYK approach to parsing in parallel: a case study
Recommendations
Flexible Combinatory Categorial Grammar Parsing Using the CYK Algorithm and Answer Set Programming
LPNMR 2013: Proceedings of the 12th International Conference on Logic Programming and Nonmonotonic Reasoning - Volume 8148Combinatory Categorial Grammar CCG is a grammar formalism used for natural language parsing. CCG assigns structured lexical categories to words and uses a small set of combinatory rules to combine these categories in order to parse sentences. In this ...
LLLR parsing
SAC '13: Proceedings of the 28th Annual ACM Symposium on Applied ComputingThe idea of an LLLR parsing is presented. An LLLR(k) parser can be constructed for any LR(k) grammar but it produces the left parse of the input string in linear time (in respect to the length of the derivation) without backtracking. If used as a basis ...






Comments