A non-projective dependency parser
Published 1 January 1997Open access
Pasi Tapanainen, Timo Järvinen
Citations370
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This work describes a practical parser for unrestricted dependencies that creates links between words and names the links according to their syntactic functions.
Abstract
We describe a practical parser for unrestricted dependencies. The parser creates links between words and names the links according to their syntactic functions. We first describe the older Constraint Grammar parser where many of the ideas come from. Then we proceed to describe the central ideas of our new parser. Finally, the parser is evaluated.
Keywords
Computer Science
Three new probabilistic models for dependency parsing
630 Citations1996Jason Eisner
Preliminary empirical results from evaluating the three models' parsing performance on annotated Wall Street Journal training text (derived from the Penn Treebank) suggest the generative model performs significantly better than the others, and does about equally well at assigning part-of-speech tags.
arXiv (Cornell University)Parsing English with a Link Grammar
221 Citations1995Daniel D. Sleator, Davy Temperley
Constraint grammar as a framework for parsing running text
206 Citations1990Fred Karlsson
This work presents a formalism to be used for parsing where the grammar statements are closer to real text sentences and more directly address some notorious parsing problems, especially ambiguity.
arXiv (Cornell University)Three New Probabilistic Models for Dependency Parsing: An Exploration
165 Citations1997Jason Eisner
Disambiguation of morphological analysis in Bantu languages
48 Citations1996Arvi Hurskainen
The paper describes problems in disambiguating the morphological analysis of Bantu languages by using Swahili as a test language and solutions for resolving different types of ambiguity are presented.
Annotating 200 million words
30 Citations1994Timo Järvinen
The whole 200 million word corpus is being annotated morphologically and syntactically during 1993--94 at the Research Unit for Computational Linguistics, University of Helsinki, using the English morphological analyser (ENGTWOL) and English Constraint Grammar (ENGCG) parser.
Lecture notes in computer scienceInducing constraint grammars
26 Citations1996Christer Samuelsson, Pasi Tapanainen +1 more
A simple scheme based on local information, i.e., on lexical biases and next-neighbour contexts, extended through the use of barriers, reached 87.3 % precision (1.12 tags/word) at 98.2 % recall.
Syntactic analysis of natural language using linguistic rules and corpus-based patterns
13 Citations1994Pasi Tapanainen, Timo Järvinen
A system for generating and applying corpus-based patterns for syntactic annotation of unrestricted text and discusses possible refinements of the method from a linguistic point of view.