Sciweavers

Share
NLE
2008
106views more  NLE 2008»
9 years 2 months ago
Robust parsing and spoken negotiative dialogue with databases
This paper presents a robust parsing algorithm and semantic formalism for the interpretation of utterances in spoken negotiative dialogue with databases. The algorithm works in tw...
Johan Boye, Mats Wirén
IJCAI
1989
9 years 3 months ago
Formal Properties and Implementation of Bidirectional Charts
Several theories of grammar currently converge toward inserting subcategorization information within lexical entries. Such a tendency would benefit from a parsing algorithm able t...
Giorgio Satta, Oliviero Stock
AAAI
1990
9 years 3 months ago
Parsing a Natural Language Using Mutual Information Statistics
The purpose of this paper is to characterize a constituent boundary parsing algorithm, using an information-theoretic measure called generalized mutual information, which serves a...
David M. Magerman, Mitchell P. Marcus
ACL
1996
9 years 3 months ago
Efficient Transformation-Based Parsing
In transformation-based parsing, a finite sequence of tree rewriting rules are checked for application to an input structure. Since in practice only a small percentage of rules ar...
Giorgio Satta, Eric Brill
ACL
1996
9 years 3 months ago
Parsing Algorithms and Metrics
Many different metrics exist for evaluating parsing results, including Viterbi, Crossing Brackets Rate, Zero Crossing Brackets Rate, and several others. However, most parsing algo...
Joshua Goodman
ACL
1994
9 years 3 months ago
An Extended Theory of Head-Driven Parsing
We show that more head-driven parsing algorithms can he formulated than those occurring in the existing literature. These algorithms are inspired by a family of left-to-right pars...
Mark-Jan Nederhof, Giorgio Satta
ACL
1994
9 years 3 months ago
An Optimal Tabular Parsing Algorithm
In this paper we relate a number of parsing algorithms which have been developed in very different areas of parsing theory, and which include deterministic algorithms, tabular alg...
Mark-Jan Nederhof
EMNLP
2007
9 years 3 months ago
Online Learning for Deterministic Dependency Parsing
Deterministic parsing has emerged as an effective alternative for complex parsing algorithms which search the entire search space to get the best probable parse tree. In this pape...
Prashanth Mannem
FPL
2001
Springer
101views Hardware» more  FPL 2001»
9 years 7 months ago
An FPGA-Based Syntactic Parser for Real-Life Almost Unrestricted Context-Free Grammars
This paper presents an FPGA-based implementation of a syntactic parser that can process languages generated by almost unrestricted real-life context-free grammars (CFGs). More prec...
Cristian Ciressan, Eduardo Sanchez, Martin Rajman,...
books