Sciweavers

170 search results - page 7 / 34
» Parsing with Non-Deterministic Functions
Sort
View
PEPM
1995
ACM
13 years 11 months ago
The Essence of LR Parsing
Partial evaluation can turn a general parser into a parser generator. The generated parsers surpass those produced by traditional parser generators in speed and compactness. We us...
Michael Sperber, Peter Thiemann
ACL
1998
13 years 8 months ago
A Probabilistic Corpus-Driven Model for Lexical-Functional Analysis
Wc develop a l)ata-Oricntcd Parsing (DOP) model based on the syntactic representations of Lexicalf;unctional Grammar (LFG). We start by summarizing the original DOP model for tree...
Rens Bod, Ronald M. Kaplan
INFOCOM
2012
IEEE
11 years 10 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...
ACL
2007
13 years 9 months ago
An Ensemble Method for Selection of High Quality Parses
While the average performance of statistical parsers gradually improves, they still attach to many sentences annotations of rather low quality. The number of such sentences grows ...
Roi Reichart, Ari Rappoport
WCRE
2003
IEEE
14 years 22 days ago
RegReg: a Lightweight Generator of Robust Parsers for Irregular Languages
In reverse engineering, parsing may be partially done to extract lightweight source models. Parsing code containing preprocessing directives, syntactical errors and embedded langu...
Mario Latendresse