TAILIEUCHUNG - Báo cáo khoa học: "AN ALGORITHM FOR VP ELLIPSIS"

An algorithm is proposed to determine antecedents for VP ellipsis. The algorithm eliminates impossible antecedents, and then imposes a preference ordering on possible antecedents. The algorithm performs with 94% accuracy on a set of 304 examples of VP ellipsis collected from the Brown Corpus. The problem of determining antecedents for VP ellipsis has received little attention in the literature, and it is shown that the current proposal is a significant improvement over alternative approaches. | AN ALGORITHM FOR VP ELLIPSIS Daniel Hardt Department of Computer and Information Science University of Pennsylvania Philadelphia PA 19104 Internet hardt ABSTRACT An algorithm is proposed to determine antecedents for VP ellipsis. The algorithm eliminates impossible antecedents and then imposes a preference ordering on possible antecedents. The algorithm performs with 94 accuracy on a set of 304 examples of VP ellipsis collected from the Brown Corpus. The problem of determining antecedents for VP ellipsis has received little attention in the literature and it is shown that the current proposal is a significant improvement over alternative approaches. INTRODUCTION To understand an elliptical expression it is necessary to recover the missing material from surrounding context. This can be divided into two subproblems first it is necessary to determine the antecedent expression. Second a method of reconstructing the antecedent expression at the ellipsis site is required. Most of the literature on ellipsis has concerned itself with the second problem. In this paper I propose a solution for the first problem that of determining the antecedent. I focus on the case of VP ellipsis. VP ellipsis is defined by the presence of an auxiliary verb but no VP as in the following example1 1 a. It might have rained any time b. only - it did not. To interpret the elliptical VP did not the antecedent must be determined in this case rained is the only possibility. The input to the algorithm is an elliptical VP and a list of VP s occurring in proximity to the elliptical VP. The algorithm eliminates certain VP s 1A11 examples are taken from the Brown Corpus unless otherwise noted. that are impossible antecedents. Then it assigns preference levels to the remaining VP s based on syntactic configurations as well as other factors. Any VP s with the same preference level are ordered in terms of proximity to the elliptical VP. The antecedent is the VP with the highest preference

• Báo cáo khoa học
• AN ALGORITHM
• VP ELLIPSIS
• Daniel Hardt
• báo cáo khoa học
• mô hình ngôn ngữ
• xử lý ngôn ngữ tự nhiên
• Solving uncapacitated multiple allocation p hub center problem
• Dijkstra’s algorithm based genetic algorithm and simulated annealing
• Dijkstra’s algorithm based genetic algorithm
• Large scale standard data sets
• P hub center problem
• Algorithm design
• Lecture Algorithm design
• Algorithm analysis
• Dynamic programming
• Hirschbergs algorithm
• Bellman Ford algorithm
• Computer Security
• Role Based Access Control
• Role Classification Algorithm
• Algorithm Preliminaries
• Algorithm Training Phase
• Algorithm Classification Phase
• Computational tractability
• Asymptotic order of growth
• Polynomial running time
• Greedy Algorithms
• Dijkstras algorithm
• Minimum spanning trees
• Network flow
• Ford Fulkerson algorithm
• Max flow min cut theorem
• International Journal of computer science & communication networks
• Anomaly detection using genetic
• SVM algorithm in data mining
• Algorithm in data mining
• K mean algorithm
• Two algorithm genetic and SVM
• Optimization of machining processes using pattern search algorithm
• Pattern search algorithm
• The PS algorithm
• Machining optimization problems
• Lecture Data Structure and Algorithm
• Bài giảng Cấu trúc dữ liệu và thuật toán
• Data Structure and Algorithm
• Sorting algorithm
• External sort
• Internal sort
• NTRU encryption algorithm
• Digital signature scheme
• Lectures on the NTRU encryption algorithm
• The NTRU encryption algorithm
• Some basic NTRU security issues
• Local search
• Gradient descent
• Metropolis algorithm
• Vietnam Journal of Earth Sciences
• Algorithm and program for earthquake prediction
• Algorithm and program based on the geological
• Algorithm and program based on the geophysical
• Algorithm and program based on the geomorphological
• The maximum magnitude values Mmax
• International Journal of Computer Networks and Communications Security
• New encryption algorithm
• Network RFWKIDEA8 1
• Transformation of AES encryption algorithm
• New block encryption algorithm
• Fault aware and congestion aware routing algorithm
• On Odd Even algorithm
• Network on chip
• The Fault Aware Dynamic Routing algorithm
• Advanced Algorithms Analysis and Design
• Lecture Advanced Algorithms Analysis and Design
• Bài giảng Phân tích và thiết kế thuật toán nâng cao
• The Floyd Warshall algorithm
• Johnson’s algorithm
• A Hardware implementation
• Winograd Fourier Transform
• Discrete fourier transform
• Winograd fourier transform algorithm
• Winograd’s small convolution algorithm
• Transform algorithm for Cryptography
• Graph search
• Graph connectivity
• Graph traversal
• Coin changing
• Optimal caching
• Counting inversions
• Closest pair of points
• Randomized quicksort
• Master theorem
• Integer multiplication
• Matrix multiplication
• Weighted interval scheduling
• Knapsack problem
• Bipartite matching
• Disjoint paths
• Assignment problem
• Input queued switching
• Poly time reductions
• Constraint satisfaction problems
• Graph coloring
• Decision problems
• NP complete
• Nondeterministic polynomial