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

... 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 interviews of the ... understanding of the differences in the kinds of non-fluencies that occur, we are left with a kind of grab bag of grammatical deviation that can never be analyzed except by some sort of general ... a part of the competence of any natural language user. I will begin by discussing the range of non-fluencies that occur in speech. Then, after reviewing the notion of deterministic parsing, ...

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

... the set of all nodes in the left (right) portion of some tree in IuA. Note that the three sets Middle-nodes, Left-nodes and Right-nodes constitute a partition of the set of all nodes of trees ... 1985)). TAGs can cope with various kinds of unbounded dependencies in a direct way because of their extended domain of locality; in fact, the elementary trees of TAGs are the appropriate domains ... nw, where nw is the length of w. If state s belongs to the component tij of T, the partial analysis (the part of an) represented by s subsumes the substring of w that starts from position...

Tài liệu Báo cáo khoa học: "A Framework for Syntactic Translation" docx

... tions of the languages involved and on an adequate statement of equivalences. Translation is conceived of as a three-step process: recognition of the structure of the incoming text in terms of ... considera- tion of a number of factors. Foremost among these is the necessity of breaking down a problem as complex as that of mechanical translation into a number of problems each of which is ... ques- tion of how we produce a sentence. But it ap- pears that the description of a language is more easily couched in terms of synthesis of sentences than in terms of analysis of sentences....

Tài liệu Báo cáo khoa học: "Deterministic shift-reduce parsing for unification-based grammars by using default unification" potx

... of the head daughter of i-th item from the top of the stack Snw(i) … head word of the non-head daughter of i-th item from the top of the stack Snp(i) … head POS of the non-head daughter of ... top of the stack Ssy(i) … symbol of phrase category of the i-th item from the top of the stack Shsy(i) … symbol of phrase category of the head daughter of the i-th item from the top of the ... Sw(i) … head word of i-th item from the top of the stack Sp(i) … head POS of i-th item from the top of the stack Shw(i) … head word of the head daughter of i-th item from the top of the stack Shp(i)...

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

... ithchild of theparent produced by rule m. Aside from ensuringthe grammaticality of the generated MR, rules of this type also model the probability of the MR, con-ditioning the probability of a ... percentage of sentences with correct answers),as well as F1: the harmonic mean of precision (theproportion of correct answers out of sentences witha parse) and recall (the proportion of correct ... free grammar (CFG), and is a way of de-scribing a language of trees. Formally, deﬁne TΣasthe set of trees with symbols from alphabet Σ, andTΣ(A) as the set of all trees in TΣ∪Awhere symbolsfrom...

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

... Large-scale Parsing Systems, pages 37–42, Luxembourg.Anoop Sarkar. 2001. Applying co-training methodsto statistical parsing. In Proceedings of the SecondMeeting of the North American Chapter of the ... volumes of text and detailed syntactic information are bothcritical for high performance. To avoid a trade-off between these two, we need to increase parsing speed, but without losing accuracy. Parsing ... ascostly as parsing a whole extra sentence.Our goal is to increase parsing speed withoutloss of accuracy. The technique we use is a form of self-training, in which the output of the parser...

Tài liệu Báo cáo khoa học: "A Uniﬁed Syntactic Model for Parsing Fluent and Disﬂuent Speech∗" ppt

... approach described here makes use of a trans-form on a tree-annotated corpus to build a syntactic model of speech repair which takes advantage of thestructure of speech repairs as described above, ... dual of a left-corner transform. It transforms all right recursivesequences in each tree into left recursive sequences of symbols of the form A1/A2, denoting an incom-plete instance of category ... tree, in the form of the-UNF tags. As the parsing chart is ﬁlled in bottomup, each rule applied is essentially coming out of aspecial repair rule set, and so at the top of the treethe EDITED...

Tài liệu Báo cáo khoa học: "Statistical parsing with an automatically-extracted tree adjoining grammar" pdf

...

Tài liệu Báo cáo khoa học: "Efficient Parsing for Bilexical Context-Free Grammar sand Head Automaton Grammars*" pptx

... of the form A[a] + ~. A T is just a derivation (proof tree) of lZ~n ,.o parse and its probability like that of any derivation we find is defined as the product of the prob- abilities of ... Among items of the same width, those of type A should be considered last. The algorithm requires space proportional to the number of possible items, which is at most na]VDI 2. Each of the five ... analysis to the (infinite) set of input in- stances of the parsing problem that satisfy re- lation n < IVTI. With this assumption, the asymptotic time complexity of the CKY algorithm becomes...

Tài liệu Báo cáo khoa học: "Online Learning of Approximate Dependency Parsing Algorithms" potx

... pro-vide state -of- the-art performance across multiplelanguages. However, the parsing algorithms re-quire that the score of a dependency tree factorsas a sum of the scores of its edges. This ... non-projective parsing algorithm. of dependents have been gathered. T his allows forthe collection of pairs of adjacent dependents ina single stage, which allows for the incorporation of second-order ... thatthese new models lead to state -of- the-art accuracyfor English and the best accuracy we know of forCzech and Danish.2 Maximum Spanning Tree Parsing Dependency-tree parsing as the search for themaximum...

Xem thêm