Sciweavers

30 search results - page 5 / 6
» Fast Parsing Using Pruning and Grammar Specialization
Sort
View
COLING
1990
13 years 8 months ago
Efficient Disjunctive Unification for Bottom-Up Parsing
This paper describes two novel techniques which, when applied together, in practice significantly reduce the time required for unifying disjunctive feature structures. The first i...
David M. Carter
INFOCOM
2012
IEEE
11 years 9 months ago
FlowSifter: A counting automata approach to layer 7 field extraction for deep flow inspection
Abstract—In this paper, we introduce FlowSifter, a systematic framework for online application protocol field extraction. FlowSifter introduces a new grammar model Counting Regu...
Chad R. Meiners, Eric Norige, Alex X. Liu, Eric To...
DAS
2006
Springer
13 years 11 months ago
Structural Analysis of Mathematical Formulae with Verification Based on Formula Description Grammar
In this paper, a reliable and efficient structural analysis method for mathematical formulae is proposed for practical mathematical OCR. The proposed method consists of three steps...
Seiichi Toyota, Seiichi Uchida, Masakazu Suzuki
ACL
2008
13 years 8 months ago
Efficient Multi-Pass Decoding for Synchronous Context Free Grammars
We take a multi-pass approach to machine translation decoding when using synchronous context-free grammars as the translation model and n-gram language models: the first pass uses...
Hao Zhang, Daniel Gildea
JOLLI
2006
101views more  JOLLI 2006»
13 years 7 months ago
A Note on the Expressive Power of Probabilistic Context Free Grammars
We examine the expressive power of probabilistic context free grammars (PCFGs), with a special focus on the use of probabilities as a mechanism for reducing ambiguity by filtering ...
Gabriel G. Infante López, Maarten de Rijke