Báo cáo khoa học: "Towards efficient parsing with proof-nets" pdf

... Towards efficient parsing with proof-nets Alain Lecomte GRIL Universit6 Blaise Pascal 63037-Clermont-Ferrand France email: lecomte@ shm.grenet.fr Abstract This paper presents a method for parsing ... classical chart- parsing. 1 Introduction In this paper, we present a method for parsing Lambek grammars based on graph-theoretic properties. We expect that it may be done...

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

... confidence-weighted classifiers with transition-based dependency pars- ing yields results comparable with the state-of-the- art results achieved with Support Vector Machines - with faster training and parsing times. ... work on data-driven depen- dency parsing. The two dominating approaches have been graph-based parsing, e.g. MST -parsing (McDonald et al., 2005b) and transition-bas...

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

... parsing Coarse-to-fine parsing (Charniak et al., 2006) is a technique to speed up parsing by exploiting the information that can be gained from parsing with simpler, coarser grammars—e.g., a grammar with a smaller ... our transformations. Figure 8 compares the parsing times of LCFRS with and without the new CFG-CTF method. The graph shows a steep incline for parsing with LC...

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

... Perl. 23 ate He He:1:2-ate:2:0 ate meat ate:1:0-meat:2:1 ate with ate:1:0 -with: 2:1 meat the the:1:2-meat:2:0 with fork with: 1:0-fork:2:1 fork a a:1:2-fork:2:0 Figure 4: Examples of bigram-subtrees ate meat with ate:1:0-meat:2:1 -with: 3:1 ate with ... (Carreras, 2007). We call the parser with the monolingual features monolingual parser. 3.2 Parsing with bilingual features I...

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

... principle, dependency parsing offers good prospects for experimenting with word-to-word-semantic relationships. We present a set of experiments using semantic classes in dependency parsing of the ... semantic processing helps parsing. Collins (2000) tested a combined parsing/ word sense disambiguation model based in WordNet which did not obtain improvements in parsing. Koo et a...

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

... Algorithms for Parsing the DOP Model. In Proceedings of EMNLP. Joshua Goodman. 1996b. Parsing Algorithms and Metrics. In Proceedings of ACL. Joshua Goodman. 2003. Efficient parsing of DOP with PCFG-reductions. ... compaction with negligible overhead in computation. 5 Improved Treebank Representations 5.1 Character-Level Parsing The all-fragments approach to parsing has the added...

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

... of CKY parsing allowing it to parse a word- lattice instead of a predetermined list of terminals. Lattice parsing adds a layer of flexibility to exist- ing parsing technology, and allows parsing ... jointly with it, not added in afterwards. Moreover, we expect empty-element recovery to improve as the parsing quality improves. Our method makes use of a strong syntactic model, the PC...

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

... . , φ n with weights w 1 , . . . , w n , the conclu- sion φ 0 can be formed with weight g(w 1 , . . . , w n ) and priority p(w 1 , . . . , w n ). These deduction rules are “executed” within a ... Berkeley {adpauls,klein}@cs.berkeley.edu Abstract Hierarchical A ∗ (HA ∗ ) uses of a hierarchy of coarse grammars to speed up parsing without sacrificing optimality. HA ∗ pri- oritizes search in...

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

... the improvement of this result. An efficient parser for Tree Adjoining Grammars with a worst case time complexity of O(n 4 log n) is discussed. All known parsing algorithms for TAGs use the ... extension of context-free parsing al- gorithms to accept TAGs as well. The following parsing algorithms are able to ac- cept some extensions of the pure TAG definition without changi...

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

... lexicalized scoping and context. With these revisions, head-driven generation with HPSG is not so simple, but it is possible. 1 Introduction A natural approach to generation with Head-driven Phrase ... Abstract As HPSG is head-driven, with clear semantic heads, semantic head-driven generation should be simple. We adapt van Noord's Prolog generator for use with an HPSG...

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