Tài liệu Báo cáo khoa học: "BIDIRECTIONAL PARSING OF LEXICALIZED TREE ADJOINING GRAMMARS" pdf

Tài liệu Báo cáo khoa học: "BIDIRECTIONAL PARSING OF LEXICALIZED TREE ADJOINING GRAMMARS" pdf

Tài liệu Báo cáo khoa học: "BIDIRECTIONAL PARSING OF LEXICALIZED TREE ADJOINING GRAMMARS" pdf

... Relevance of Lexicalization to Parsing. In Proceedings of the 1st International Workshop on Parsing Technologies. Pittsburgh, PA. To also appear under the title: Parsing with Lexicalized Tree Adjoining ... Lexicalized Tree Adjoining Grammars (Schabes et al., 1988) are a refinement of TAGs such that each elementary tree is associated with a lexieal item, call...
Ngày tải lên : 22/02/2014, 10:20
  • 6
  • 370
  • 0
Tài liệu Báo cáo khoa học: "Prefix Probabilities from Stochastic Tree Adjoining Grammars*" pptx

Tài liệu Báo cáo khoa học: "Prefix Probabilities from Stochastic Tree Adjoining Grammars*" pptx

... initial trees and .A is a set of auxiliary trees. Trees in :TU.A are also called elementary trees. We refer to the root of an elementary tree t as Rt. Each auxiliary tree has exactly one distin- ... stochastic Tree Adjoining Grammar (STAG) is represented by a tuple (NT, E,:T, .A, ¢) where NT is a set of nonterminal symbols, E is a set of terminal symbols, 2: is a s...
Ngày tải lên : 20/02/2014, 18:20
  • 7
  • 311
  • 0
Tài liệu Báo cáo khoa học: "Long-Distance Scrambling and Tree Adjoining Grammars" doc

Tài liệu Báo cáo khoa học: "Long-Distance Scrambling and Tree Adjoining Grammars" doc

... within the larger domain of lo- cality (the elementary tree) , i.e., each clausal tree still contains a verb and all of its arguments. Thus, in a lexicalized TAG, the effects of long-distance movement ... of sentences like (2a) and (2b) is similar to the approach proposed in section 4. They also make use of a splitting of the auxiliary tree fl of figure 2, though they...
Ngày tải lên : 22/02/2014, 10:20
  • 6
  • 297
  • 0
Tài liệu Báo cáo khoa học: "Bayesian Symbol-Refined Tree Substitution Grammars for Syntactic Parsing" pptx

Tài liệu Báo cáo khoa học: "Bayesian Symbol-Refined Tree Substitution Grammars for Syntactic Parsing" pptx

... and frequencies of SR-TSG with those of TSG. The rule sizes of SR- TSG and TSG are defined as the number of CFG rules that the elementary tree contains. Figure 2 shows a histogram of the SR-TSG ... hierarchy. Ta- ble 1 shows an example of the SR-TSG rule and its backoff tree fragments as an illustration of this three- level hierarchy. The topmost level of our model is a dis...
Ngày tải lên : 19/02/2014, 19:20
  • 9
  • 411
  • 0
Tài liệu Báo cáo khoa học: "Semantic Parsing with Bayesian Tree Transducers" doc

Tài liệu Báo cáo khoa học: "Semantic Parsing with Bayesian Tree Transducers" doc

... class of tree 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 ... pair, (b) a tree transformation based mapping, and (c) a tree trans- ducer that performs the mapping. volve tree transformations either between two trees or a tree and a str...
Ngày tải lên : 19/02/2014, 19:20
  • 9
  • 475
  • 0
Tài liệu Báo cáo khoa học: "Deterministic Parsing of Syntactic Non-fluencies" docx

Tài liệu Báo cáo khoa học: "Deterministic Parsing of Syntactic Non-fluencies" docx

... the right edge of the potential expunction site; and 2) the expunged part is the left-hand member of a pair of copies, one on each side of the editing signal. The copies may be of three types: ... corpus of over twenty hours of transcribed speech, in the process of using the parser to search for various syntactic constructions. Tht~ transcripts are of sociolinguistic in...
Ngày tải lên : 21/02/2014, 20:20
  • 6
  • 350
  • 0
Tài liệu Báo cáo khoa học: "A GENERALIZATION OF THE OFFLINE PARSABLE GRAMMARS" doc

Tài liệu Báo cáo khoa học: "A GENERALIZATION OF THE OFFLINE PARSABLE GRAMMARS" doc

... f'mite set of symbols, so there is only a finite number of strings of given length L, and it has a finite number of rules, so there is only a finite number of possible parse trees of given depth ... Let C a be the set of pairs [A,B] such that A B by a tree of depth n. Clearly C t is the set of pairs [A,B] such that (A ) B) is a rule of G. Also, Cn+ 1 is the...
Ngày tải lên : 21/02/2014, 20:20
  • 6
  • 440
  • 0
Tài liệu Báo cáo khoa học: "The Role of Initiative in Tutorial Dialogue" pdf

Tài liệu Báo cáo khoa học: "The Role of Initiative in Tutorial Dialogue" pdf

... benefit of this annotation scheme is that in our corpus the majority of turns can be automatically labeled: questions often ended in question marks; commands often started with verbs; a list of ... through a line of reasoning to a cor- rect answer. The second row of the table shows average per- centage of initiative changes that were abdica- tions. Abdications are the use of p...
Ngày tải lên : 22/02/2014, 02:20
  • 8
  • 628
  • 0
Tài liệu Báo cáo khoa học: "Faster Parsing by Supertagger Adaptation" pptx

Tài liệu Báo cáo khoa học: "Faster Parsing by Supertagger Adaptation" pptx

... as costly as parsing a whole extra sentence. Our goal is to increase parsing speed without loss of accuracy. The technique we use is a form of self-training, in which the output of the parser ... the accuracy of a parsing pipeline by using the output of later stages to constrain earlier stages. The only work we are aware of that uses self- training to improve the efficiency...
Ngày tải lên : 20/02/2014, 04:20
  • 11
  • 404
  • 0

Xem thêm