Báo cáo khoa học: "LR Parsers For Natural Languages" pot

... UIIman [4]. The LR parsers have seldom been used for Natural Language Processing probably because: 1. It has been thought that natural languages are not context-free, whereas LR parsers can deal ... tree. This fact is desirable for progralnming languages. For natural languages, however, it is sometimes necessary for a parser to produce more than one parse tree. For example, consider the ... grammar for a subset of natural language suflicient for practical systems can be written in context.free phrase structure. lhtJ.% our main concern is how to cope with the ambiguity of natural...

Báo cáo khoa học: "Connectionist Models for Natural Language Processing" doc

...

Tài liệu Báo cáo khoa học: "Tabular Algorithms for TAG Parsing" potx

... (Shieber et al., 1995), where items are called formula schemata, deduc- tion steps are inference rules, hypothesis are ax- ioms and final items are goal formulas. A parsing schema can be generalized ... taken place in the node N r and therefore further adjunctions on the same node are forbidden. A value of false indicates that no adjunction was performed on that node. In this case, during ... "CYK $'CYK = { [R ~,0,n [ -,-[adj]la e I } The hypotheses defined for this parsing system are the standard ones and therefore they will be omitted in the next parsing systems described...

Báo cáo khoa học: "Unsupervised Analysis for Decipherment Problems" pot

... initially to be uniform2. for several iterations do:a. set up a count(, ) table with zero entriesb. for = 1 toQ[ ,1] = b( boundary)c. for = 2 to for = 1 toQ[ , ] = 0 for = 1 toQ[ , ] += ... 1 toQ[ , ] += Q[ , ] b( ) s( )d. for = 1 toR[ , ] = b(boundary )e. for = to 1 for = 1 toR[ , ] = 0 for = 1 toR[ , ] += R[ , ] b( ) s( )f. for = 1 to for = 1 tocount( , ) += Q[ , ] R[ ... a s( ) substitution table initially to be uniform2. for several iterations do:a. set up a count table count(, ) with zero entriesb. P(c) = 0c. for all possible plaintexts(each drawn from...

Báo cáo khoa học: "Unsupervised Methods for Head Assignments" potx

... syntac-tic information for transforming constituency tree-banks to dependency structures (Nivre et al., 2007)or richer syntactic representations (e.g., Hocken-maier and Steedman, 2007). For the ... approach of using EM for induc-ing latent information in treebanks has led to extremely ac-curate constituency parsers, that neither make use of nor pro-duce headedness information; see (Petrov ... limits the usefulness of LTSGs for modeling the full complexity of natural languagesyntax; however, computationally, LTSGs havemany advantages over richer formalisms and for the current purposes...

Báo cáo khoa học: "Morphological Cues for Lexical Semantics" pot

... semantic information. Word sense disambiguation for the bases and derived forms that could not be resolved using part- of-speech tags was not performed. However, there exist systems for such ... the morphological analyzer. For example, -Nize could not be stripped from hypoth- esize because Alvey failed to reconstruct hypothesis from hypothes. However, for the affixes discussed ... exist for the needed lexical semantic information. The next section explores the possibility of using derivational affixes as surface cues for lexical semantics. 26 3 Morphological Cues for...

Báo cáo khoa học: "Inflectional Thesaurus for Agglutinative Languages" docx

...

Báo cáo khoa học: "Discriminative Reranking for Semantic Parsing" pot

... shown for increasing valuesof n. The trends for CLANG and GEOQUERY aredifferent: small values of n show signiﬁcant im-provements for CLANG, while a larger n is neededto improve results for ... ap-plications, an interpreter for coaching in-structions in robotic soccer and a natural- language database interface. The resultsshow that reranking can improve the per-formance on the coaching ... parses can be adapted for semantic pars-ing, more concretely, for reranking the top SAPTsfrom the baseline model SCISSOR. The syntac-tic features introduced by Collins (2000) for syn-tactic parsing...

Báo cáo khoa học: "A FOUNDATION FOR SEMANTIC INTERPRETATION " pot

... logical form. ~ l~'ocsedings, 191h Annual Meeting of th, e Association for Computational Linguistics, Stanford, July 1981. 117-124. PARTEE, Baabara Hall (1973). "Some transformational ... (1982). Strategies for natural language processing. Hlllsdale, N J: Lawrence Erlbaum Associates, 1982. MARCUS, Mitchell P (1980). A theory of sgntactic recognition for natv.ral l~nguag¢. ... logical form." P~oceedin~s, ~O~h Annual Meeting of the Association for Computational Linguistics, Toronto, June 1982. i-8. SCHANK, Roger Carl (editor) (1975). Conceptual information...

Báo cáo khoa học: "Mildly Context-Sensitive Dependency Languages" potx

... notions of formal power.The close link between restricted forms of non-projective dependency languages and mildly context-sensitive grammar formalisms provides a promisingstarting point for future ... non-projectivity are discouraging:While grammar-driven dependency parsers that arerestricted to projective structures can be as efﬁcientas parsers for lexicalized context-free grammar (Eis-ner and Satta, ... mildly context-sensitive grammar for- malisms. Section 6 concludes the paper.2 PreliminariesThroughout the paper, we writeŒn for the set of allpositive natural numbers up to and including...

Xem thêm