Детерминирленген талдау

Marcus' original deterministic parsing included almost no part-of-speech ambiguity. In this paper, the addition of part-of-speech ambiguity to a deterministic parser written in Prolog is described. To handle this ambiguity, …...

This paper presents a model for deterministic parsing which was designed to simplify the task of writing and understanding a deterministic grammar. While retaining structures and operations similar to those …...

Conjunctions have always been a source of problems for natural language parsers. This paper shows how these problems may be circumvented using a rule.based, walt-and-see parsing strategy. A parser is …...

This paper assesses two new approaches to deterministic parsing with respect to the analysis of unbounded dependencies (UDs). UDs in English are highly locally (and often globally) ambiguous. Several researchers …...

We present a two-stage multilingual de- pendency parsing system submitted to the Multilingual Track of CoNLL-2007. The parser first identifies dependencies using a deterministic parsing method and then labels those …...

Deterministic parsing has emerged as an ef- fective alternative for complex parsing algo- rithms which search the entire search space to get the best probable parse tree. In this pa- …...

Many parsing techniques including pa- rameter estimation assume the use of a packed parse forest for efficient and ac- curate parsing. However, they have sev- eral inherent problems deriving from …...