Sciweavers

1942 search results - page 69 / 389
» Parse
Sort
View
COLING
1996
15 years 2 months ago
Towards a More Careful Evaluation of Broad Coverage Parsing Systems
Since treebanks have become available to researchers a wide variety of techniques has been used to make broad coverage parsing systems. This makes quantitative evaluation very imp...
Wide R. Hogenhout, Yuji Matsumoto
COLING
1994
15 years 2 months ago
Two Parsing Algorithms by Means of Finite State Transducers
We present a new apl)roach , ilhlstrated by two algorithms> for parsing not only Finite SI.ate (:Iranlnlars but also Context Free Grainlnars and their extension, by means of fi...
Emmanuel Roche
93
Voted
COLING
1990
15 years 1 months ago
Parsing Long English Sentences with Pattern Rules
In machine translation, parsing of long English sentences still causes some problems, whereas for short sentences a good machine translation system usually can generate readable t...
Wei-Chuan Li, Tzusheng Pei, Bing-Huang Lee, Chuei-...
ENTCS
2006
184views more  ENTCS 2006»
15 years 23 days ago
Scannerless Boolean Parsing
Scannerless generalized parsing techniques allow parsers to be derived directly from unified, declarative specifications. Unfortunately, in order to uniquely parse existing progra...
Adam Megacz
127
Voted
JCT
2006
110views more  JCT 2006»
15 years 21 days ago
Branch-width, parse trees, and monadic second-order logic for matroids
Abstract. We introduce "matroid parse trees" which, using only a limited amount of information at each node, can build up the vector representations of matroids of bounde...
Petr Hlinený