#### Filter Results:

- Full text PDF available (89)

#### Publication Year

1992

2015

- This year (0)
- Last 5 years (20)
- Last 10 years (50)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### Key Phrases

Learn More

- Martin Redington, Nick Chater, Steven Finch
- Cognitive Science
- 1998

Many theorists have dismissed a priori the idea that distributional information could play a significant role in syntactic category acquisition. We demonstrate empirically that such information provides a powerful cue to syntactic category membership, which can be exploited by a variety of simple, psychologically plausible mechanisms. We present a range of… (More)

- Steven Finch
- SIGIR
- 1995

This paper describes a novel paradigm for representing many types of information about documents in a manner particularly suited to text categorization by a trivial empirical rule induction system. It also has potential application to full-text retrieval paradigms. The paradigm allows many different types of document predicates to be combined together with… (More)

- Andrei Mikheev, Steven Finch
- EACL
- 1995

In this paper we describe an architecture and functionality of main components of a workbench for an acquisition of domain knowledge from large text corpora. The workbench supports an incremental process of corpus analysis starting from a rough automatic extraction and organization of lexico-semantic regularities and ending with a computer supported… (More)

- Steven Finch
- 2004

Also, a process {Yt : t ≥ 0} is said to have independent increments if, for all t0 < t1 < . . . < tn, the n random variables Yt1 − Yt0 , Yt2 − Yt1 , ..., Ytn − Ytn−1 are independent. This condition implies that {Yt : t ≥ 0} is Markovian, but not conversely. The increments are further said to be stationary if, for any t > s and h > 0, the distribution of… (More)

- Steven Finch
- 2005

Let k 2 Z and let SL 2 (Z) denote the special linear group SL 2 (Z) = a b c d : a; b; c; d 2 Z and ad bc = 1 : A modular form of weight k is an analytic function f de…ned on the complex upper half plane H = fz 2 C : Im(z) > 0g that transforms under the action of SL 2 (Z) according to the relation [1] f az + b cz + d = (cz + d) k f (z) for all a b c d 2 SL 2… (More)

- Steven Finch
- 2003

When enumerating trees [1, 2] or prime divisors [3, 4], the leading term of the corresponding asymptotic series is usually sufficient for practical purposes. Greater accuracy is possible by using several more terms, but the coefficients are not as widely known as one might expect. We briefly provide the formulas required to compute the required constants,… (More)

- Steven Finch
- 2003

k) , t h e n t h e o p t i m a l s t r a t e g y i s t o r e j e c t t h e fi r s t m − 1 a p p l i c a n t s a n d a c c e p t t h e n e x t c a n d i d a t e , w h e r 1 ] c a l c u l a t e d t h e a s y m p t o t i c p r o b a b i l i t y o f s u c c e s s t o b e [ 1 2 ,

- Steven Finch
- 2009

- Andrei Mikheev, Steven Finch
- ANLP
- 1997

In this paper we report on a set of computational tools with (n)SGML pipeline data flow for uncovering internal structure in natural language texts. The main idea behind the workbench is the independence of the text representation and text analysis phases. At the representation phase the text is converted from a sequence of characters to features of… (More)

In this paper, the abstract computational principles underlying topographic maps are discussed. We give a definition of a “perfectly neighbourhood preserving” map, which we call a topographic homeomorphism, and we prove that this has certain desirable properties. It is argued that when a topographic homeomorphism does not exist (the usual case), many… (More)