Sciweavers

782 search results - page 7 / 157
» Can a Parser be Generated from Examples
Sort
View
ACL
2011
14 years 7 months ago
Web-Scale Features for Full-Scale Parsing
Counts from large corpora (like the web) can be powerful syntactic cues. Past work has used web counts to help resolve isolated ambiguities, such as binary noun-verb PP attachment...
Mohit Bansal, Dan Klein
134
Voted
ACL
2012
13 years 5 months ago
A Comparison of Chinese Parsers for Stanford Dependencies
Stanford dependencies are widely used in natural language processing as a semanticallyoriented representation, commonly generated either by (i) converting the output of a constitu...
Wanxiang Che, Valentin I. Spitkovsky, Ting Liu
159
Voted
ICFP
2012
ACM
13 years 5 months ago
Proof-producing synthesis of ML from higher-order logic
The higher-order logic found in proof assistants such as Coq and various HOL systems provides a convenient setting for the development and verification of pure functional program...
Magnus O. Myreen, Scott Owens
118
Voted
GG
2004
Springer
15 years 8 months ago
Parsing String Generating Hypergraph Grammars
A string generating hypergraph grammar is a hyperedge replacement grammar where the resulting language consists of string graphs i.e. hypergraphs modeling strings. With the help of...
Sebastian Seifert, Ingrid Fischer
JOT
2008
136views more  JOT 2008»
15 years 3 months ago
The Stock Statistics Parser
This paper describes how use the HTMLEditorKit to perform web data mining on stock statistics for listed firms. Our focus is on making use of the web to get information about comp...
Douglas Lyon