A freely available wide coverage morphological analyzer for English

Published 1 January 1992

Daniel Karp, Yves Schabes, Martin Zaidel, Dania Egedi

Citations94

TL;DR

This paper presents a morphological lexicon for English that handle more than 317000 inflected forms derived from over 90000 stems and is the only available free English morphological analyzer with very wide coverage.

Abstract

This paper presents a morphological lexicon for English that handle more than 317000 inflected forms derived from over 90000 stems. The lexicon is available in two formats. The first can be used by an implementation of a two-level processor for morphological analysis (Karttunen and Wittenburg, 1983; Antworth, 1990). The second, derived from the first one for efficiency reasons, consists of a disk-based database using a UNIX hash table facility (Seltzer and Yigit, 1991). We also built an X Window tool to facilitate the maintenance and browsing of the lexicon. The package is ready to be integrated into an natural language application such as a parser through hooks written in Lisp and C.To our knowledge, this package is the only available free English morphological analyzer with very wide coverage.

Keywords

Computer Science

Digital Access to Scholarship at Harvard (DASH) (Harvard University)An introduction to unification-based approaches to grammar

946 Citations1986Stuart M. Shieber

View PDF

Helda (University of Helsinki)Two-Level Morphology: A General Computational Model for Word-Form Recognition and Production

792 Citations1983Kimmo Koskenniemi

View PDF

Computational complexity and natural language

273 Citations1987Geoff Barton, Robert C. Berwick +1 more

A unified and coherent account emerges of how complexity theory can probe the information-processing structure of grammars, discovering why a grammar is easy or difficult to process and suggesting where to look for additional grammatical constraints.

A New Hashing Package for UNIX.

35 Citations1991Margo Seltzer, Ozan Yigit

The design and performance characteristics of a new hashing package providing a superset of the functionality provided by dBM and hsearch are presented, which uses linear hashing to provide efficient support of both memory based and disk based hash tables with performance superior to both dbm and h search under most conditions.

XTAG

29 Citations1992Patrick Paroubek, Yves Schabes +1 more

The use of Common Lisp without its object language addition and the use of the X Window interface to Common Lisp (CLX) for the implementation of XTAG, a development of tree-adjoining grammars and their parsers, are described.

View PDF

Complexity, Two-Level Morphology and Finnish

25 Citations1988Kimmo Koskenniemi, Kenneth Church

This paper will discuss Barton's theoretical argument and explain why it has not been a problem for us in practice and why the method is not NP-hard.

View PDF

Text on tap

17 Citations1989Mark Liberman

This work states that corpus-based studies are critical for the development of adequate models of linguistic structure and for insights into the nature of language use, but research workers have been severely hampered by the lack of appropriate materials.

View PDF