Báo cáo khoa học: "PARSING" pot

Báo cáo khoa học: "PARSING" pot

Báo cáo khoa học: "PARSING" pot

... objectives which lead people to do research in this area. Some researchers are motivated primarily by potential applications - the development of natural language interfaces for computer systems. Others

Ngày tải lên: 24/03/2014, 01:21

2 62 0
Báo cáo khoa học: "Parsing and Subcategorization Data" pot

Báo cáo khoa học: "Parsing and Subcategorization Data" pot

... usually proceed in two steps and we adopt this approach. 1. Hypothesis Generation: Identify all SCCs from the corpus data. 2. Hypothesis Selection: Determine which SCC is a valid SCF for a particular ... cues. Our evalu- ator has two parts: the Binomial Hypothesis Test (Brent, 1993) and a back-off algorithm (Sarkar and Zeman, 2000). 1. The Binomial Hypothesis Test (BHT): Let p be the probabil...

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

8 442 0
Báo cáo khoa học: "PARSING AS NATURAL DEDUCTION " pot

Báo cáo khoa học: "PARSING AS NATURAL DEDUCTION " pot

... subproof, and not only over a single category. In this way, correct varia- ble bindings for hypothetic categories, which are introduced by "right"-rules, are guaranteed. ((s([<pred>:persuade])

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

8 414 0
Báo cáo khoa học: "Parsing with an Extended Domain of Locality" pot

Báo cáo khoa học: "Parsing with an Extended Domain of Locality" pot

... actions in this tree. Problems arise, and the EDOL hypothesis is violated, when there is a dependence between different parser actions. The EDOL hypothesis states that elementary trees provide a ... and parsing (Joshi and Srinivas, 1994; Evans and Weir, 1998). On the other hand, if the EDOL hypothesis holds for those dependencies that are being checked by the parser, then the burden...

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

8 274 0
Báo cáo khoa học: "Parsing Mildly Non-projective Dependency Structures" potx

Báo cáo khoa học: "Parsing Mildly Non-projective Dependency Structures" potx

... trivial partial dependency tree con- sisting of a single node w h and no links. This same set of hypotheses can be used for all the parsers, so we do not make it explicit for subse- quent schemata. ... each of the items corresponding to the subtrees induced by the direct dependents, and to the hy- pothesis [h, h, h, , ]. This allows us to infer p items representing the result of linking eac...

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

9 231 0
Báo cáo khoa học: "Parsing without lexicon: the MorP system" pot

Báo cáo khoa học: "Parsing without lexicon: the MorP system" pot

... Council for the Humanities. The parser is called MorP, for morphology based parser, and the hypotheses behind it can be formulated thus: a) It is to a large extent possible to decide the ... along these lines, which are first presented in Brodda (1982), and the predictions of the hy- potheses were found to hold fairly well. The project is reported in publications in Swedish (K/illg...

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

6 107 0
Báo cáo khoa học: "Parsing Coordinations" potx

Báo cáo khoa học: "Parsing Coordinations" potx

... become stan- dard in the last few years. If this hypothesis holds, we should find the correct parse among the n-best parses. In order to test this hypothesis, we con- ducted an experiment with BitPar ... treated as a fronted subordinate clause. 4 Experiment 1: n-Best Parsing and Reranking The first hypothesis for improving coordination parsing is based on the assumption that the correct parse m...

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

9 284 0
Từ khóa:
w