Báo cáo khoa học: "SENTENCE FRAGMENTS REGULAR STRUCTURES" potx
... comprise all sentence types: assertions, questions, fragments, and so forth.) Table 1. Fragments in three domaiu~ Total centers Percent fragments CASP.EPS 153 53% ]~s.J~F OP.~ 41 7S% TFR ... ,- objba_frag; OBJ_GAP - obj L~p_fraEment. which is a regularized representation of syntactic structure ~)ah11987 ], fragments are regularized to paranel full assertions by the use of dum...
Ngày tải lên: 31/03/2014, 18:20
Ngày tải lên: 19/02/2014, 19:20
... A0 PAS A1 rel characterize PAS rel characterize A0 rel characterize (c) Figure 1: Compact PAS-PTK structures of s 1 (a) and s 2 (b) and some fragments they have in common as produced by the PTK (c). Arguments are replaced with their most ... notice that the semantic similarity between sentences is explic- itly visible in terms of common fragments extracted by the PTK from their respective...
Ngày tải lên: 20/02/2014, 09:20
Tài liệu Báo cáo khoa học: "Sentence generation as a planning problem" pptx
Ngày tải lên: 20/02/2014, 12:20
Tài liệu Báo cáo khoa học: "Constraints over Lambda-Structures in Semantic Under specification" pptx
Ngày tải lên: 20/02/2014, 18:20
Tài liệu Báo cáo khoa học: "Sentence Disambiguation by a Shift-Reduce Parsing Technique" pot
Ngày tải lên: 21/02/2014, 20:20
Tài liệu Báo cáo khoa học: "HORN EXTENDED FEATURE STRUCTURES: FAST UNIFICATION WITH NEGATION AND LIMITED DISJUNCTION" ppt
Ngày tải lên: 22/02/2014, 10:20
Báo cáo khoa học: "Sentence Dependency Tagging in Online Question Answering Forums" pdf
Ngày tải lên: 07/03/2014, 18:20
Báo cáo khoa học: "Sentence Simplification by Monolingual Machine Translation" pdf
... constitute as sensible simplifications. It does not split sentences (which the Zhu and RevILP systems regularly do); it only rephrases phrases. Yet, it does this better than a word-substitution baseline,
Ngày tải lên: 07/03/2014, 18:20
Báo cáo khoa học: "Sentence Diagram Generation Using Dependency Parsing Elijah Mayfield Division of Science and Mathematics " docx
... R, A > from A to perform if that re- lation is the root relation in the graph. 2. Determining regular actions: For each re- lation type R ∈ S, create an ordered list of actions Reln < R,
Ngày tải lên: 08/03/2014, 01:20