21 search results - page 2 / 5 » Testing Grammars For Top-Down Parsers |
LREC
2010
13 years 6 months ago
2010
This paper describes a hybrid tagger/parser for French (FrAG), and presents results from ongoing development work, corpus annotation and evaluation. The core of the system is a se...
EMNLP
2010
13 years 2 months ago
2010
We introduce a novel training algorithm for unsupervised grammar induction, called Zoomed Learning. Given a training set T and a test set S, the goal of our algorithm is to identi...
COLING
2010
12 years 11 months ago
2010
Unknown words are a major issue for large-scale grammars of natural language. We propose a machine learning based algorithm for acquiring lexical entries for all forms in the para...
IWPT
2001
13 years 6 months ago
2001
A parsing system returning analyses in the form of sets of grammatical relations can obtain high precision if it hypothesises a particular relation only when it is certain that th...
TOOLS
1992
IEEE
13 years 8 months ago
1992
IEEE
This paper describes an Ei el system for rapid testing of grammars. Grammars are de ned in an extended BNF notation that allows actions on the parse tree nodes to be de ned as add...