Sciweavers

1942 search results - page 53 / 389
» Parse
Sort
View
77
Voted
CICLING
2009
Springer
16 years 1 months ago
A General Method for Transforming Standard Parsers into Error-Repair Parsers
A desirable property for any system dealing with unrestricted natural language text is robustness, the ability to analyze any input regardless of its grammaticality. In this paper ...
Carlos Gómez-Rodríguez, Miguel A. Al...
101
Voted
ICPR
2010
IEEE
15 years 7 months ago
An Information Extraction Model for Unconstrained Handwritten Documents
In this paper, a new information extraction system by statistical shallow parsing in unconstrained handwritten documents is introduced. Unlike classical approaches found in the li...
Simon Thomas, Clement Chatelain, Laurent Heutte, T...
110
Voted
DCC
2010
IEEE
15 years 7 months ago
LZ77-Like Compression with Fast Random Access
We introduce an alternative Lempel-Ziv text parsing, LZ-End, that converges to the entropy and in practice gets very close to LZ77. LZ-End forces sources to finish at the end of ...
Sebastian Kreft, Gonzalo Navarro
116
Voted
IBPRIA
2003
Springer
15 years 6 months ago
Smoothing Techniques for Tree-k-Grammar-Based Natural Language Modeling
Abstract. In a previous work, a new probabilistic context-free grammar (PCFG) model for natural language parsing derived from a tree bank corpus has been introduced. The model esti...
Jose L. Verdú-Mas, Jorge Calera-Rubio, Rafa...
87
Voted
LACL
1998
Springer
15 years 4 months ago
Sequential Construction of Logical Forms
In this paper we give a formal description of the parsing model that underlies the treatment of Long Distance Dependencies, Topic and Focus, Ellipsis and Quantification in, amongs...
Wilfried Meyer-Viol