Báo cáo khoa học: "Simplifying Deterministic Parsing" pot

... 07331 ABSTRACT 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 ... Simplifying Deterministic Parsing Alan W. Carter z Department of Computer Science University of British ... implementation of an alternate determinis- tic parsing model intended to reduce...

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

... lexicalized PCFG models, and surprisingly close to the current state-of-the- art. This result has potential uses beyond establish- ing a strong lower bound on the maximum possi- ble accuracy of

Ngày tải lên: 08/03/2014, 04:22

... centered on individual words. Natural language parsing with word experts entails several new hypotheses about the organization and representation of linguistic and pragmatic knowledge for ... Wllks [5]. The control structure of the Word Expert Parser results from agreqment .with ~he hypothesis of .Harcus that parsing can he none aetermzntsttcally and ~n a way tn Dhlcn informatio...

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

... our result implies a deterministic parser that is closely related to the recursive ascent parsers discovered by Kruseman Aretz [1] and Roberts [2]. In the gen- eral non -deterministic case, ... been claimed by Tomita that non -deterministic LR-parsers are useful for natural language processing. In [4] he presented a discussion about how to do non- deterministic LR-parsing, with a ....

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

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

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

... languages and treebanks. We will use one of its standard versions (version 1.4). The parser obtains deterministically a de- pendency tree in linear-time in a single pass over the input using two ... dependency parser, showing that: • Semantic information gives an improvement on a transition-based deterministic depend- ency parsing. • Feature combinations give an improvement over usin...

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

... topological fields explain a higher level of structure pertaining to clause-level word order, and we hypothesize that lexicalization is un- likely to be helpful. 4 Experiments 4.1 Data For our experiments, ... time of birth makes one of the twins any more or less real/authentic/superior to a mother.” We hypothesized earlier that lexicalization is unlikely to give us much improvement in perfor-...

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

... se- lection in data-oriented parsing and tree- substitution grammar learning. We re- quire only simple, deterministic grammar symbol refinement, in contrast to recent work on latent symbol refinement. More- over, ... context respectively. The two approaches turn out to be highly complementary; even the simplest (deterministic) symbol refinement and a basic use of an all-fragments grammar comb...

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

... accepting n-best lexical hypotheses for each word is that we risk unifying parses that include two competing hypotheses. For example, if our speech TRACKER produces hypotheses “horse” and “house” ... signals. Figure 4: Gestural (a) and spoken (b) ‘words’. 2.2 Data Structures All TRACKERS write their hypotheses directly to the first of three SUBSPACES that partition all partial parses in the se...

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