ACL 2007 | Sciweavers

15

ACL
1994

95views Computational Linguistics» more ACL 1994»

13 years 7 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

claim paper

Read More »

13

click to vote

ACL
1994

96views Computational Linguistics» more ACL 1994»

On Determining the Consistency of Partial Descriptions of Trees

13 years 7 months ago

Download www.aclweb.org

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

claim paper

Read More »

11

click to vote

ACL
1994

72views Computational Linguistics» more ACL 1994»

Relating Complexity to Practical Performance in Parsing with Wide-Coverage Unification Grammars

13 years 7 months ago

Download www.aclweb.org

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

claim paper

Read More »

10

click to vote

ACL
1994

99views Computational Linguistics» more ACL 1994»

Word-Sense Disambiguation Using Decomposable Models

13 years 7 months ago

Download www.cs.pitt.edu

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

claim paper

Read More »

9

click to vote

ACL
1994

83views Computational Linguistics» more ACL 1994»

Simulating Children's Null Subjects: An Early Language Generation Model

13 years 7 months ago

Download acl.ldc.upenn.edu

Carole T. Boster

claim paper

Read More »

12

click to vote

ACL
1994

93views Computational Linguistics» more ACL 1994»

Generalized Chart Algorithm: An Efficient Procedure for Cost-Based Abduction

13 years 7 months ago

Download www.aclweb.org

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

claim paper

Read More »

15

click to vote

ACL
1993

91views Computational Linguistics» more ACL 1993»

A Logical Semantics for Nonmonotonic Sorts

13 years 7 months ago

Download www.aclweb.org

Mark A. Young, William C. Rounds

claim paper

Read More »

13

click to vote

ACL
1993

83views Computational Linguistics» more ACL 1993»

Using Bracketed Parses to evaluate a Grammar Checking Application

13 years 7 months ago

Download www.aclweb.org

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

claim paper

Read More »

16

click to vote

ACL
1993

89views Computational Linguistics» more ACL 1993»

The Imperfective Paradox and Trajectory-of-Motion Events

13 years 7 months ago

Download www.aclweb.org

Michael White

claim paper