Paper 1

Patrick Blackburn & Johan Bos (2003): Computational Semantics. Theoria 18(1): 27-45. available also here.

--++++ Summary: Computational semantics is a mix of formal semantics, computational linguistics and automated reasoning. The goal is to convert NL into a formal logic suitable for automatc inference.

Why is it useful? Because built systems will have applications in many areas such as "information retrieval, information extraction, dialogue systems, question answering, interpreting controlled languages...". Then it will be important in progress our understanding of how NL works for example will help in understanding the interrelations between syntax, semantics and inference.

Which logic? It depends on what you want to do, level of detail (linguistics phenomena to represent). They argue that FOL is a good starting point. -Why FOL is a good starting point?

How to convert NL to the chosen logical representation?

-- FabrizioMorbini - 03 Dec 2006

Edit | Attach | Watch | Print version | History: r4 < r3 < r2 < r1 | Backlinks | Raw View | Raw edit | More topic actions...
Topic revision: r2 - 2006-12-06 - FabrizioMorbini
 
  • Edit
  • Attach
This site is powered by the TWiki collaboration platform Powered by PerlCopyright © 2008-2017 by the contributing authors. All material on this collaboration platform is the property of the contributing authors.
Ideas, requests, problems regarding URCS? Send feedback