Sciweavers

732 search results - page 13 / 147
» Using Types to Parse Natural Language
Sort
View
CICLING
2009
Springer
14 years 7 months ago
A General Method for Transforming Standard Parsers into Error-Repair Parsers
A desirable property for any system dealing with unrestricted natural language text is robustness, the ability to analyze any input regardless of its grammaticality. In this paper ...
Carlos Gómez-Rodríguez, Miguel A. Al...
PPCP
1993
13 years 10 months ago
Higher-Order Logic Programming as Constraint Logic Programming
Higher-order logic programming (HOLP) languages are particularly useful for various kinds of metaprogramming and theorem proving tasks because of the logical support for variable ...
Spiro Michaylov, Frank Pfenning
IJCNLP
2005
Springer
14 years 7 days ago
Automatic Partial Parsing Rule Acquisition Using Decision Tree Induction
Abstract. Partial parsing techniques try to recover syntactic information efficiently and reliably by sacrificing completeness and depth of analysis. One of the difficulties of pa...
Myung-Seok Choi, Chul Su Lim, Key-Sun Choi
ICCSA
2007
Springer
13 years 8 months ago
Improving the Customization of Natural Language Interface to Databases Using an Ontology
Natural language interfaces to databases are considered one of the best alternatives for final users who wish to make complex, uncommon and frequent queries, which is a very common...
M. Jose A. Zarate, Rodolfo A. Pazos, Alexander F. ...
EACL
2009
ACL Anthology
14 years 7 months ago
Enhancing Unlexicalized Parsing Performance Using a Wide Coverage Lexicon, Fuzzy Tag-Set Mapping, and EM-HMM-Based Lexical Proba
We present a framework for interfacing a PCFG parser with lexical information from an external resource following a different tagging scheme than the treebank. This is achieved by...
Yoav Goldberg, Reut Tsarfaty, Meni Adler, Michael ...