Sciweavers

367 search results - page 9 / 74
» Lexicalized Context-Free Grammars
Sort
View
DLT
2004
13 years 8 months ago
An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars
There is a close relationship between formal language theory and data compression. Since 1990's various types of grammar-based text compression algorithms have been introduced...
Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda
LATA
2010
Springer
14 years 1 months ago
Extending Stochastic Context-Free Grammars for an Application in Bioinformatics
We extend stochastic context-free grammars such that the probability of applying a production can depend on the length of the subword that is generated from the application and sho...
Frank Weinberg, Markus E. Nebel
COLING
2000
13 years 8 months ago
Robust German Noun Chunking With a Probabilistic Context-Free Grammar
We present a noun chunker for German which is based on a head-lexicalised probabilistic contextfl'ee grammar. A manually developed grammar was semi-automatically extended wit...
Helmut Schmid, Sabine Schulte im Walde
COLING
2002
13 years 7 months ago
A Novel Disambiguation Method for Unification-Based Grammars Using Probabilistic Context-Free Approximations
We present a novel disambiguation method for unification-based grammars (UBGs). In contrast to other methods, our approach obviates the need for probability models on the UBG side...
Bernd Kiefer, Hans-Ulrich Krieger, Detlef Prescher
FCCM
2000
IEEE
83views VLSI» more  FCCM 2000»
13 years 11 months ago
An FPGA-Based Coprocessor for the Parsing of Context-Free Grammars
This paper presents an FPGA-based implementation of a co-processing unit able to parse context-free grammars of real-life sizes. The application elds of such a parser range from p...
Cristian Ciressan, Eduardo Sanchez, Martin Rajman,...