![](bg6.png)
REFERENCES
Auer, S., Bizer, C., Kobilarov, G., Lehmann, J., Cyganiak,
R., and Ives, Z. (2007). Dbpedia: A nucleus for a web
of open data. The Semantic Web, pages 722–735.
Banerjee, S. and Pedersen, T. (2002). An Adapted Lesk Al-
gorithm for Word Sense Disambiguation Using Word-
Net, volume 2276 of Lecture Notes in Computer Sci-
ence. Springer Berlin / Heidelberg.
Baral, C., Dzifcak, J., and Son, T. C. (2008). Using an-
swer set programming and lambda calculus to char-
acterize natural language sentences with normatives
and exceptions. In Proceedings of the 23rd national
conference on Artificial intelligence - Volume 2, pages
818–823. AAAI Press.
Bos, J. and Markert, K. (2005). Recognising textual en-
tailment with logical inference. In HLT ’05: Pro-
ceedings of the conference on Human Language Tech-
nology and Empirical Methods in Natural Language
Processing, pages 628–635. Association for Compu-
tational Linguistics.
Cer, D., de Marneffe, M., Jurafsky, D., and Manning, C.
(2010). Parsing to stanford dependencies: Trade-offs
between speed and accuracy. LREC 2010.
Charniak, E. (1996). Tree-bank grammars. In Proceedings
of the National Conference on Artificial Intelligence,
pages 1031–1036.
Charniak, E. and Johnson, M. (2005). Coarse-to-fine n-best
parsing and maxent discriminative reranking. In Pro-
ceedings of the 43rd Annual Meeting on Association
for Computational Linguistics, pages 173–180. Asso-
ciation for Computational Linguistics.
Chomsky, N. (1956). Three models for the description of
language. IEEE Transactions on Information Theory,
2(3):113–124.
Chomsky, N. (1957). Syntactic Structures. The MIT Press.
Church, A. (1932). A set of postulates for the foundation of
logic. The Annals of Mathematics, 33(2):346–366.
Collins, M. (1996). A new statistical parser based on bigram
lexical dependencies. In Proceedings of the 34th an-
nual meeting on Association for Computational Lin-
guistics, pages 184–191. Association for Computa-
tional Linguistics.
Collins, M. (1997). Three generative, lexicalised models
for statistical parsing. In Proceedings of the 35th An-
nual Meeting of the Association for Computational
Linguistics and Eighth Conference of the European
Chapter of the Association for Computational Lin-
guistics, pages 16–23. Association for Computational
Linguistics.
Costantini, S. and Paolucci, A. (2008). Semantically aug-
mented DCG analysis for next-generation search en-
gine. CILC (July 2008).
Costantini, S. and Paolucci, A. (2010). Towards translating
natural language sentences into asp. In Proc. of the
Intl. Worksh. on Answer Set Programming and Other
Computing Paradigms (ASPOCP), Edimburgh.
De Marneffe, M., MacCartney, B., and Manning, C. (2006).
Generating typed dependency parses from phrase
structure parses. In Proceedings of LREC, volume 6,
pages 449–454. Citeseer.
De Marneffe, M. and Manning, C. (2008). The stanford
typed dependencies representation. In Coling 2008:
Proceedings of the workshop on Cross-Framework
and Cross-Domain Parser Evaluation, pages 1–8. As-
sociation for Computational Linguistics.
Eiter, T. (2010). Answer set programming for the semantic
web. Logic Programming, pages 23–26.
Kasneci, G., Ramanath, M., Suchanek, F., and Weikum, G.
(2008). The YAGO-NAGA approach to knowledge
discovery. SIGMOD Record, 37(4):41–47.
Klein, D. and Manning, C. (2003a). Accurate unlexicalized
parsing. In Proceedings of the 41st Annual Meeting on
Association for Computational Linguistics-Volume 1,
pages 423–430. Association for Computational Lin-
guistics.
Klein, D. and Manning, C. (2003b). Fast exact inference
with a factored model for natural language parsing.
Advances in neural information processing systems,
pages 3–10.
Kowalski, R. (2011). Computational Logic and Human
Thinking: How to be Artificially Intelligent - In Press.
Cambridge University Press.
McClosky, D., Charniak, E., and Johnson, M. (2006). Ef-
fective self-training for parsing. In Proceedings of
the main conference on Human Language Technol-
ogy Conference of the North American Chapter of the
Association of Computational Linguistics, pages 152–
159. Association for Computational Linguistics.
Moll´a, D. and Hutchinson, B. (2003). Intrinsic versus ex-
trinsic evaluations of parsing systems. In Proceed-
ings of the EACL 2003 Workshop on Evaluation Ini-
tiatives in Natural Language Processing: are evalua-
tion methods, metrics and resources reusable?, pages
43–50. Association for Computational Linguistics.
Neuhaus, P. and Br¨oker, N. (1997). The complexity
of recognition of linguistically adequate dependency
grammars. In Proc. of ACL-97/EACL-97.
Pereira, F. and Shieber, S. (2002). Prolog and natural-
language analysis. Microtome Publishing.
Petrov, S., Barrett, L., Thibaux, R., and Klein, D. (2006).
Learning accurate, compact, and interpretable tree an-
notation. In Proceedings of the 21st International
Conference on Computational Linguistics and the
44th annual meeting of the Association for Compu-
tational Linguistics, pages 433–440. Association for
Computational Linguistics.
Petrov, S. and Klein, D. (2007). Improved inference for
unlexicalized parsing. In Proceedings of NAACL HLT
2007, pages 404–411.
Schindlauer, R. (2006). Answer-set programming for the
Semantic Web.
Tesni`ere, L. (1959). El`ements de syntaxe structurale.
Klincksieck, Paris. ISBN 2252018615.
A FRAMEWORK FOR STRUCTURED KNOWLEDGE EXTRACTION AND REPRESENTATION FROM NATURAL
LANGUAGE THROUGH DEEP SENTENCE ANALYSIS
287