Proceedings of the Workshop on Incremental Parsing Bringing Engineering and Cognition Together - IncrementParsing '04 2004
DOI: 10.3115/1613148.1613150
|View full text |Cite
|
Sign up to set email alerts
|

Stochastically evaluating the validity of partial parse trees in incremental parsing

Abstract: This paper proposes a method for evaluating the validity of partial parse trees constructed in incremental parsing. Our method is based on stochastic incremental parsing, and it incrementally evaluates the validity for each partial parse tree on a wordby-word basis. In our method, incremental parser returns partial parse trees at the point where the validity for the partial parse tree becomes greater than a threshold. Our technique is effective for improving the accuracy of incremental parsing.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
6
0

Year Published

2009
2009
2013
2013

Publication Types

Select...
3
1

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(7 citation statements)
references
References 12 publications
1
6
0
Order By: Relevance
“…This approach, however, allows multiple unconnected subtrees for a sentence prefix and uses a look-ahead of two words, that is, it does not build connected structures. An example of a TAG parser that is both incremental and builds connected structures is the work of Kato, Matsubara, and Inagaki (2004). This comes at the price of strong simplifying assumptions with respect to the TAG formalism, such as not distinguishing modifiers and arguments.…”
Section: Incremental Parsing Modelsmentioning
confidence: 99%
“…This approach, however, allows multiple unconnected subtrees for a sentence prefix and uses a look-ahead of two words, that is, it does not build connected structures. An example of a TAG parser that is both incremental and builds connected structures is the work of Kato, Matsubara, and Inagaki (2004). This comes at the price of strong simplifying assumptions with respect to the TAG formalism, such as not distinguishing modifiers and arguments.…”
Section: Incremental Parsing Modelsmentioning
confidence: 99%
“…Lombardo and Sturt (1997) and Kato et al (2004) have already adopted this approach. However, their methods have another problem that their adjoining operations cannot preserve lexical dependencies of partial parse trees.…”
Section: Incremental Parsing Methods Based On Adjoining Operationmentioning
confidence: 99%
“…By using the operation, we can avoid the problem of infinite local ambiguity. This approach has been adopted by Lombardo and Sturt (1997) and Kato et al (2004). However, this raises another problem that their adjoining operations cannot preserve lexical dependencies of partial parse trees.…”
Section: Introductionmentioning
confidence: 99%
“…By using the operation, we can avoid the problem of infinite local ambiguity. This approach has been adopted by the previous methods [8], [9]. However, this raises another problem that their adjoining operation cannot preserve information which partial parse trees have.…”
Section: Introductionmentioning
confidence: 99%
“…Lombardo, et al [8] and Kato, et al [9] have already adopted this approach. However, their method causes another problem.…”
Section: Introduction Of Adjoining Operation To Incremental Parsingmentioning
confidence: 99%