Sciweavers

ACL
1994
13 years 11 months ago
Similarity-Based Estimation of Word Cooccurrence Probabilities
In many applications of natural language processing it is necessary to determine the likelihood of a given word combination. For example, a speech recognizer may need to determine...
Ido Dagan, Fernando C. N. Pereira, Lillian Lee
ACL
1994
13 years 11 months ago
On Determining the Consistency of Partial Descriptions of Trees
1 We examine the consistency problem for descriptions of trees based on remote dominance, and present a consistency-checking algorithm which is polynomial in the number of nodes in...
Tom Cornell
ACL
1994
13 years 11 months ago
Relating Complexity to Practical Performance in Parsing with Wide-Coverage Unification Grammars
The paper demonstrates that exponential complexities with respect to grammar size and input length have little impact on the performance of three unification-based parsing algorit...
John Carroll
ACL
1994
13 years 11 months ago
Word-Sense Disambiguation Using Decomposable Models
Most probabilistic classi ers used for word-sense disambiguationhave either been based on onlyone contextual feature or have used a model that is simply assumed to characterize th...
Rebecca F. Bruce, Janyce Wiebe
ACL
1994
13 years 11 months ago
Generalized Chart Algorithm: An Efficient Procedure for Cost-Based Abduction
We present an efficient procedure for cost-based abduction, which is based on the idea of using chart parsers as proof procedures. We discuss in detail three features of our algor...
Yasuharu Den
ACL
1993
13 years 11 months ago
A Logical Semantics for Nonmonotonic Sorts
Mark A. Young, William C. Rounds
ACL
1993
13 years 11 months ago
Using Bracketed Parses to evaluate a Grammar Checking Application
We describe a method for evaluating a grammar checking application with hand-bracketed parses. A randomly-selected set of sentences was submitted to a grammar checker in both brac...
Richard H. Wojcik, Philip Harrison, John Bremer