Báo cáo khoa học: "PRINCIPLE-BASED PARSING WITHOUT OVERGENERATION" docx

... transducers, producing state-of-the-art semantic parsing re- sults while remaining applicable to any do- main employing probabilistic tree transducers. 1 Introduction Semantic parsing is the task of mapping natural ... three-fold: we present a new state-of-the-art semantic parsing model, propose a broader theory for tree transforma- tion based semantic parsing, and present a general in...

Ngày tải lên: 19/02/2014, 19:20

... performance. To avoid a trade- off between these two, we need to increase parsing speed, but without losing accuracy. Parsing with lexicalised grammar formalisms, such as Lexicalised Tree Adjoining ... parser must consider; second, each further pass is as costly as parsing a whole extra sentence. Our goal is to increase parsing speed without loss of accuracy. The technique we use...

Ngày tải lên: 20/02/2014, 04:20

Ngày tải lên: 20/02/2014, 18:20

... We present O(n 4) parsing algorithms for two bilexical formalisms, improv- ing the prior upper bounds of O(n5). For a com- mon special case that was known to allow O(n 3) parsing (Eisner, ... information to deriva- tions can also be exploited in parsing formalisms other than rewriting systems. The authors have developed an O(nT)-time parsing algorithm for bilexicalized tree adj...

Ngày tải lên: 20/02/2014, 19:20

... detail the correct such processes as ellipsis and conjunction, they are without doubt fully productive grammatical processes. Without an understanding of the differences in the kinds of non-fluencies ... non-fluencies that occur in speech. Then, after reviewing the notion of deterministic parsing, I will describe the model of parsing self-corrections in detail, and report results...

Ngày tải lên: 21/02/2014, 20:20

... research that are relevant to our work: work on parsing (written and spoken) discourse, and work on plan-based dialog models. Discourse Parsing Discourse parsing is the pro- cess of building a hierarchical ... con- siderable work on discourse parsing using statisti- cal bottom-up parsing (Soricut and Marcu, 2003), hierarchical agglomerative clustering (Sporleder and Lascarides, 2004...

Ngày tải lên: 22/02/2014, 02:20

... the association between elementary trees and anchors improves also parsing performance, as will be discussed below. Various parsing algorithms for TAGs have been proposed in the literature: ... predictions. Even if such an algorithm does not improve tim worst-case time bounds of already known TAGs parsing meth- ods, it could be relevant from the perspective of linguistic informa...

Ngày tải lên: 22/02/2014, 10:20

... months without I-PP PP-TMP was held for three months without being I-NP NOFUNC held for three months without being charged I-NP NP for three months without being charged . I-PP PP three months without being ... NOFUNC months without being charged . I-VP VP/S-NOM without being charged . O NOFUNC Table 1: Encoding into instances, with words as input, of the example sentence “Once...

Ngày tải lên: 08/03/2014, 07:20

... (henceforth, FG) which accounts for word order varia- tions without overgenerating and without unnecessary lexical ambiguities. Second, to enhance parsing effi- ciency by eliminating spurious parses, ... schemas and LP state- ments are precompiled before parsing and the number of rules increases rapidly or LP statements are checked on the fly during parsing thus slowing down...

Ngày tải lên: 08/03/2014, 18:20

... deterministic parsing. However, their conclusion is based on critiques of various versions of the Marcus parser which represents only one of many possible approaches to deterministic parsing. We ... parser represents only one of many possible approaches to deterministic parsing Therefore, the conclusion that deterministic parsing, m general, is impractical or psychologically implau...

Ngày tải lên: 09/03/2014, 01:20