Sciweavers

78 search results - page 2 / 16
» One parser to rule them all
Sort
View
COLING
2000
14 years 6 days 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
JAC
2008
14 years 9 days ago
Sofic one head machines
There are several systems consisting in an object that moves on the plane by following a given rule. It is frequently observed that these systems eventually fall into an unexplaine...
Anahí Gajardo
ACL
1996
14 years 5 days ago
Efficient Normal-Form Parsing for Combinatory Categorial Grammar
Under categorial grammars that have powerful rules like composition, a simple n-word sentence can have exponentially many parses. Generating all parses is inefficient and obscures...
Jason Eisner
ICC
2007
IEEE
14 years 5 months ago
Reducing the Size of Rule Set in a Firewall
— A firewall’s complexity is known to increase with the size of its rule set. Complex firewalls are more likely to have configuration errors which cause security loopholes. ...
MyungKeun Yoon, Shigang Chen, Zhan Zhang
ACL
2009
13 years 8 months ago
Paraphrase Recognition Using Machine Learning to Combine Similarity Measures
This paper presents three methods that can be used to recognize paraphrases. They all employ string similarity measures apshallow abstractions of the input sentences, and a Maximu...
Prodromos Malakasiotis