ACL
1997
13 years 11 months ago
1997
ACL
1997
13 years 11 months ago
1997
Valiant showed that Boolean matrix multiplication (BMM) can be used for CFG parsing. We prove a dual result: CFG parsers running in time O([Gl[w[3-e) on a grammar G and a string w...
ACL
1997
13 years 11 months ago
1997
This paper presents an algorithm for the compilation of regular formalisms with rule features into finite-state automata. Rule features are incorporated into the right context of ...
ACL
1997
13 years 11 months ago
1997
We propose a new method of classifying documents into categories. We define for each category a finite mixture model based on soft clustering of words. We treat the problem of cla...
ACL
1997
13 years 11 months ago
1997
As the text databases available to users become larger and more heterogeneous, genre becomes increasingly important for computational linguistics as a complement to topical and st...
ACL
1997
13 years 11 months ago
1997
This paper describes the conversion of a Hidden Markov Model into a sequential transducer that closely approximates the behavior of the stochastic model. This transformation is es...
ACL
1997
13 years 11 months ago
1997
This paper discusses research on distinguishing word meanings in the context of information retrieval systems. We conducted experiments with three sources of evidence for making t...
ACL
1997
13 years 11 months ago
1997
A system for the automatic production of
ACL
1997
13 years 11 months ago
1997
Most algorithms dedicated to the generation of referential descriptions widely suffer from a fundamental problem: they make too strong assumptions about adjacent processing compon...
ACL
1997
13 years 11 months ago
1997
We provide a general account of parallelism in discourse, and apply it to the special case of resolving possible readings for instances of VP ellipsis. We show how several problem...