%0 Conference Proceedings %T A Chunking-and-Raising Partial Parser %A Chen, Hsin-Hsi %A Lee, Yue-Shi %Y Hajicova, Eva %Y Lang, Bernard %Y Berwick, Robert %Y Bunt, Harry %Y Carpenter, Bob %Y Church, Ken %Y Joshi, Aravind %Y Kaplan, Ronald %Y Kay, Martin %Y Nagao, Makoto %Y Nijholt, Anton %Y Steedman, Mark %Y Thompson, Henry %Y Tomita, Masaru %Y Vijay-Shanker, K. %Y Wilks, Yorick %Y Wittenburg, Kent %S Proceedings of the Fourth International Workshop on Parsing Technologies %D 1995 %8 sep 20 24 %I Association for Computational Linguistics %C Prague and Karlovy Vary, Czech Republic %F chen-lee-1995-chunking %X Parsing is often seen as a combinatorial problem. It is not due to the properties of the natural languages, but due to the parsing strategies. This paper investigates a Constrained Grammar extracted from a Treebank and applies it in a non-combinatorial partial parser. This parser is a simpler version of a chunking-and-raising parser. The chunking and raising actions can be done in linear time. The short-term goal of this research is to help the development of a partially bracketed corpus, i.e., a simpler version of a treebank. The long-term goal is to provide high level linguistic constraints for many natural language applications. %U https://aclanthology.org/1995.iwpt-1.10 %P 71-78