<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="chen-lee-1995-chunking">
    <titleInfo>
        <title>A Chunking-and-Raising Partial Parser</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Hsin-Hsi</namePart>
        <namePart type="family">Chen</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Yue-Shi</namePart>
        <namePart type="family">Lee</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>1995-sep 20-24</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <relatedItem type="host">
        <titleInfo>
            <title>Proceedings of the Fourth International Workshop on Parsing Technologies</title>
        </titleInfo>
        <originInfo>
            <publisher>Association for Computational Linguistics</publisher>
            <place>
                <placeTerm type="text">Prague and Karlovy Vary, Czech Republic</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">conference publication</genre>
    </relatedItem>
    <abstract>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.</abstract>
    <identifier type="citekey">chen-lee-1995-chunking</identifier>
    <location>
        <url>https://aclanthology.org/1995.iwpt-1.10</url>
    </location>
    <part>
        <date>1995-sep 20-24</date>
        <extent unit="page">
            <start>71</start>
            <end>78</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T A Chunking-and-Raising Partial Parser
%A Chen, Hsin-Hsi
%A Lee, Yue-Shi
%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

Markdown (Informal)

[A Chunking-and-Raising Partial Parser](https://aclanthology.org/1995.iwpt-1.10) (Chen & Lee, IWPT-WS 1995)

• A Chunking-and-Raising Partial Parser (Chen & Lee, IWPT-WS 1995)

ACL

• Hsin-Hsi Chen and Yue-Shi Lee. 1995. A Chunking-and-Raising Partial Parser. In Proceedings of the Fourth International Workshop on Parsing Technologies, pages 71–78, Prague and Karlovy Vary, Czech Republic. Association for Computational Linguistics.