2 research outputs found

    Parsing Incomplete Sentences Revisited

    No full text

    Parsing Incomplete Sentences Revisited

    No full text
    We describe a context-free parsing algorithm to deal with incomplete sentences, including unknown parts of unknown length. It produces a finite shared-forest compiling all parses, often infinite in number, that could account for both the error and the missing parts
    corecore