Sciweavers

254 search results - page 2 / 51
» Efficient Transformation-Based Parsing
Sort
View
ACL
1989
14 years 10 months ago
Efficient Parsing for French
Parsing with categorial grammars often leads to problems such as proliferating lexical ambiguity, spurious parses and overgeneration. This paper presents a parser for French devel...
Claire Gardent, Gabriel G. Bès, Pierre-Fran...
CORR
2000
Springer
110views Education» more  CORR 2000»
14 years 9 months ago
Efficient probabilistic top-down and left-corner parsing
This paper examines efficient predictive broadcoverage parsing without dynamic programming. In contrast to bottom-up methods, depth-first top-down parsing produces partial parses ...
Brian Roark, Mark Johnson
ACTA
2000
302views more  ACTA 2000»
14 years 9 months ago
Efficiently building a parse tree from a regular expression
We show in this paper that parsing with regular expressions instead of context-free grammars, when it is possible, is desirable. We present efficient algorithms for performing diff...
Danny Dubé, Marc Feeley
EACL
1993
ACL Anthology
14 years 11 months ago
Ambiguity resolution in a reductionistic parser
We are concerned with dependencyoriented morphosyntactic parsing of running text. While a parsing grammar should avoid introducing structurallyunresolvable distinctionsin order to...
Atro Voutilainen, Pasi Tapanainen
GRAMMARS
2000
100views more  GRAMMARS 2000»
14 years 9 months ago
Tabulation of Automata for Tree-Adjoining Languages
Abstract. We propose a modular design of tabular parsing algorithms for treeadjoining languages. The modularity is made possible by a separation of the parsing strategy from the me...
Miguel A. Alonso, Mark-Jan Nederhof, Eric Villemon...